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

1

# DP: updates from the 4.8 branch upto 20140112 (r206564).

2

3

last_updated()

4

{

5

cat > ${dir}LAST_UPDATED <<EOF

6

Sun Jan 12 12:14:23 CET 2014

7

Sun Jan 12 11:14:23 UTC 2014 (revision 206564)

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: libgomp/ChangeLog

16

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

17

--- a/src/libgomp/ChangeLog (.../tags/gcc_4_8_2_release)

18

+++ b/src/libgomp/ChangeLog (.../branches/gcc-4_8-branch)

19

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

20

+2013-12-12 Jakub Jelinek <jakub@redhat.com>

21

+

22

+ PR libgomp/59467

23

+ * testsuite/libgomp.fortran/crayptr2.f90: Add private (d) clause to

24

+ !$omp parallel.

25

+

26

2013-10-16 Release Manager

27

28

* GCC 4.8.2 released.

29

Index: libgomp/testsuite/libgomp.fortran/crayptr2.f90

30

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

31

--- a/src/libgomp/testsuite/libgomp.fortran/crayptr2.f90 (.../tags/gcc_4_8_2_release)

32

+++ b/src/libgomp/testsuite/libgomp.fortran/crayptr2.f90 (.../branches/gcc-4_8-branch)

33

@@ -12,7 +12,7 @@

34

b = 2

35

c = 3

36

l = .false.

37

-!$omp parallel num_threads (3) reduction (.or.:l)

38

+!$omp parallel num_threads (3) reduction (.or.:l) private (d)

39

if (omp_get_thread_num () .eq. 0) then

40

ip = loc (a)

41

elseif (omp_get_thread_num () .eq. 1) then

42

Index: libstdc++-v3/configure

43

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

44

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

45

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

46

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

47

fi

48

49

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

50

-libtool_VERSION=6:18:0

51

+libtool_VERSION=6:19:0

52

53

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

54

case $enable_symvers in

55

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

56

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

57

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

58

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

59

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

60

61

62

63

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

64

</itemizedlist>

65

</listitem>

66

67

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

68

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

69

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

70

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

71

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

72

</itemizedlist>

73

<para>

74

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

75

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

76

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

77

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

78

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

79

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

80

</itemizedlist>

81

</listitem>

82

83

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

84

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

85

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

86

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

87

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

88

89

</row>

90

<row>

91

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

92

93

<entry>Other transformations</entry>

94

- <entry>Y</entry>

95

- <entry/>

96

+ <entry>Partial</entry>

97

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

98

</row>

99

<row>

100

101

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

102

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

103

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

104

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

105

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

106

107

108

109

+ <year>2013</year>

110

111

112

</holder>

113

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

114

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

115

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

116

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

117

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

118

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

119

-<!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>

120

\ No newline at end of file

121

+<!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>

122

\ No newline at end of file

123

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

124

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

125

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

126

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

127

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

128

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

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></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>

130

\ No newline at end of file

131

+<!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>

132

\ No newline at end of file

133

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

134

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

135

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

136

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

137

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

138

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

139

-<!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 ©

140

+<!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 ©

141

2008, 2010

142

143

144

- </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">

145

+ </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">

146

What is libstdc++?

147

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

148

Why should I use libstdc++?

149

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

150

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

151

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

152

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

153

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

154

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

155

-<!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>

156

+<!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>

157

158

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

159

</a>

160

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

161

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

162

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

163

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

164

- </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.

165

+ </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.

166

Introduction

167

168

</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.

169

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

170

</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.

171

Utilities

172

173

-</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.

174

+</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.

175

Strings

176

177

</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.

178

Localization

179

180

-</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.

181

+</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.

182

Containers

183

184

</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.

185

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

186

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

187

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

188

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

189

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

190

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

191

-<!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 ©

192

+<!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 ©

193

2008

194

,

195

2010

196

197

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

198

</a>

199

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

200

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

201

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

202

</a>

203

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

204

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

205

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

206

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

207

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

208

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

209

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

210

-<!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.

211

+<!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.

212

Support

213

214

</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>

215

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

216

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

217

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

218

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

219

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

220

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

221

-<!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.

222

+<!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.

223

Iterators

224

225

</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.

226

Standard Contents

227

</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.

228

Iterators

229

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

230

-</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>

231

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

232

+</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>

233

The following

234

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

235

iterators are not implemented as pointers. They are a generalization

236

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

237

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

238

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

239

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

240

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

241

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

242

-<!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>

243

+<!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>

244

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

245

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

246

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

247

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

248

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

249

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

250

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

251

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

252

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

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>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.

254

+<!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.

255

Numerics

256

257

</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>

258

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

259

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

260

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

261

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

262

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

263

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

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>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.

265

+<!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.

266

Extensions

267

268

-</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>

269

+</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>

270

</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>

271

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

272

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

273

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

274

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

275

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

276

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

277

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

278

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

279

-<!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.

280

+<!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.

281

Containers

282

283

</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>

284

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

285

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

286

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

287

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

288

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

289

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

290

-<!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>

291

+<!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>

292

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

293

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

294

toplevel gcc configuration option

295

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

296

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

297

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

298

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

299

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

300

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

301

-<!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.

302

+<!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.

303

Introduction

304

305

-</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>

306

+</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>

307

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

308

</p><p>

309

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

310

particular release.

311

-</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">

312

+</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">

313

314

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

315

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

316

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

317

</p><p>

318

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

319

particular release.

320

-</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">

321

+</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">

322

323

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

324

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

325

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

326

is_trivially_copy_constructible, is_trivially_move_constructible,

327

is_trivially_assignable, is_trivially_default_assignable,

328

is_trivially_copy_assignable, is_trivially_move_assignable

329

- </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">

330

+ </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">

331

332

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

333

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

334

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

335

</p><p>

336

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

337

release.

338

-</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">

339

+</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">

340

<p>

341

Uses code from

342

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

343

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

344

</p><p>

345

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

346

particular release.

347

-</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">

348

+</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">

349

350

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

351

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

352

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

353

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

354

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

355

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

356

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

357

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

358

-<!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

359

+<!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

360

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

361

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

362

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

363

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

364

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

365

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

366

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

367

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

368

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

369

-<!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>

370

+<!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>

371

</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>

372

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

373

containers and iterators with semantically equivalent safe standard

374

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

375

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

376

standard library implementations, although none of them directly

377

supports debugging for programs using libstdc++. The existing

378

- 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>:

379

+ 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>:

380

SafeSTL was the original debugging version of the Standard Template

381

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

382

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

383

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

384

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

385

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

386

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

387

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

388

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

389

-<!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>

390

+<!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>

391

Associative containers are typically parametrized by various

392

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

393

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

394

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

395

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

396

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

397

arranged so that equivalent-key values are consecutive.

398

- </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>

399

+ </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>

400

Put differently, the standards' non-unique mapping

401

associative-containers are associative containers that map

402

primary keys to linked lists that are embedded into the

403

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

404

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

405

box represents some size-type or secondary

406

associative-container.

407

- </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>

408

+ </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>

409

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

410

container mapping each user to an associative container which

411

maps each application id to a start time (see

412

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

413

shows invariants for order-preserving containers: point-type

414

iterators are synonymous with range-type iterators.

415

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

416

- 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

417

+ 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

418

(hash-based associative containers) lack movement

419

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

420

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

421

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

422

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

423

iterators are valid. The graphic below shows tags corresponding to

424

different types of invalidation guarantees.

425

- </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>

426

+ </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>

427

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

428

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

429

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

430

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

431

</p><p>

432

This library contains a container tag hierarchy corresponding to the

433

diagram below.

434

- </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>

435

+ </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>

436

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

437

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

438

Cntnr::container_category</code>.

439

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

440

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

441

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

442

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

443

- 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

444

+ 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

445

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

446

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

447

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

448

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

449

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

450

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

451

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

452

- 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">

453

+ 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">

454

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

455

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

456

h, f can always be composed (however the converse

457

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

458

transforming the sequence of hash values into a sequence of

459

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

460

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

461

- 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">

462

+ 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">

463

g(r, m) = r mod m

464

</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

465

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

466

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

467

implement using the low

468

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

469

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

470

- 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">

471

+ 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">

472

g(r, m) = r % m

473

- </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">

474

+ </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">

475

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

476

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

477

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

478

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

479

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

480

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

481

domain S. Consider the following ranged-hash

482

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

483

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

484

A Standard String Hash Function

485

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

486

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

487

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

488

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

489

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

490

prohibitively expensive. A possible alternative might be to use

491

- 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.

492

+ 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.

493

Only k String DNA Hash

494

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

495

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

496

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

497

the container transforms the key into a non-negative integral

498

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

499

result into a position using the combining functor (points D

500

- 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

501

+ 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

502

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

503

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

504

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

505

transforms the key into a position using the combining functor

506

- (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>

507

+ (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>

508

Probing tables

509

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

510

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

511

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

512

a linear probe and a quadratic probe function,

513

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

514

The graphic below shows the relationships.

515

- </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

516

+ </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

517

shrink. It is necessary to specify policies to determine how

518

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

519

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

520

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

521

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

522

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

523

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

524

- 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

525

+ 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

526

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

527

length of the probe sequence of bin i by

528

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

529

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

530

Probability of Probe Sequence of Length k

531

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

532

p<sub>1</sub> =

533

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

534

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

535

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

536

. Let

537

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

538

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

539

Probability Probe Sequence in Some Bin

540

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

541

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

542

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

543

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

544

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

545

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

546

- 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

547

+ 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

548

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

549

the library contains a single class for instantiating a resize

550

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

551

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

552

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>)

553

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

554

illustrating the interaction between the standard resize policy

555

- 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

556

- 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

557

+ 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

558

+ 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

559

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

560

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>

561

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

562

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

563

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

564

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

565

second stores at each node the maximal endpoint of the

566

- 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

567

+ 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

568

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

569

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

570

invariants. The graphic below shows how a right rotation,

571

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

572

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

573

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

574

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

575

- 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:

576

+ 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:

577

node iterators, and template-template node updater

578

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

579

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

580

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

581

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

582

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

583

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

584

- 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

585

+ 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

586

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

587

the type of metadata it requires. For order statistics,

588

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

589

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

590

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

591

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

592

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

593

- 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,

594

+ 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,

595

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

596

restore the invariant. For example, the graphic below shows

597

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

598

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

599

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

600

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

601

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>)

602

- .</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

603

+ .</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

604

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

605

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

606

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

607

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

608

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

609

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

610

to traverse the useless path shown to the root, applying

611

- 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>

612

+ 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>

613

solves both these problems. The tree detects that node

614

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.

615

It is possible to split a tree so that it passes

616

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

617

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

618

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

619

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

620

- <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

621

+ <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

622

tree-based containers. There are two minor

623

differences, though, which, unfortunately, thwart sharing them

624

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

625

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

626

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

627

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

628

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

629

- 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

630

+ 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

631

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

632

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

633

supports order statistics.

634

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

635

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

636

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

637

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

638

- 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

639

+ 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

640

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

641

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

642

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

643

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

644

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

645

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

646

D.

647

- </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

648

+ </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

649

implementing any algorithm moving nodes to the front of the

650

list (policies implementing algorithms interchanging nodes are

651

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

652

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

653

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

654

typically less structured than an associative container's tree;

655

the third simply uses an associative container. These are

656

- 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

657

+ 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

658

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

659

amortized sense). Any priority queue implementation that would

660

avoid this, would violate known bounds on comparison-based

661

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

662

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

663

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

664

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

665

- </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

666

+ </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

667

container type for its attributes. Given any container

668

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

669

is a traits class identifying the properties of the

670

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

671

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

672

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

673

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

674

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

675

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

676

-<!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.

677

+<!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.

678

Introduction

679

680

-</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>

681

+</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>

682

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

683

by

684

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

685

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

686

enumerated and detailed in the table below.

687

</p><p>

688

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.

689

- </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>,

690

+ </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>,

691

<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>

692

\ No newline at end of file

693

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

694

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

695

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

696

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

697

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

698

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

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>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>

700

+<!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>

701

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

702

call context and dynamic instance. Without accurate traces, diagnostics

703

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

704

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

705

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

706

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

707

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

708

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

709

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

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 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.

711

+<!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.

712

Extensions

713

714

-</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

715

+</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

716

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

717

allocators are dealt with elsewhere. The remaining ones all deal

718

with bits:

719

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

720

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

721

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

722

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

723

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

724

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

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>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:

726

+<!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:

727

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

728

#include <ext/concurrence.h>

729

730

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

731

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

732

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

733

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

734

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

735

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

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>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.

737

+<!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.

738

Extensions

739

740

-</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>

741

+</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>

742

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

743

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

744

</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

745

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

746

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

747

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

748

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

749

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

750

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

751

-<!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.

752

+<!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.

753

Support

754

755

</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>

756

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

757

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

758

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

759

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

760

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

761

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

762

-<!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>

763

+<!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>

764

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

765

</p><p>

766

Furthermore, all pre-processor macros, switches, and

767

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

768

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

769

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

770

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

771

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

772

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

773

-<!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.

774

+<!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.

775

Concurrency

776

777

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

778

Standard Contents

779

</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.

780

Concurrency

781

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

782

-</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>

783

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

784

+</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>

785

Facilities for concurrent operation, and control thereof.

786

</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>

787

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

788

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

789

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

790

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

791

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

792

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

793

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

794

-<!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.

795

+<!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.

796

Extensions

797

798

</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>

799

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

800

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

801

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

802

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

803

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

804

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

805

-<!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.

806

+<!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.

807

Extensions

808

809

-</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">

810

+</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">

811

Configuring via Template Parameters

812

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

813

Querying Container Attributes

814

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

815

these invariants, one must supply some policy that is aware

816

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

817

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

818

- </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>

819

+ </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>

820

The standard C++ library contains associative containers based on

821

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

822

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

823

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

824

</p><p>

825

The figure below shows the different underlying data structures

826

currently supported in this library.

827

- </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>

828

+ </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>

829

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

830

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

831

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

832

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

833

no guarantee that the elements traversed will coincide with the

834

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

835

label B.

836

- </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>

837

+ </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>

838

In our opinion, this problem is not caused just because

839

red-black trees are order preserving while

840

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

841

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

842

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

843

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

844

complicated.

845

- </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>

846

+ </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>

847

It should be noted that containers based on collision-chaining

848

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

849

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

850

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

851

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

852

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

853

show a collision-chaining hash table.

854

- </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>

855

+ </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>

856

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

857

be de-referenced and incremented. The sequence of iterators

858

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

859

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

860

typically less structured than an associative container's tree;

861

the third simply uses an associative container. These are

862

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

863

- </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>

864

+ </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>

865

No single implementation can completely replace any of the

866

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

867

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

868

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

869

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

870

Proceedings of International Conference on Very Large Data Bases

871

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

872

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

873

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

874

Deamortization - Part 2: Binomial Heaps

875

</a>

876

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

877

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

878

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

879

Addison-Wesley Publishing Company

880

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

881

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

882

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

883

</a>

884

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

885

January 1996

886

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

887

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

888

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

889

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

890

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

891

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

892

-<!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.

893

+<!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.

894

Extensions

895

896

</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

897

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

898

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

899

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

900

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

901

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

902

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

903

-<!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>

904

+<!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>

905

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

906

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

907

the bitmapped allocator instantiated for any type. This maintains a

908

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

909

</p><p>

910

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

911

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

912

- </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>

913

+ </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>

914

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

915

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

916

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

917

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

918

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

919

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

920

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

921

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

922

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

923

-<!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.

924

+<!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.

925

Contributing

926

927

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

928

Appendices

929

</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>

930

Contributing

931

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

932

-</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>

933

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

934

+</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>

935

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

936

contributors are assigned maintainer-ship responsibility, and given

937

write access to the source repository. First time contributors

938

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

939

for this group is quite useful.

940

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

941

Peruse

942

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

943

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

944

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

945

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

946

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

947

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

948

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

949

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

950

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

951

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

952

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

953

-<!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>

954

+<!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>

955

Both the normal conformance and regression tests and the

956

supplemental performance tests work.

957

</p><p>

958

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

959

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

960

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

961

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

962

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

963

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

964

-<!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.

965

+<!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.

966

Extensions

967

968

-</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>

969

+</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>

970

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

971

recognition of suboptimal usage patterns of the standard library.

972

</p><p>

973

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

974

call context.

975

(Environment variable not supported.)

976

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

977

- </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">

978

+ </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">

979

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

980

</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">

981

Proceedings of the 2009 International Symposium on Code Generation

982

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

983

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

984

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

985

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

986

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

987

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

988

-<!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.

989

+<!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.

990

Input and Output

991

992

</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>

993

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

994

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

995

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

996

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

997

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

998

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

999

-<!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.

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>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.

1001

Utilities

1002

1003

</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>

1004

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

1005

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

1006

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

1007

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

1008

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

1009

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

1010

-<!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>

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>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>

1012

Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research

1013

Laboratories), and Benjamin Kosnik (Red Hat).

1014

</p><p>

1015

- This library was partially written at

1016

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

1017

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

1018

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

1019

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

1020

Patterns Applied by Andrei Alexandrescu.

1021

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

1022

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

1023

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

1024

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

1025

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

1026

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

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>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.

1028

+<!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.

1029

Containers

1030

1031

</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>

1032

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

1033

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

1034

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

1035

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

1036

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

1037

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

1038

-<!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.

1039

+<!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.

1040

Extensions

1041

1042

-</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>

1043

+</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>

1044

contains all the higher-level

1045

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

1046

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

1047

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

1048

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

1049

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

1050

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

1051

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

1052

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

1053

-<!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.

1054

+<!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.

1055

Support

1056

1057

</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.

1058

Standard Contents

1059

</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.

1060

Support

1061

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

1062

-</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>

1063

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

1064

+</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>

1065

This part deals with the functions called and objects created

1066

automatically during the course of a program's existence.

1067

</p><p>

1068

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

1069

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

1070

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

1071

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

1072

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

1073

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

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 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.

1075

+<!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.

1076

Extensions

1077

1078

-</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>

1079

+</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>

1080

</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>

1081

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

1082

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

1083

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

1084

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

1085

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

1086

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

1087

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

1088

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

1089

-<!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>

1090

+<!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>

1091

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

1092

and one for the documentation.

1093

</p><p>

1094

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

1095

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

1096

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

1097

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

1098

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

1099

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

1100

-<!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.

1101

+<!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.

1102

Numerics

1103

1104

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

1105

Standard Contents

1106

</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.

1107

Numerics

1108

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

1109

-</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>

1110

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

1111

+</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>

1112

</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>

1113

</p><p>Using <code class="code">complex<></code> becomes even more comple- er, sorry,

1114

<span class="emphasis"><em>complicated</em></span>, with the not-quite-gratuitously-incompatible

1115

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

1116

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

1117

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

1118

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

1119

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

1120

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

1121

-<!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>

1122

+<!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>

1123

The C++ language provides language support for stack unwinding

1124

with <code class="literal">try</code> and <code class="literal">catch</code> blocks and

1125

the <code class="literal">throw</code> keyword.

1126

@@ -265,7 +265,7 @@

1127

}

1128

catch(...)

1129

{ this->_M_setstate(ios_base::badbit); }

1130

-</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>

1131

+</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>

1132

1133

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

1134

</a>

1135

@@ -274,39 +274,39 @@

1136

1137

The Open Group/The Institute of Electrical and Electronics

1138

Engineers, Inc.

1139

- . </span></p></div><div class="biblioentry"><a id="idp13647696"></a><p><span class="title"><em>

1140

+ . </span></p></div><div class="biblioentry"><a id="idm270001885328"></a><p><span class="title"><em>

1141

1142

Error and Exception Handling

1143

</a>

1144

</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams </span>. </span><span class="publisher"><span class="publishername">

1145

Boost

1146

- . </span></span></p></div><div class="biblioentry"><a id="idp13651392"></a><p><span class="title"><em>

1147

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001881632"></a><p><span class="title"><em>

1148

1149

Exception-Safety in Generic Components

1150

</a>

1151

</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams</span>. </span><span class="publisher"><span class="publishername">

1152

Boost

1153

- . </span></span></p></div><div class="biblioentry"><a id="idp13655104"></a><p><span class="title"><em>

1154

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001877920"></a><p><span class="title"><em>

1155

1156

Standard Library Exception Policy

1157

</a>

1158

</em>. </span><span class="author"><span class="firstname">Matt</span> <span class="surname">Austern</span>. </span><span class="publisher"><span class="publishername">

1159

WG21 N1077

1160

- . </span></span></p></div><div class="biblioentry"><a id="idp13658816"></a><p><span class="title"><em>

1161

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001874208"></a><p><span class="title"><em>

1162

1163

ia64 c++ abi exception handling

1164

</a>

1165

</em>. </span><span class="author"><span class="firstname">Richard</span> <span class="surname">Henderson</span>. </span><span class="publisher"><span class="publishername">

1166

GNU

1167

- . </span></span></p></div><div class="biblioentry"><a id="idp13662512"></a><p><span class="title"><em>

1168

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001870512"></a><p><span class="title"><em>

1169

1170

Appendix E: Standard-Library Exception Safety

1171

</a>

1172

- </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">

1173

+ </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">

1174

Exceptional C++

1175

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

1176

Exception-Safety Issues and Techniques

1177

- . </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>

1178

+ . </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>

1179

1180

GCC Bug 25191: exception_defines.h #defines try/catch

1181

</a>

1182

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

1183

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

1184

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

1185

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

1186

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

1187

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

1188

-<!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.

1189

+<!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.

1190

For a given container type in this library, the test creates

1191

an object of the container type and an object of the

1192

corresponding standard type (e.g., <code class="classname">std::set</code>). It

1193

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

1194

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

1195

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

1196

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

1197

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

1198

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

1199

-<!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>

1200

+<!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>

1201

</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>

1202

All parallel algorithms are intended to have signatures that are

1203

equivalent to the ISO C++ algorithms replaced. For instance, the

1204

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

1205

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

1206

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

1207

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

1208

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

1209

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

1210

-<!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.

1211

+<!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.

1212

Porting and Maintenance

1213

1214

</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>

1215

@@ -493,39 +493,39 @@

1216

1217

C++ ABI Summary

1218

</a>

1219

- </em>. </span></p></div><div class="biblioentry"><a id="idp22945936"></a><p><span class="title"><em>

1220

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992586624"></a><p><span class="title"><em>

1221

1222

Intel Compilers for Linux Compatibility with the GNU Compilers

1223

</a>

1224

- </em>. </span></p></div><div class="biblioentry"><a id="idp22947792"></a><p><span class="title"><em>

1225

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992584768"></a><p><span class="title"><em>

1226

1227

Linker and Libraries Guide (document 819-0690)

1228

</a>

1229

- </em>. </span></p></div><div class="biblioentry"><a id="idp22949632"></a><p><span class="title"><em>

1230

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992582928"></a><p><span class="title"><em>

1231

1232

Sun Studio 11: C++ Migration Guide (document 819-3689)

1233

</a>

1234

- </em>. </span></p></div><div class="biblioentry"><a id="idp22951488"></a><p><span class="title"><em>

1235

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992581072"></a><p><span class="title"><em>

1236

1237

How to Write Shared Libraries

1238

</a>

1239

- </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>

1240

+ </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>

1241

1242

C++ ABI for the ARM Architecture

1243

</a>

1244

- </em>. </span></p></div><div class="biblioentry"><a id="idp22956736"></a><p><span class="title"><em>

1245

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992575824"></a><p><span class="title"><em>

1246

1247

Dynamic Shared Objects: Survey and Issues

1248

</a>

1249

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

1250

ISO C++ J16/06-0046

1251

- . </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>

1252

+ . </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>

1253

1254

Versioning With Namespaces

1255

</a>

1256

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

1257

ISO C++ J16/06-0083

1258

- . </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>

1259

+ . </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>

1260

1261

Binary Compatibility of Shared Libraries Implemented in C++

1262

on GNU/Linux Systems

1263

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

1264

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

1265

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

1266

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

1267

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

1268

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

1269

-<!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.

1270

+<!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.

1271

Introduction

1272

1273

</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.

1274

Introduction

1275

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

1276

-</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>

1277

\ No newline at end of file

1278

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

1279

+</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>

1280

\ No newline at end of file

1281

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

1282

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

1283

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

1284

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

1285

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

1286

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

1287

-<!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>

1288

+<!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>

1289

Many large projects use their own data structures instead of the ones in the

1290

standard library. If these data structures are similar in functionality

1291

to the standard library, they can be instrumented with the same hooks

1292

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

1293

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

1294

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

1295

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

1296

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

1297

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

1298

-<!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.

1299

+<!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.

1300

Atomics

1301

1302

</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.

1303

Standard Contents

1304

</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.

1305

Atomics

1306

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

1307

-</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>

1308

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

1309

+</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>

1310

Facilities for atomic operations.

1311

</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>

1312

All items are declared in the standard header

1313

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

1314

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

1315

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

1316

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

1317

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

1318

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

1319

-<!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.

1320

+<!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.

1321

Porting and Maintenance

1322

1323

</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>

1324

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

1325

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

1326

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

1327

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

1328

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

1329

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

1330

-<!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

1331

+<!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

1332

other libraries except the standard C++ library . All classes are

1333

defined in namespace <code class="code">__gnu_pbds</code>. The library internally

1334

uses macros beginning with <code class="code">PB_DS</code>, but

1335

@@ -61,7 +61,7 @@

1336

In addition, there are the following diagnostics classes,

1337

used to report errors specific to this library's data

1338

structures.

1339

- </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>

1340

+ </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>

1341

For the most part, the policy-based containers containers in

1342

namespace <code class="literal">__gnu_pbds</code> have the same interface as

1343

the equivalent containers in the standard C++ library, except for

1344

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

1345

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

1346

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

1347

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

1348

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

1349

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

1350

-<!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>

1351

+<!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>

1352

Information on known bugs, details on efforts to fix them, and

1353

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>,

1354

with the category set to <code class="literal">libstdc++</code>.

1355

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

1356

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

1357

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

1358

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

1359

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

1360

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

1361

-<!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>

1362

+<!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>

1363

Any use of parallel functionality requires additional compiler

1364

and runtime support, in particular support for OpenMP. Adding this support is

1365

not difficult: just compile your application with the compiler

1366

@@ -62,4 +62,4 @@

1367

flags for atomic operations.)

1368

</p><p> The following table provides the names and headers of all the

1369

parallel algorithms that can be used in a similar manner:

1370

-</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>

1371

\ No newline at end of file

1372

+</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>

1373

\ No newline at end of file

1374

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

1375

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

1376

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

1377

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

1378

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

1379

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

1380

-<!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.

1381

+<!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.

1382

Extensions

1383

1384

</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>,

1385

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

1386

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

1387

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

1388

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

1389

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

1390

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

1391

-<!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,

1392

+<!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,

1393

i.e. user-defined functors must not throw exceptions.

1394

Also, the order of execution is not guaranteed for some functions, of course.

1395

Therefore, user-defined functors should not have any concurrent side effects.

1396

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

1397

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

1398

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

1399

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

1400

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

1401

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

1402

-<!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.

1403

+<!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.

1404

Standard Contents

1405

</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.

1406

Standard Contents

1407

- </h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="chapter"><a href="support.html">4.

1408

+ </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.

1409

Support

1410

1411

</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.

1412

@@ -12,13 +12,13 @@

1413

</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.

1414

Utilities

1415

1416

-</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.

1417

+</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.

1418

Strings

1419

1420

</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.

1421

Localization

1422

1423

-</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.

1424

+</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.

1425

Containers

1426

1427

</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.

1428

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

1429

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

1430

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

1431

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

1432

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

1433

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

1434

-<!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.

1435

+<!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.

1436

Appendices

1437

</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.

1438

Appendices

1439

-</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.

1440

+</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.

1441

Contributing

1442

1443

</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.

1444

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

1445

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

1446

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

1447

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

1448

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

1449

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

1450

-<!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.

1451

+<!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.

1452

Utilities

1453

1454

</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>

1455

@@ -92,7 +92,7 @@

1456

or loading and unloading shared objects in memory. As such, using

1457

caching allocators on systems that do not support

1458

<code class="function">abi::__cxa_atexit</code> is not recommended.

1459

- </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>

1460

+ </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>

1461

The only allocator interface that

1462

is supported is the standard C++ interface. As such, all STL

1463

containers have been adjusted, and all external allocators have

1464

@@ -105,7 +105,7 @@

1465

</p><p>

1466

The base class that <code class="classname">allocator</code> is derived from

1467

may not be user-configurable.

1468

-</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>

1469

+</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>

1470

It's difficult to pick an allocation strategy that will provide

1471

maximum utility, without excessively penalizing some behavior. In

1472

fact, it's difficult just deciding which typical actions to measure

1473

@@ -142,7 +142,7 @@

1474

The current default choice for

1475

<code class="classname">allocator</code> is

1476

<code class="classname">__gnu_cxx::new_allocator</code>.

1477

- </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>

1478

+ </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>

1479

In use, <code class="classname">allocator</code> may allocate and

1480

deallocate using implementation-specific strategies and

1481

heuristics. Because of this, a given call to an allocator object's

1482

@@ -309,33 +309,33 @@

1483

of the used and unused memory locations. It has its own

1484

<a class="link" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator">chapter</a>

1485

in the documentation.

1486

- </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">

1487

+ </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">

1488

ISO/IEC 14882:1998 Programming languages - C++

1489

</em>. </span>

1490

isoc++_1998

1491

- <span class="pagenums">20.4 Memory. </span></p></div><div class="biblioentry"><a id="idp13994688"></a><p><span class="title"><em>

1492

- <a class="link" href="http://www.drdobbs.com/cpp/184403759" target="_top">

1493

+ <span class="pagenums">20.4 Memory. </span></p></div><div class="biblioentry"><a id="idm270000082384"></a><p><span class="title"><em>

1494

+ <a class="link" href="http://www.drdobbs.com/the-standard-librarian-what-are-allocato/184403759" target="_top">

1495

The Standard Librarian: What Are Allocators Good For?

1496

</a>

1497

</em>. </span><span class="author"><span class="firstname">Matt</span> <span class="surname">Austern</span>. </span><span class="publisher"><span class="publishername">

1498

C/C++ Users Journal

1499

- . </span></span></p></div><div class="biblioentry"><a id="idp13998416"></a><p><span class="title"><em>

1500

+ . </span></span></p></div><div class="biblioentry"><a id="idm270000078608"></a><p><span class="title"><em>

1501

1502

The Hoard Memory Allocator

1503

</a>

1504

- </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>

1505

+ </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>

1506

1507

Reconsidering Custom Memory Allocation

1508

</a>

1509

- </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>

1510

+ </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>

1511

1512

Allocator Types

1513

</a>

1514

</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">

1515

C/C++ Users Journal

1516

- . </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">

1517

+ . </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">

1518

Addison Wesley

1519

- . </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

1520

+ . </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

1521

happen with misuse of the <code class="classname">auto_ptr</code> class

1522

template (called <acronym class="acronym">AP</acronym> here) would take some

1523

time. Suffice it to say that the use of <acronym class="acronym">AP</acronym>

1524

@@ -445,7 +445,7 @@

1525

Derived classes override those functions to destroy resources in a context

1526

where the correct dynamic type is known. This is an application of the

1527

technique known as type erasure.

1528

- </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>

1529

+ </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>

1530

A <code class="classname">shared_ptr<T></code> contains a pointer of

1531

type <span class="type">T*</span> and an object of type

1532

<code class="classname">__shared_count</code>. The shared_count contains a

1533

@@ -492,9 +492,9 @@

1534

aliasing constructor, make_shared & allocate_shared. Additionally,

1535

the constructors taking <code class="classname">auto_ptr</code> parameters are

1536

deprecated in C++11 mode.

1537

- </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15534784"></a>Thread Safety</h5></div></div></div><p>

1538

+ </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999996832"></a>Thread Safety</h5></div></div></div><p>

1539

The

1540

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

1541

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

1542

Safety</a> section of the Boost shared_ptr documentation says "shared_ptr

1543

objects offer the same level of thread safety as built-in types."

1544

The implementation must ensure that concurrent updates to separate shared_ptr

1545

@@ -537,7 +537,7 @@

1546

shared_ptr in libstdc++ the compiler and library are fixed, which

1547

makes things much simpler: we have an atomic CAS or we don't, see Lock

1548

Policy below for details.

1549

-</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>

1550

+</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>

1551

</p><p>

1552

There is a single <code class="classname">_Sp_counted_base</code> class,

1553

which is a template parameterized on the enum

1554

@@ -578,7 +578,7 @@

1555

<code class="filename">ext/atomicity.h</code>, which detect if the program

1556

is multi-threaded. If only one thread of execution exists in

1557

the program then less expensive non-atomic operations are used.

1558

- </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>,

1559

+ </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>,

1560

<code class="code">const_pointer_cast</code></span></dt><dd><p>

1561

As noted in N2351, these functions can be implemented non-intrusively using

1562

the alias constructor. However the aliasing constructor is only available

1563

@@ -611,13 +611,13 @@

1564

As well as the extra constructors, this implementation also needs some

1565

members of _Sp_counted_deleter to be protected where they could otherwise

1566

be private.

1567

- </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>

1568

+ </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>

1569

Examples of use can be found in the testsuite, under

1570

<code class="filename">testsuite/tr1/2_general_utilities/shared_ptr</code>,

1571

<code class="filename">testsuite/20_util/shared_ptr</code>

1572

and

1573

<code class="filename">testsuite/20_util/weak_ptr</code>.

1574

- </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15576640"></a>Unresolved Issues</h5></div></div></div><p>

1575

+ </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999954912"></a>Unresolved Issues</h5></div></div></div><p>

1576

The <span class="emphasis"><em><code class="classname">shared_ptr</code> atomic access</em></span>

1577

clause in the C++11 standard is not implemented in GCC.

1578

</p><p>

1579

@@ -658,25 +658,25 @@

1580

code to work with, Peter Dimov in particular for his help and

1581

invaluable advice on thread safety. Phillip Jordan and Paolo

1582

Carlini for the lock policy implementation.

1583

- </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>

1584

+ </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>

1585

1586

Improving shared_ptr for C++0x, Revision 2

1587

</a>

1588

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

1589

N2351

1590

- . </span></p></div><div class="biblioentry"><a id="idp15590224"></a><p><span class="title"><em>

1591

+ . </span></p></div><div class="biblioentry"><a id="idm269999941392"></a><p><span class="title"><em>

1592

1593

C++ Standard Library Active Issues List

1594

</a>

1595

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

1596

N2456

1597

- . </span></p></div><div class="biblioentry"><a id="idp15592512"></a><p><span class="title"><em>

1598

+ . </span></p></div><div class="biblioentry"><a id="idm269999939104"></a><p><span class="title"><em>

1599

1600

Working Draft, Standard for Programming Language C++

1601

</a>

1602

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

1603

N2461

1604

- . </span></p></div><div class="biblioentry"><a id="idp15594816"></a><p><span class="title"><em>

1605

+ . </span></p></div><div class="biblioentry"><a id="idm269999936800"></a><p><span class="title"><em>

1606

1607

Boost C++ Libraries documentation, shared_ptr

1608

</a>

1609

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

1610

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

1611

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

1612

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

1613

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

1614

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

1615

-<!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.

1616

+<!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.

1617

Porting and Maintenance

1618

1619

</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>

1620

@@ -77,11 +77,11 @@

1621

<span class="type">__alloc</span> to select an underlying allocator that

1622

satisfied memory allocation requests. The selection of this

1623

underlying allocator was not user-configurable.

1624

- </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

1625

+ </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

1626

of available allocators. All of these new allocators are

1627

standard-style. The following table includes details, along with

1628

the first released version of GCC that included the extension allocator.

1629

- </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>

1630

+ </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>

1631

Debug mode first appears.

1632

</p><p>

1633

Precompiled header support <acronym class="acronym">PCH</acronym> support.

1634

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

1635

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

1636

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

1637

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

1638

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

1639

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

1640

-<!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.

1641

+<!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.

1642

Contributing

1643

1644

</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>

1645

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

1646

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

1647

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

1648

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

1649

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

1650

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

1651

-<!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.

1652

+<!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.

1653

Input and Output

1654

1655

</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>

1656

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

1657

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

1658

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

1659

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

1660

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

1661

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

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>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.

1663

+<!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.

1664

Extensions

1665

1666

</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>

1667

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

1668

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

1669

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

1670

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

1671

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

1672

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

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></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.

1674

+<!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.

1675

Extensions

1676

1677

-</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>

1678

+</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>

1679

Here we will make an attempt at describing the non-Standard

1680

extensions to the library. Some of these are from older versions of

1681

standard library components, namely SGI's STL, and some of these are

1682

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

1683

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

1684

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

1685

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

1686

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

1687

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

1688

-<!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.

1689

+<!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.

1690

Diagnostics

1691

1692

</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>

1693

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

1694

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

1695

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

1696

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

1697

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

1698

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

1699

-<!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>

1700

+<!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>

1701

In the ST example we never used the thread_id variable present in each block.

1702

Let's start by explaining the purpose of this in a MT application.

1703

</p><p>

1704

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

1705

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

1706

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

1707

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

1708

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

1709

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

1710

-<!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.

1711

+<!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.

1712

Extensions

1713

1714

</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>

1715

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

1716

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

1717

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

1718

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

1719

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

1720

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

1721

-<!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.

1722

+<!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.

1723

Strings

1724

1725

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

1726

Standard Contents

1727

</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.

1728

Strings

1729

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

1730

-</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>

1731

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

1732

+</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>

1733

Here are Standard, simple, and portable ways to perform common

1734

transformations on a <code class="code">string</code> instance, such as

1735

"convert to all upper case." The word transformations

1736

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

1737

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

1738

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

1739

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

1740

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

1741

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

1742

-<!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.

1743

+<!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.

1744

Containers

1745

1746

</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>

1747

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

1748

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

1749

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

1750

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

1751

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

1752

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

1753

-<!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>

1754

+<!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>

1755

The table below presents all the diagnostics we intend to implement.

1756

Each diagnostic has a corresponding compile time switch

1757

<code class="code">-D_GLIBCXX_PROFILE_<diagnostic></code>.

1758

@@ -17,7 +17,7 @@

1759

A high accuracy means that the diagnostic is unlikely to be wrong.

1760

These grades are not perfect. They are just meant to guide users with

1761

specific needs or time budgets.

1762

- </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">

1763

+ </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">

1764

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">

1765

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">

1766

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">

1767

@@ -374,7 +374,7 @@

1768

Quick Sort for a particular call context.

1769

</p></li><li class="listitem"><p><span class="emphasis"><em>Fundamentals:</em></span>

1770

See papers:

1771

- <a class="link" href="http://portal.acm.org/citation.cfm?doid=1065944.1065981" target="_top">

1772

+ <a class="link" href="https://dl.acm.org/citation.cfm?doid=1065944.1065981" target="_top">

1773

A framework for adaptive algorithm selection in STAPL</a> and

1774

1775

Optimizing Sorting with Machine Learning Algorithms</a>.

1776

@@ -500,7 +500,7 @@

1777

Keep a shadow for each container. Record iterator dereferences and

1778

container member accesses. Issue advice for elements referenced by

1779

multiple threads.

1780

- See paper: <a class="link" href="http://portal.acm.org/citation.cfm?id=207110.207148" target="_top">

1781

+ See paper: <a class="link" href="https://dl.acm.org/citation.cfm?id=207110.207148" target="_top">

1782

The LRPD test: speculative run-time parallelization of loops with

1783

privatization and reduction parallelization</a>.

1784

</p></li><li class="listitem"><p><span class="emphasis"><em>Cost model:</em></span>

1785

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

1786

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

1787

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

1788

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

1789

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

1790

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

1791

-<!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

1792

+<!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

1793

implemented via compiler intrinsics (if the underlying host is

1794

capable) or by library fallbacks.</p><p>Compiler intrinsics (builtins) are always preferred. However, as

1795

the compiler builtins for atomics are not universally implemented,

1796

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

1797

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

1798

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

1799

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

1800

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

1801

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

1802

-<!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.

1803

+<!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.

1804

Input and Output

1805

1806

</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>

1807

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

1808

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

1809

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

1810

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

1811

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

1812

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

1813

-<!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.

1814

+<!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.

1815

Porting and Maintenance

1816

1817

</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>

1818

@@ -112,7 +112,7 @@

1819

supported, and are always aliased to dummy rules. These

1820

unsupported formats are: <span class="emphasis"><em>info</em></span>,

1821

<span class="emphasis"><em>ps</em></span>, and <span class="emphasis"><em>dvi</em></span>.

1822

- </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>

1823

+ </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>

1824

Prerequisite tools are Bash 2.0 or later,

1825

<a class="link" href="http://www.doxygen.org/" target="_top">Doxygen</a>, and

1826

the <a class="link" href="http://www.gnu.org/software/coreutils/" target="_top">GNU

1827

@@ -232,9 +232,8 @@

1828

member functions.

1829

</p><p>

1830

Some commentary to accompany

1831

- the first list in the <a class="link" href="http://www.stack.nl/~dimitri/doxygen/docblocks.html" target="_top">Special

1832

- Documentation Blocks</a> section of

1833

- the Doxygen manual:

1834

+ the first list in the <a class="link" href="http://www.stack.nl/~dimitri/doxygen/manual/docblocks.html" target="_top">Special

1835

+ Documentation Blocks</a> section of the Doxygen manual:

1836

</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>

1837

...not the Qt style. The intermediate *'s are preferred.

1838

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

1839

@@ -310,7 +309,7 @@

1840

writing Doxygen comments. Single and double quotes, and

1841

separators in filenames are two common trouble spots. When in

1842

doubt, consult the following table.

1843

- </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>

1844

+ </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>

1845

Editing the DocBook sources requires an XML editor. Many

1846

exist: some notable options

1847

include <span class="command"><strong>emacs</strong></span>, <span class="application">Kate</span>,

1848

@@ -520,11 +519,11 @@

1849

<a class="link" href="http://www.docbook.org/tdg/en/html/part2.html" target="_top">online</a>.

1850

An incomplete reference for HTML to Docbook conversion is

1851

detailed in the table below.

1852

- </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>,

1853

+ </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>,

1854

1855

And examples of detailed markup for which there are no real HTML

1856

equivalents are listed in the table below.

1857

-</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">

1858

+</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">

1859

<p><function>clear()</function></p>

1860

<p><function>fs.clear()</function></p>

1861

</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">

1862

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

1863

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

1864

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

1865

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

1866

@@ -1,11 +1,11 @@

1867

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

1868

-<!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.

1869

+<!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.

1870

Extensions

1871

1872

</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.

1873

Extensions

1874

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

1875

-</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

1876

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

1877

+</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

1878

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">

1879

Configuring via Template Parameters

1880

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

1881

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

1882

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

1883

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

1884

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

1885

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

1886

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

1887

-<!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>

1888

+<!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>

1889

</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

1890

compiler flag <code class="code">-D_GLIBCXX_DEBUG</code>. Note that this flag

1891

changes the sizes and behavior of standard class templates such

1892

@@ -18,6 +18,6 @@

1893

mode or with debug mode. The

1894

following table provides the names and headers of the debugging

1895

containers:

1896

-</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

1897

+</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

1898

containers have additional debug capability.

1899

-</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>

1900

\ No newline at end of file

1901

+</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>

1902

\ No newline at end of file

1903

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

1904

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

1905

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

1906

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

1907

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

1908

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

1909

-<!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.

1910

+<!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.

1911

Extensions

1912

1913

-</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

1914

+</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

1915

implementation of many algorithms the C++ Standard Library.

1916

</p><p>

1917

Several of the standard algorithms, for instance

1918

@@ -12,11 +12,11 @@

1919

specific compiler flag.

1920

</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

1921

<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

1922

-<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">

1923

+<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">

1924

Parallelization of Bulk Operations for STL Dictionaries

1925

</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">

1926

Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)

1927

- . </span></span></p></div><div class="biblioentry"><a id="idp16931936"></a><p><span class="citetitle"><em class="citetitle">

1928

+ . </span></span></p></div><div class="biblioentry"><a id="idm269998599392"></a><p><span class="citetitle"><em class="citetitle">

1929

The Multi-Core Standard Template Library

1930

</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">

1931

Euro-Par 2007: Parallel Processing. (LNCS 4641)

1932

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

1933

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

1934

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

1935

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

1936

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

1937

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

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>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>

1939

+<!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>

1940

</p><p>A program that uses the C++ standard library correctly

1941

will maintain the same semantics under debug mode as it had with

1942

the normal (release) library. All functional and exception-handling

1943

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

1944

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

1945

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

1946

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

1947

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

1948

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

1949

-<!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.

1950

+<!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.

1951

Introduction

1952

1953

-</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

1954

+</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

1955

and properly built binaries useful for linking to other software is

1956

a multi-step process. Steps include getting the sources,

1957

configuring and building the sources, testing, and installation.

1958

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

1959

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

1960

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

1961

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

1962

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

1963

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

1964

-<!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.

1965

+<!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.

1966

Porting and Maintenance

1967

1968

</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

1969

@@ -940,15 +940,15 @@

1970

This is a change in behavior from older versions. Now, most

1971

<span class="type">iterator_type</span> typedefs in container classes are POD

1972

objects, not <span class="type">value_type</span> pointers.

1973

-</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>

1974

+</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>

1975

1976

Migrating to GCC 4.1

1977

</a>

1978

- </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>

1979

+ </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>

1980

1981

Building the Whole Debian Archive with GCC 4.1: A Summary

1982

</a>

1983

- </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>

1984

+ </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>

1985

1986

Migration guide for GCC-3.2

1987

</a>

1988

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

1989

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

1990

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

1991

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

1992

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

1993

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

1994

-<!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.

1995

+<!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.

1996

Contributing

1997

1998

</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>

1999

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

2000

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

2001

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

2002

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

2003

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

2004

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2005

-<!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>

2006

+<!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>

2007

The SGI hashing classes <code class="classname">hash_set</code> and

2008

<code class="classname">hash_set</code> have been deprecated by the

2009

unordered_set, unordered_multiset, unordered_map,

2010

Index: libstdc++-v3/doc/html/manual/facets.html

2011

===================================================================

2012

--- a/src/libstdc++-v3/doc/html/manual/facets.html (.../tags/gcc_4_8_2_release)

2013

+++ b/src/libstdc++-v3/doc/html/manual/facets.html (.../branches/gcc-4_8-branch)

2014

@@ -1,8 +1,8 @@

2015

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2016

-<!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.

2017

+<!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.

2018

Localization

2019

2020

-</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>

2021

+</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>

2022

For the required specialization codecvt<wchar_t, char, mbstate_t> ,

2023

conversions are made between the internal character set (always UCS4

2024

on GNU/Linux) and whatever the currently selected locale for the

2025

@@ -49,24 +49,24 @@

2026

</p></li><li class="listitem"><p>

2027

Rename abstract base class. See if just smash-overriding is a

2028

better approach. Clarify, add sanity to naming.

2029

- </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">

2030

+ </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">

2031

The GNU C Library

2032

- </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">

2033

+ </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">

2034

Correspondence

2035

- </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">

2036

+ </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">

2037

ISO/IEC 14882:1998 Programming languages - C++

2038

2039

2040

ISO/IEC 9899:1999 Programming languages - C

2041

2042

2043

2044

The Open Group Base Specifications, Issue 6 (IEEE Std. 1003.1-2004)

2045

</a>

2046

2047

- 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">

2048

+ 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">

2049

The C++ Programming Language, Special Edition

2050

</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">

2051

Addison Wesley

2052

- . </span></span></p></div><div class="biblioentry"><a id="idp15813664"></a><p><span class="citetitle"><em class="citetitle">

2053

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999717760"></a><p><span class="citetitle"><em class="citetitle">

2054

Standard C++ IOStreams and Locales

2055

</em>. </span><span class="subtitle">

2056

Advanced Programmer's Guide and Reference

2057

@@ -409,42 +409,42 @@

2058

</p></li><li class="listitem"><p>

2059

wchar_t/char internal buffers and conversions between

2060

internal/external buffers?

2061

- </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">

2062

+ </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">

2063

The GNU C Library

2064

</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">

2065

Chapters 6 Character Set Handling and 7 Locales and Internationalization

2066

- . </span></p></div><div class="biblioentry"><a id="idp15895888"></a><p><span class="citetitle"><em class="citetitle">

2067

+ . </span></p></div><div class="biblioentry"><a id="idm269999635328"></a><p><span class="citetitle"><em class="citetitle">

2068

Correspondence

2069

- </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">

2070

+ </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">

2071

ISO/IEC 14882:1998 Programming languages - C++

2072

2073

2074

ISO/IEC 9899:1999 Programming languages - C

2075

2076

2077

2078

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

2079

</a>

2080

2081

The Open Group/The Institute of Electrical and Electronics

2082

Engineers, Inc.

2083

- . </span></p></div><div class="biblioentry"><a id="idp15906768"></a><p><span class="citetitle"><em class="citetitle">

2084

+ . </span></p></div><div class="biblioentry"><a id="idm269999624448"></a><p><span class="citetitle"><em class="citetitle">

2085

The C++ Programming Language, Special Edition

2086

</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">

2087

Addison Wesley

2088

- . </span></span></p></div><div class="biblioentry"><a id="idp15911392"></a><p><span class="citetitle"><em class="citetitle">

2089

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999619824"></a><p><span class="citetitle"><em class="citetitle">

2090

Standard C++ IOStreams and Locales

2091

</em>. </span><span class="subtitle">

2092

Advanced Programmer's Guide and Reference

2093

. </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">

2094

Addison Wesley Longman

2095

- . </span></span></p></div><div class="biblioentry"><a id="idp15917056"></a><p><span class="title"><em>

2096

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999614160"></a><p><span class="title"><em>

2097

2098

A brief description of Normative Addendum 1

2099

</a>

2100

- </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>

2101

+ </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>

2102

2103

The Unicode HOWTO

2104

</a>

2105

- </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>

2106

+ </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>

2107

2108

UTF-8 and Unicode FAQ for Unix/Linux

2109

</a>

2110

@@ -690,39 +690,39 @@

2111

model. As of this writing, it is unknown how to query to see

2112

if a specified message catalog exists using the gettext

2113

package.

2114

- </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">

2115

+ </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">

2116

The GNU C Library

2117

</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

2118

- . </span></p></div><div class="biblioentry"><a id="idp16008384"></a><p><span class="citetitle"><em class="citetitle">

2119

+ . </span></p></div><div class="biblioentry"><a id="idm269999522832"></a><p><span class="citetitle"><em class="citetitle">

2120

Correspondence

2121

- </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">

2122

+ </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">

2123

ISO/IEC 14882:1998 Programming languages - C++

2124

2125

2126

ISO/IEC 9899:1999 Programming languages - C

2127

2128

2129

2130

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

2131

</a>

2132

2133

The Open Group/The Institute of Electrical and Electronics

2134

Engineers, Inc.

2135

- . </span></p></div><div class="biblioentry"><a id="idp16019264"></a><p><span class="citetitle"><em class="citetitle">

2136

+ . </span></p></div><div class="biblioentry"><a id="idm269999511952"></a><p><span class="citetitle"><em class="citetitle">

2137

The C++ Programming Language, Special Edition

2138

</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">

2139

Addison Wesley

2140

- . </span></span></p></div><div class="biblioentry"><a id="idp16023888"></a><p><span class="citetitle"><em class="citetitle">

2141

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999507328"></a><p><span class="citetitle"><em class="citetitle">

2142

Standard C++ IOStreams and Locales

2143

</em>. </span><span class="subtitle">

2144

Advanced Programmer's Guide and Reference

2145

. </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">

2146

Addison Wesley Longman

2147

- . </span></span></p></div><div class="biblioentry"><a id="idp16029552"></a><p><span class="title"><em>

2148

- <a class="link" href="http://java.sun.com/reference/api/index.html" target="_top">

2149

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999501664"></a><p><span class="title"><em>

2150

+ <a class="link" href="http://www.oracle.com/technetwork/java/api/index.html" target="_top">

2151

API Specifications, Java Platform

2152

</a>

2153

</em>. </span><span class="pagenums">java.util.Properties, java.text.MessageFormat,

2154

java.util.Locale, java.util.ResourceBundle

2155

- . </span></p></div><div class="biblioentry"><a id="idp16031888"></a><p><span class="title"><em>

2156

+ . </span></p></div><div class="biblioentry"><a id="idm269999499328"></a><p><span class="title"><em>

2157

2158

GNU gettext tools, version 0.10.38, Native Language Support

2159

Library and Tools.

2160

Index: libstdc++-v3/doc/html/manual/diagnostics.html

2161

===================================================================

2162

--- a/src/libstdc++-v3/doc/html/manual/diagnostics.html (.../tags/gcc_4_8_2_release)

2163

+++ b/src/libstdc++-v3/doc/html/manual/diagnostics.html (.../branches/gcc-4_8-branch)

2164

@@ -1,13 +1,13 @@

2165

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2166

-<!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.

2167

+<!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.

2168

Diagnostics

2169

2170

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="termination.html">Prev</a> </td><th width="60%" align="center">Part II.

2171

Standard Contents

2172

</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.

2173

Diagnostics

2174

- <a id="idp13835248" class="indexterm"></a>

2175

-</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>

2176

+ <a id="idm270001697504" class="indexterm"></a>

2177

+</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>

2178

All exception objects are defined in one of the standard header

2179

files: <code class="filename">exception</code>,

2180

<code class="filename">stdexcept</code>, <code class="filename">new</code>, and

2181

Index: libstdc++-v3/doc/html/manual/mt_allocator_design.html

2182

===================================================================

2183

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator_design.html (.../tags/gcc_4_8_2_release)

2184

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator_design.html (.../branches/gcc-4_8-branch)

2185

@@ -1,5 +1,5 @@

2186

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2187

-<!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

2188

+<!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

2189

describing the characteristics of the memory pool, a policy class

2190

containing this pool that links instantiation types to common or

2191

individual pools, and a class inheriting from the policy class that is

2192

Index: libstdc++-v3/doc/html/manual/appendix_free.html

2193

===================================================================

2194

--- a/src/libstdc++-v3/doc/html/manual/appendix_free.html (.../tags/gcc_4_8_2_release)

2195

+++ b/src/libstdc++-v3/doc/html/manual/appendix_free.html (.../branches/gcc-4_8-branch)

2196

@@ -1,12 +1,12 @@

2197

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2198

-<!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.

2199

+<!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.

2200

Free Software Needs Free Documentation

2201

2202

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="backwards.html">Prev</a> </td><th width="60%" align="center">Part IV.

2203

Appendices

2204

</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>

2205

Free Software Needs Free Documentation

2206

- <a id="idp23426192" class="indexterm"></a>

2207

+ <a id="idm269992106560" class="indexterm"></a>

2208

</h1></div></div></div><p>

2209

The biggest deficiency in free operating systems is not in the

2210

software--it is the lack of good free manuals that we can include in

2211

Index: libstdc++-v3/doc/html/manual/algorithms.html

2212

===================================================================

2213

--- a/src/libstdc++-v3/doc/html/manual/algorithms.html (.../tags/gcc_4_8_2_release)

2214

+++ b/src/libstdc++-v3/doc/html/manual/algorithms.html (.../branches/gcc-4_8-branch)

2215

@@ -1,13 +1,13 @@

2216

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2217

-<!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.

2218

+<!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.

2219

Algorithms

2220

2221

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="iterators.html">Prev</a> </td><th width="60%" align="center">Part II.

2222

Standard Contents

2223

</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.

2224

Algorithms

2225

- <a id="idp16191968" class="indexterm"></a>

2226

-</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>

2227

+ <a id="idm269999339120" class="indexterm"></a>

2228

+</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>

2229

The neatest accomplishment of the algorithms section is that all the

2230

work is done via iterators, not containers directly. This means two

2231

important things:

2232

Index: libstdc++-v3/doc/html/manual/appendix_porting.html

2233

===================================================================

2234

--- a/src/libstdc++-v3/doc/html/manual/appendix_porting.html (.../tags/gcc_4_8_2_release)

2235

+++ b/src/libstdc++-v3/doc/html/manual/appendix_porting.html (.../branches/gcc-4_8-branch)

2236

@@ -1,13 +1,13 @@

2237

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2238

-<!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.

2239

+<!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.

2240

Porting and Maintenance

2241

2242

</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.

2243

Appendices

2244

</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>

2245

Porting and Maintenance

2246

- <a id="idp22008864" class="indexterm"></a>

2247

-</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">

2248

+ <a id="idm269993523968" class="indexterm"></a>

2249

+</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">

2250

Qualifying Exception Safety Guarantees

2251

2252

</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">

2253

@@ -61,7 +61,7 @@

2254

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

2255

<span class="command"><strong>automake</strong></span>) from the file

2256

<code class="filename">Makefile.am</code>.

2257

-</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>

2258

+</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>

2259

Regenerate all generated files by using the command

2260

<code class="code">autoreconf</code> at the top level of the libstdc++ source

2261

directory.

2262

Index: libstdc++-v3/doc/html/manual/profile_mode_cost_model.html

2263

===================================================================

2264

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html (.../tags/gcc_4_8_2_release)

2265

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html (.../branches/gcc-4_8-branch)

2266

@@ -1,5 +1,5 @@

2267

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2268

-<!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>

2269

+<!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>

2270

Currently, the cost model uses formulas with predefined relative weights

2271

for alternative containers or container implementations. For instance,

2272

iterating through a vector is X times faster than iterating through a list.

2273

Index: libstdc++-v3/doc/html/manual/make.html

2274

===================================================================

2275

--- a/src/libstdc++-v3/doc/html/manual/make.html (.../tags/gcc_4_8_2_release)

2276

+++ b/src/libstdc++-v3/doc/html/manual/make.html (.../branches/gcc-4_8-branch)

2277

@@ -1,5 +1,5 @@

2278

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2279

-<!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

2280

+<!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

2281

<a class="link" href="http://gcc.gnu.org/install/" target="_top">GCC Installation

2282

Instructions</a> first. Read <span class="emphasis"><em>all of them</em></span>.

2283

<span class="emphasis"><em>Twice.</em></span>

2284

Index: libstdc++-v3/doc/html/manual/pairs.html

2285

===================================================================

2286

--- a/src/libstdc++-v3/doc/html/manual/pairs.html (.../tags/gcc_4_8_2_release)

2287

+++ b/src/libstdc++-v3/doc/html/manual/pairs.html (.../branches/gcc-4_8-branch)

2288

@@ -1,5 +1,5 @@

2289

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2290

-<!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.

2291

+<!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.

2292

Utilities

2293

2294

</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

2295

Index: libstdc++-v3/doc/html/manual/test.html

2296

===================================================================

2297

--- a/src/libstdc++-v3/doc/html/manual/test.html (.../tags/gcc_4_8_2_release)

2298

+++ b/src/libstdc++-v3/doc/html/manual/test.html (.../branches/gcc-4_8-branch)

2299

@@ -1,5 +1,5 @@

2300

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2301

-<!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.

2302

+<!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.

2303

Porting and Maintenance

2304

2305

</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>

2306

@@ -492,7 +492,7 @@

2307

reporting functions including:

2308

</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>

2309

Qualifying Exception Safety Guarantees

2310

- <a id="idp22628992" class="indexterm"></a>

2311

+ <a id="idm269992903504" class="indexterm"></a>

2312

</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>

2313

Testing is composed of running a particular test sequence,

2314

and looking at what happens to the surrounding code when

2315

Index: libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html

2316

===================================================================

2317

--- a/src/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html (.../tags/gcc_4_8_2_release)

2318

+++ b/src/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html (.../branches/gcc-4_8-branch)

2319

@@ -1,5 +1,5 @@

2320

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2321

-<!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>

2322

+<!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>

2323

Or as close as it gets: freestanding. This is a minimal

2324

configuration, with only partial support for the standard

2325

library. Assume only the following header files can be used:

2326

Index: libstdc++-v3/doc/html/manual/using_headers.html

2327

===================================================================

2328

--- a/src/libstdc++-v3/doc/html/manual/using_headers.html (.../tags/gcc_4_8_2_release)

2329

+++ b/src/libstdc++-v3/doc/html/manual/using_headers.html (.../branches/gcc-4_8-branch)

2330

@@ -1,5 +1,5 @@

2331

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2332

-<!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>

2333

+<!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>

2334

The C++ standard specifies the entire set of header files that

2335

must be available to all hosted implementations. Actually, the

2336

word "files" is a misnomer, since the contents of the

2337

@@ -18,19 +18,19 @@

2338

the 1998 standard as updated for 2003, and the current 2011 standard.

2339

</p><p>

2340

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>.

2341

- </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>

2342

+ </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>

2343

C++11 include files. These are only available in C++11 compilation

2344

mode, i.e. <code class="literal">-std=c++11</code> or <code class="literal">-std=gnu++11</code>.

2345

-</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>

2346

+</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>

2347

In addition, TR1 includes as:

2348

-</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++

2349

+</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++

2350

compiler supports scalar decimal floating-point types defined via

2351

<code class="code">__attribute__((mode(SD|DD|LD)))</code>.

2352

-</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>

2353

+</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>

2354

Also included are files for the C++ ABI interface:

2355

-</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>

2356

+</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>

2357

And a large variety of extensions.

2358

-</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.

2359

+</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.

2360

</p><p>First, mixing different dialects of the standard headers is not

2361

possible. It's an all-or-nothing affair. Thus, code like

2362

</p><pre class="programlisting">

2363

Index: libstdc++-v3/doc/html/manual/using_namespaces.html

2364

===================================================================

2365

--- a/src/libstdc++-v3/doc/html/manual/using_namespaces.html (.../tags/gcc_4_8_2_release)

2366

+++ b/src/libstdc++-v3/doc/html/manual/using_namespaces.html (.../branches/gcc-4_8-branch)

2367

@@ -1,5 +1,5 @@

2368

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2369

-<!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.

2370

+<!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.

2371

</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

2372

within namespace std." This includes namespaces nested

2373

within <code class="code">namespace std</code>, such as <code class="code">namespace

2374

Index: libstdc++-v3/doc/html/manual/debug.html

2375

===================================================================

2376

--- a/src/libstdc++-v3/doc/html/manual/debug.html (.../tags/gcc_4_8_2_release)

2377

+++ b/src/libstdc++-v3/doc/html/manual/debug.html (.../branches/gcc-4_8-branch)

2378

@@ -1,5 +1,5 @@

2379

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2380

-<!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>

2381

+<!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>

2382

There are numerous things that can be done to improve the ease with

2383

which C++ binaries are debugged when using the GNU tool chain. Here

2384

are some of them.

2385

@@ -161,7 +161,7 @@

2386

DRD</a>,

2387

2388

Helgrind</a>, and

2389

- <a class="link" href="http://code.google.com/p/data-race-test" target="_top">

2390

+ <a class="link" href="http://code.google.com/p/data-race-test/" target="_top">

2391

ThreadSanitizer</a>.

2392

</p><p>

2393

With DRD, Helgrind and ThreadSanitizer you will need to define

2394

Index: libstdc++-v3/doc/html/manual/localization.html

2395

===================================================================

2396

--- a/src/libstdc++-v3/doc/html/manual/localization.html (.../tags/gcc_4_8_2_release)

2397

+++ b/src/libstdc++-v3/doc/html/manual/localization.html (.../branches/gcc-4_8-branch)

2398

@@ -1,13 +1,13 @@

2399

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2400

-<!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.

2401

+<!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.

2402

Localization

2403

2404

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="strings.html">Prev</a> </td><th width="60%" align="center">Part II.

2405

Standard Contents

2406

</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.

2407

Localization

2408

- <a id="idp15701088" class="indexterm"></a>

2409

-</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>

2410

+ <a id="idm269999830208" class="indexterm"></a>

2411

+</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>

2412

Describes the basic locale object, including nested

2413

classes id, facet, and the reference-counted implementation object,

2414

class _Impl.

2415

@@ -402,29 +402,29 @@

2416

What should non-required facet instantiations do? If the

2417

generic implementation is provided, then how to end-users

2418

provide specializations?

2419

- </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">

2420

+ </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">

2421

The GNU C Library

2422

</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">

2423

Chapters 6 Character Set Handling and 7 Locales and

2424

Internationalization

2425

- . </span></p></div><div class="biblioentry"><a id="idp15748832"></a><p><span class="citetitle"><em class="citetitle">

2426

+ . </span></p></div><div class="biblioentry"><a id="idm269999782464"></a><p><span class="citetitle"><em class="citetitle">

2427

Correspondence

2428

- </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">

2429

+ </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">

2430

ISO/IEC 14882:1998 Programming languages - C++

2431

2432

2433

ISO/IEC 9899:1999 Programming languages - C

2434

2435

2436

2437

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

2438

</a>

2439

2440

The Open Group/The Institute of Electrical and Electronics

2441

Engineers, Inc.

2442

- . </span></p></div><div class="biblioentry"><a id="idp15759712"></a><p><span class="citetitle"><em class="citetitle">

2443

+ . </span></p></div><div class="biblioentry"><a id="idm269999771584"></a><p><span class="citetitle"><em class="citetitle">

2444

The C++ Programming Language, Special Edition

2445

</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">

2446

Addison Wesley

2447

- . </span></span></p></div><div class="biblioentry"><a id="idp15764336"></a><p><span class="citetitle"><em class="citetitle">

2448

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999766960"></a><p><span class="citetitle"><em class="citetitle">

2449

Standard C++ IOStreams and Locales

2450

</em>. </span><span class="subtitle">

2451

Advanced Programmer's Guide and Reference

2452

Index: libstdc++-v3/doc/html/manual/ext_algorithms.html

2453

===================================================================

2454

--- a/src/libstdc++-v3/doc/html/manual/ext_algorithms.html (.../tags/gcc_4_8_2_release)

2455

+++ b/src/libstdc++-v3/doc/html/manual/ext_algorithms.html (.../branches/gcc-4_8-branch)

2456

@@ -1,5 +1,5 @@

2457

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2458

-<!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.

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>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.

2460

Extensions

2461

2462

</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

2463

Index: libstdc++-v3/doc/html/manual/debug_mode.html

2464

===================================================================

2465

--- a/src/libstdc++-v3/doc/html/manual/debug_mode.html (.../tags/gcc_4_8_2_release)

2466

+++ b/src/libstdc++-v3/doc/html/manual/debug_mode.html (.../branches/gcc-4_8-branch)

2467

@@ -1,8 +1,8 @@

2468

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2469

-<!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.

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>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.

2471

Extensions

2472

2473

-</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

2474

+</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

2475

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>

2476

By default, libstdc++ is built with efficiency in mind, and

2477

therefore performs little or no error checking that is not

2478

Index: libstdc++-v3/doc/html/manual/profile_mode_design.html

2479

===================================================================

2480

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_design.html (.../tags/gcc_4_8_2_release)

2481

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_design.html (.../branches/gcc-4_8-branch)

2482

@@ -1,6 +1,6 @@

2483

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2484

-<!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>

2485

-</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

2486

+<!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>

2487

+</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

2488

only included from <code class="code">impl/profiler.h</code>, which is the only

2489

file included from the public headers.</td></tr></tbody></table></div></div><br class="table-break" /><p>

2490

</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>

2491

Index: libstdc++-v3/doc/html/manual/using_concurrency.html

2492

===================================================================

2493

--- a/src/libstdc++-v3/doc/html/manual/using_concurrency.html (.../tags/gcc_4_8_2_release)

2494

+++ b/src/libstdc++-v3/doc/html/manual/using_concurrency.html (.../branches/gcc-4_8-branch)

2495

@@ -1,5 +1,5 @@

2496

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2497

-<!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

2498

+<!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

2499

of multithreaded applications which use the Standard C++

2500

library. This information is GCC-specific since the C++

2501

standard does not address matters of multithreaded applications.

2502

Index: libstdc++-v3/doc/html/manual/mt_allocator_impl.html

2503

===================================================================

2504

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator_impl.html (.../tags/gcc_4_8_2_release)

2505

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator_impl.html (.../branches/gcc-4_8-branch)

2506

@@ -1,5 +1,5 @@

2507

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2508

-<!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

2509

+<!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

2510

exists a nested <code class="code">struct __pool_base::_Tune</code> that contains all

2511

these parameters, which include settings for

2512

</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

2513

Index: libstdc++-v3/doc/html/manual/appendix_gfdl.html

2514

===================================================================

2515

--- a/src/libstdc++-v3/doc/html/manual/appendix_gfdl.html (.../tags/gcc_4_8_2_release)

2516

+++ b/src/libstdc++-v3/doc/html/manual/appendix_gfdl.html (.../branches/gcc-4_8-branch)

2517

@@ -1,5 +1,5 @@

2518

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2519

-<!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.

2520

+<!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.

2521

Appendices

2522

</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>

2523

2524

Index: libstdc++-v3/doc/html/manual/containers.html

2525

===================================================================

2526

--- a/src/libstdc++-v3/doc/html/manual/containers.html (.../tags/gcc_4_8_2_release)

2527

+++ b/src/libstdc++-v3/doc/html/manual/containers.html (.../branches/gcc-4_8-branch)

2528

@@ -1,13 +1,13 @@

2529

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2530

-<!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.

2531

+<!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.

2532

Containers

2533

2534

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="facets.html">Prev</a> </td><th width="60%" align="center">Part II.

2535

Standard Contents

2536

</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.

2537

Containers

2538

- <a id="idp16037808" class="indexterm"></a>

2539

-</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>

2540

+ <a id="idm269999493408" class="indexterm"></a>

2541

+</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>

2542

Yes it is, and that's okay. This is a decision that we preserved

2543

when we imported SGI's STL implementation. The following is

2544

quoted from <a class="link" href="http://www.sgi.com/tech/stl/FAQ.html" target="_top">their FAQ</a>:

2545

Index: libstdc++-v3/doc/html/manual/io.html

2546

===================================================================

2547

--- a/src/libstdc++-v3/doc/html/manual/io.html (.../tags/gcc_4_8_2_release)

2548

+++ b/src/libstdc++-v3/doc/html/manual/io.html (.../branches/gcc-4_8-branch)

2549

@@ -1,13 +1,13 @@

2550

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2551

-<!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.

2552

+<!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.

2553

Input and Output

2554

2555

</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.

2556

Standard Contents

2557

</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.

2558

Input and Output

2559

- <a id="idp16257600" class="indexterm"></a>

2560

-</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

2561

+ <a id="idm269999273616" class="indexterm"></a>

2562

+</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

2563

only include the headers you really need. Many people simply include

2564

<iostream> when they don't need to -- and that can <span class="emphasis"><em>penalize

2565

your runtime as well.</em></span> Here are some tips on which header to use

2566

Index: libstdc++-v3/doc/html/manual/index.html

2567

===================================================================

2568

--- a/src/libstdc++-v3/doc/html/manual/index.html (.../tags/gcc_4_8_2_release)

2569

+++ b/src/libstdc++-v3/doc/html/manual/index.html (.../branches/gcc-4_8-branch)

2570

@@ -1,7 +1,7 @@

2571

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2572

-<!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

2573

+<!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

2574

2575

- </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.

2576

+ </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.

2577

Introduction

2578

2579

</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.

2580

@@ -15,13 +15,13 @@

2581

</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.

2582

Utilities

2583

2584

-</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.

2585

+</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.

2586

Strings

2587

2588

</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.

2589

Localization

2590

2591

-</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.

2592

+</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.

2593

Containers

2594

2595

</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.

2596

@@ -143,19 +143,19 @@

2597

2598

</a></span></dt><dt><span class="appendix"><a href="appendix_gpl.html">D.

2599

<acronym class="acronym">GNU</acronym> General Public License version 3

2600

- </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">

2601

+ </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">

2602

Effect of embedded lists in

2603

<code class="classname">std::multimap</code>

2604

- </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

2605

- 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

2606

- diagram</a></dt><dt>22.21. <a href="policy_data_structures_design.html#idp18277664">Standard resize policy size sequence

2607

- 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">

2608

+ </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

2609

+ 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

2610

+ diagram</a></dt><dt>22.21. <a href="policy_data_structures_design.html#idm269997253712">Standard resize policy size sequence

2611

+ 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">

2612

A Standard String Hash Function

2613

- </a></dt><dt>22.6. <a href="policy_data_structures_design.html#idp18169344">

2614

+ </a></dt><dt>22.6. <a href="policy_data_structures_design.html#idm269997361840">

2615

Only k String DNA Hash

2616

- </a></dt><dt>22.7. <a href="policy_data_structures_design.html#idp18240448">

2617

+ </a></dt><dt>22.7. <a href="policy_data_structures_design.html#idm269997290864">

2618

Probability of Probe Sequence of Length k

2619

- </a></dt><dt>22.8. <a href="policy_data_structures_design.html#idp18247216">

2620

+ </a></dt><dt>22.8. <a href="policy_data_structures_design.html#idm269997284096">

2621

Probability Probe Sequence in Some Bin

2622

</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.

2623

Introduction

2624

Index: libstdc++-v3/doc/html/manual/numerics_and_c.html

2625

===================================================================

2626

--- a/src/libstdc++-v3/doc/html/manual/numerics_and_c.html (.../tags/gcc_4_8_2_release)

2627

+++ b/src/libstdc++-v3/doc/html/manual/numerics_and_c.html (.../branches/gcc-4_8-branch)

2628

@@ -1,5 +1,5 @@

2629

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2630

-<!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.

2631

+<!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.

2632

Numerics

2633

2634

</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

2635

Index: libstdc++-v3/doc/html/manual/appendix_gpl.html

2636

===================================================================

2637

--- a/src/libstdc++-v3/doc/html/manual/appendix_gpl.html (.../tags/gcc_4_8_2_release)

2638

+++ b/src/libstdc++-v3/doc/html/manual/appendix_gpl.html (.../branches/gcc-4_8-branch)

2639

@@ -1,5 +1,5 @@

2640

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2641

-<!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.

2642

+<!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.

2643

<acronym class="acronym">GNU</acronym> General Public License version 3

2644

</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.

2645

Appendices

2646

@@ -77,7 +77,7 @@

2647

</p><p>

2648

The precise terms and conditions for copying, distribution and modification

2649

follow.

2650

- </p><h2><a id="idp23466384"></a>

2651

+ </p><h2><a id="idm269992066368"></a>

2652

TERMS AND CONDITIONS

2653

</h2><h2><a id="gpl-3-definitions"></a>

2654

0. Definitions.

2655

@@ -618,7 +618,7 @@

2656

waiver of all civil liability in connection with the Program, unless a

2657

warranty or assumption of liability accompanies a copy of the Program in

2658

return for a fee.

2659

- </p><h2><a id="idp23565184"></a>

2660

+ </p><h2><a id="idm269991967568"></a>

2661

END OF TERMS AND CONDITIONS

2662

</h2><h2><a id="HowToApply"></a>

2663

How to Apply These Terms to Your New Programs

2664

Index: libstdc++-v3/doc/html/manual/source_code_style.html

2665

===================================================================

2666

--- a/src/libstdc++-v3/doc/html/manual/source_code_style.html (.../tags/gcc_4_8_2_release)

2667

+++ b/src/libstdc++-v3/doc/html/manual/source_code_style.html (.../branches/gcc-4_8-branch)

2668

@@ -1,5 +1,5 @@

2669

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2670

-<!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.

2671

+<!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.

2672

Contributing

2673

2674

</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>

2675

Index: libstdc++-v3/doc/html/manual/streambufs.html

2676

===================================================================

2677

--- a/src/libstdc++-v3/doc/html/manual/streambufs.html (.../tags/gcc_4_8_2_release)

2678

+++ b/src/libstdc++-v3/doc/html/manual/streambufs.html (.../branches/gcc-4_8-branch)

2679

@@ -1,5 +1,5 @@

2680

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2681

-<!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.

2682

+<!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.

2683

Input and Output

2684

2685

</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>

2686

Index: libstdc++-v3/doc/html/manual/utilities.html

2687

===================================================================

2688

--- a/src/libstdc++-v3/doc/html/manual/utilities.html (.../tags/gcc_4_8_2_release)

2689

+++ b/src/libstdc++-v3/doc/html/manual/utilities.html (.../branches/gcc-4_8-branch)

2690

@@ -1,13 +1,13 @@

2691

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2692

-<!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.

2693

+<!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.

2694

Utilities

2695

2696

</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.

2697

Standard Contents

2698

</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.

2699

Utilities

2700

- <a id="idp13862416" class="indexterm"></a>

2701

-</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

2702

+ <a id="idm270001670464" class="indexterm"></a>

2703

+</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

2704

get slightly the wrong idea. In the interest of not reinventing

2705

the wheel, we will refer you to the introduction to the functor

2706

concept written by SGI as part of their STL, in

2707

Index: libstdc++-v3/include/debug/functions.h

2708

===================================================================

2709

--- a/src/libstdc++-v3/include/debug/functions.h (.../tags/gcc_4_8_2_release)

2710

+++ b/src/libstdc++-v3/include/debug/functions.h (.../branches/gcc-4_8-branch)

2711

@@ -345,11 +345,13 @@

2712

return __check_sorted_set_aux(__first, __last, __pred, _SameType());

2713

}

2714

2715

+ // _GLIBCXX_RESOLVE_LIB_DEFECTS

2716

+ // 270. Binary search requirements overly strict

2717

+ // Determine if a sequence is partitioned w.r.t. this element.

2718

template<typename _ForwardIterator, typename _Tp>

2719

inline bool

2720

- __check_partitioned_lower_aux(_ForwardIterator __first,

2721

- _ForwardIterator __last, const _Tp& __value,

2722

- std::forward_iterator_tag)

2723

+ __check_partitioned_lower(_ForwardIterator __first,

2724

+ _ForwardIterator __last, const _Tp& __value)

2725

{

2726

while (__first != __last && *__first < __value)

2727

++__first;

2728

@@ -362,38 +364,11 @@

2729

return __first == __last;

2730

}

2731

2732

- // For performance reason, as the iterator range has been validated, check on

2733

- // random access safe iterators is done using the base iterator.

2734

- template<typename _Iterator, typename _Sequence, typename _Tp>

2735

- inline bool

2736

- __check_partitioned_lower_aux(

2737

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2738

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2739

- const _Tp& __value,

2740

- std::random_access_iterator_tag __tag)

2741

- {

2742

- return __check_partitioned_lower_aux(__first.base(), __last.base(),

2743

- __value, __tag);

2744

- }

2745

-

2746

- // _GLIBCXX_RESOLVE_LIB_DEFECTS

2747

- // 270. Binary search requirements overly strict

2748

- // Determine if a sequence is partitioned w.r.t. this element.

2749

template<typename _ForwardIterator, typename _Tp>

2750

inline bool

2751

- __check_partitioned_lower(_ForwardIterator __first,

2752

+ __check_partitioned_upper(_ForwardIterator __first,

2753

_ForwardIterator __last, const _Tp& __value)

2754

{

2755

- return __check_partitioned_lower_aux(__first, __last, __value,

2756

- std::__iterator_category(__first));

2757

- }

2758

-

2759

- template<typename _ForwardIterator, typename _Tp>

2760

- inline bool

2761

- __check_partitioned_upper_aux(_ForwardIterator __first,

2762

- _ForwardIterator __last, const _Tp& __value,

2763

- std::forward_iterator_tag)

2764

- {

2765

while (__first != __last && !(__value < *__first))

2766

++__first;

2767

if (__first != __last)

2768

@@ -405,35 +380,12 @@

2769

return __first == __last;

2770

}

2771

2772

- // For performance reason, as the iterator range has been validated, check on

2773

- // random access safe iterators is done using the base iterator.

2774

- template<typename _Iterator, typename _Sequence, typename _Tp>

2775

- inline bool

2776

- __check_partitioned_upper_aux(

2777

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2778

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2779

- const _Tp& __value,

2780

- std::random_access_iterator_tag __tag)

2781

- {

2782

- return __check_partitioned_upper_aux(__first.base(), __last.base(),

2783

- __value, __tag);

2784

- }

2785

-

2786

- template<typename _ForwardIterator, typename _Tp>

2787

- inline bool

2788

- __check_partitioned_upper(_ForwardIterator __first,

2789

- _ForwardIterator __last, const _Tp& __value)

2790

- {

2791

- return __check_partitioned_upper_aux(__first, __last, __value,

2792

- std::__iterator_category(__first));

2793

- }

2794

-

2795

+ // Determine if a sequence is partitioned w.r.t. this element.

2796

template<typename _ForwardIterator, typename _Tp, typename _Pred>

2797

inline bool

2798

- __check_partitioned_lower_aux(_ForwardIterator __first,

2799

- _ForwardIterator __last, const _Tp& __value,

2800

- _Pred __pred,

2801

- std::forward_iterator_tag)

2802

+ __check_partitioned_lower(_ForwardIterator __first,

2803

+ _ForwardIterator __last, const _Tp& __value,

2804

+ _Pred __pred)

2805

{

2806

while (__first != __last && bool(__pred(*__first, __value)))

2807

++__first;

2808

@@ -446,39 +398,12 @@

2809

return __first == __last;

2810

}

2811

2812

- // For performance reason, as the iterator range has been validated, check on

2813

- // random access safe iterators is done using the base iterator.

2814

- template<typename _Iterator, typename _Sequence,

2815

- typename _Tp, typename _Pred>

2816

- inline bool

2817

- __check_partitioned_lower_aux(

2818

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2819

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2820

- const _Tp& __value, _Pred __pred,

2821

- std::random_access_iterator_tag __tag)

2822

- {

2823

- return __check_partitioned_lower_aux(__first.base(), __last.base(),

2824

- __value, __pred, __tag);

2825

- }

2826

-

2827

- // Determine if a sequence is partitioned w.r.t. this element.

2828

template<typename _ForwardIterator, typename _Tp, typename _Pred>

2829

inline bool

2830

- __check_partitioned_lower(_ForwardIterator __first,

2831

+ __check_partitioned_upper(_ForwardIterator __first,

2832

_ForwardIterator __last, const _Tp& __value,

2833

_Pred __pred)

2834

{

2835

- return __check_partitioned_lower_aux(__first, __last, __value, __pred,

2836

- std::__iterator_category(__first));

2837

- }

2838

-

2839

- template<typename _ForwardIterator, typename _Tp, typename _Pred>

2840

- inline bool

2841

- __check_partitioned_upper_aux(_ForwardIterator __first,

2842

- _ForwardIterator __last, const _Tp& __value,

2843

- _Pred __pred,

2844

- std::forward_iterator_tag)

2845

- {

2846

while (__first != __last && !bool(__pred(__value, *__first)))

2847

++__first;

2848

if (__first != __last)

2849

@@ -490,31 +415,6 @@

2850

return __first == __last;

2851

}

2852

2853

- // For performance reason, as the iterator range has been validated, check on

2854

- // random access safe iterators is done using the base iterator.

2855

- template<typename _Iterator, typename _Sequence,

2856

- typename _Tp, typename _Pred>

2857

- inline bool

2858

- __check_partitioned_upper_aux(

2859

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2860

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2861

- const _Tp& __value, _Pred __pred,

2862

- std::random_access_iterator_tag __tag)

2863

- {

2864

- return __check_partitioned_upper_aux(__first.base(), __last.base(),

2865

- __value, __pred, __tag);

2866

- }

2867

-

2868

- template<typename _ForwardIterator, typename _Tp, typename _Pred>

2869

- inline bool

2870

- __check_partitioned_upper(_ForwardIterator __first,

2871

- _ForwardIterator __last, const _Tp& __value,

2872

- _Pred __pred)

2873

- {

2874

- return __check_partitioned_upper_aux(__first, __last, __value, __pred,

2875

- std::__iterator_category(__first));

2876

- }

2877

-

2878

// Helper struct to detect random access safe iterators.

2879

template<typename _Iterator>

2880

struct __is_safe_random_iterator

2881

Index: libstdc++-v3/include/debug/macros.h

2882

===================================================================

2883

--- a/src/libstdc++-v3/include/debug/macros.h (.../tags/gcc_4_8_2_release)

2884

+++ b/src/libstdc++-v3/include/debug/macros.h (.../branches/gcc-4_8-branch)

2885

@@ -261,8 +261,9 @@

2886

w.r.t. the value _Value. */

2887

#define __glibcxx_check_partitioned_lower(_First,_Last,_Value) \

2888

__glibcxx_check_valid_range(_First,_Last); \

2889

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower(_First, _Last, \

2890

- _Value), \

2891

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower( \

2892

+ __gnu_debug::__base(_First), \

2893

+ __gnu_debug::__base(_Last), _Value), \

2894

_M_message(__gnu_debug::__msg_unpartitioned) \

2895

._M_iterator(_First, #_First) \

2896

._M_iterator(_Last, #_Last) \

2897

@@ -270,8 +271,9 @@

2898

2899

#define __glibcxx_check_partitioned_upper(_First,_Last,_Value) \

2900

__glibcxx_check_valid_range(_First,_Last); \

2901

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper(_First, _Last, \

2902

- _Value), \

2903

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper( \

2904

+ __gnu_debug::__base(_First), \

2905

+ __gnu_debug::__base(_Last), _Value), \

2906

_M_message(__gnu_debug::__msg_unpartitioned) \

2907

._M_iterator(_First, #_First) \

2908

._M_iterator(_Last, #_Last) \

2909

@@ -281,8 +283,9 @@

2910

w.r.t. the value _Value and predicate _Pred. */

2911

#define __glibcxx_check_partitioned_lower_pred(_First,_Last,_Value,_Pred) \

2912

__glibcxx_check_valid_range(_First,_Last); \

2913

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower(_First, _Last, \

2914

- _Value, _Pred), \

2915

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower( \

2916

+ __gnu_debug::__base(_First), \

2917

+ __gnu_debug::__base(_Last), _Value, _Pred), \

2918

_M_message(__gnu_debug::__msg_unpartitioned_pred) \

2919

._M_iterator(_First, #_First) \

2920

._M_iterator(_Last, #_Last) \

2921

@@ -293,8 +296,9 @@

2922

w.r.t. the value _Value and predicate _Pred. */

2923

#define __glibcxx_check_partitioned_upper_pred(_First,_Last,_Value,_Pred) \

2924

__glibcxx_check_valid_range(_First,_Last); \

2925

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper(_First, _Last, \

2926

- _Value, _Pred), \

2927

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper( \

2928

+ __gnu_debug::__base(_First), \

2929

+ __gnu_debug::__base(_Last), _Value, _Pred), \

2930

_M_message(__gnu_debug::__msg_unpartitioned_pred) \

2931

._M_iterator(_First, #_First) \

2932

._M_iterator(_Last, #_Last) \

2933

Index: libstdc++-v3/include/bits/stl_algo.h

2934

===================================================================

2935

--- a/src/libstdc++-v3/include/bits/stl_algo.h (.../tags/gcc_4_8_2_release)

2936

+++ b/src/libstdc++-v3/include/bits/stl_algo.h (.../branches/gcc-4_8-branch)

2937

@@ -2279,7 +2279,7 @@

2938

_RandomAccessIterator __last)

2939

{

2940

_RandomAccessIterator __mid = __first + (__last - __first) / 2;

2941

- std::__move_median_to_first(__first, __first + 1, __mid, (__last - 2));

2942

+ std::__move_median_to_first(__first, __first + 1, __mid, __last - 1);

2943

return std::__unguarded_partition(__first + 1, __last, *__first);

2944

}

2945

2946

@@ -2291,7 +2291,7 @@

2947

_RandomAccessIterator __last, _Compare __comp)

2948

{

2949

_RandomAccessIterator __mid = __first + (__last - __first) / 2;

2950

- std::__move_median_to_first(__first, __first + 1, __mid, (__last - 2),

2951

+ std::__move_median_to_first(__first, __first + 1, __mid, __last - 1,

2952

__comp);

2953

return std::__unguarded_partition(__first + 1, __last, *__first, __comp);

2954

}

2955

Index: libstdc++-v3/include/bits/shared_ptr_base.h

2956

===================================================================

2957

--- a/src/libstdc++-v3/include/bits/shared_ptr_base.h (.../tags/gcc_4_8_2_release)

2958

+++ b/src/libstdc++-v3/include/bits/shared_ptr_base.h (.../branches/gcc-4_8-branch)

2959

@@ -391,7 +391,7 @@

2960

public:

2961

template<typename... _Args>

2962

_Sp_counted_ptr_inplace(_Alloc __a, _Args&&... __args)

2963

- : _M_impl(__a), _M_storage()

2964

+ : _M_impl(__a)

2965

{

2966

_M_impl._M_ptr = static_cast<_Tp*>(static_cast<void*>(&_M_storage));

2967

// _GLIBCXX_RESOLVE_LIB_DEFECTS

2968

@@ -819,7 +819,7 @@

2969

: _M_ptr(__r.get()), _M_refcount()

2970

{

2971

__glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>)

2972

- auto __tmp = std::__addressof(*__r.get());

2973

+ auto __tmp = __r.get();

2974

_M_refcount = __shared_count<_Lp>(std::move(__r));

2975

__enable_shared_from_this_helper(_M_refcount, __tmp, __tmp);

2976

}

2977

Index: libstdc++-v3/include/c_global/cstdio

2978

===================================================================

2979

--- a/src/libstdc++-v3/include/c_global/cstdio (.../tags/gcc_4_8_2_release)

2980

+++ b/src/libstdc++-v3/include/c_global/cstdio (.../branches/gcc-4_8-branch)

2981

@@ -69,6 +69,7 @@

2982

#undef ftell

2983

#undef fwrite

2984

#undef getc

2985

+#undef getchar

2986

#undef gets

2987

#undef perror

2988

#undef printf

2989

Index: libstdc++-v3/ChangeLog

2990

===================================================================

2991

--- a/src/libstdc++-v3/ChangeLog (.../tags/gcc_4_8_2_release)

2992

+++ b/src/libstdc++-v3/ChangeLog (.../branches/gcc-4_8-branch)

2993

@@ -1,3 +1,66 @@

2994

+2013-12-15 H.J. Lu <hongjiu.lu@intel.com>

2995

+

2996

+ * config/abi/post/x86_64-linux-gnu/x32/baseline_symbols.txt: Update.

2997

+

2998

+2013-11-22 Jonathan Wakely <jwakely.gcc@gmail.com>

2999

+

3000

+ * acinclude.m4 (libtool_VERSION): Bump.

3001

+ * configure: Regenerate.

3002

+ * doc/xml/manual/abi.xml: Update version information.

3003

+

3004

+2013-11-05 Jonathan Wakely <jwakely.gcc@gmail.com>

3005

+

3006

+ * doc/xml/manual/status_cxx2011.xml: Document aligned_union as

3007

+ missing.

3008

+

3009

+ * doc/xml/manual/spine.xml: Update copyright years.

3010

+ * doc/html/*: Regenerate.

3011

+

3012

+2013-11-01 Paolo Carlini <paolo.carlini@oracle.com>

3013

+

3014

+ PR libstdc++/58952

3015

+ * include/c_global/cstdio: Undef getchar.

3016

+

3017

+2013-10-31 Jonathan Wakely <jwakely.gcc@gmail.com>

3018

+

3019

+ * testsuite/20_util/shared_ptr/cons/58839.cc: Do not use

3020

+ default_delete<void>.

3021

+

3022

+2013-10-30 Chris Studholme <cvs@cs.utoronto.ca>

3023

+

3024

+ PR libstdc++/58912

3025

+ * include/bits/shared_ptr_base.h (_Sp_counted_ptr_inplace): Remove

3026

+ unnecessary initialization of storage buffer.

3027

+

3028

+2013-10-29 Jonathan Wakely <jwakely.gcc@gmail.com>

3029

+

3030

+ PR libstdc++/58839

3031

+ * include/bits/shared_ptr_base.h

3032

+ (__shared_ptr<T>::__shared_ptr(unique_ptr<U,D>&&)): Do not dereference

3033

+ pointer.

3034

+ * testsuite/20_util/shared_ptr/cons/58839.cc: New.

3035

+

3036

+2013-10-20 Chris Jefferson <chris@bubblescope.net>

3037

+ Paolo Carlini <paolo.carlini@oracle.com>

3038

+

3039

+ PR libstdc++/58800

3040

+ * include/bits/stl_algo.h (__unguarded_partition_pivot): Change

3041

+ __last - 2 to __last - 1.

3042

+ * testsuite/25_algorithms/nth_element/58800.cc: New

3043

+

3044

+2013-10-16 François Dumont <fdumont@gcc.gnu.org>

3045

+

3046

+ PR libstdc++/58191

3047

+ * include/debug/macros.h (__glibcxx_check_partitioned_lower): Add

3048

+ __gnu_debug::__base calls on iterators passed to internal debug

3049

+ check.

3050

+ (__glibcxx_check_partitioned_lower_pred): Likewise.

3051

+ (__glibcxx_check_partitioned_upper): Likewise.

3052

+ (__glibcxx_check_partitioned_upper_pred): Likewise.

3053

+ * include/debug/functions.h (__check_partitioned_lower):

3054

+ Remove code to detect safe iterators.

3055

+ (__check_partitioned_upper): Likewise.

3056

+

3057

2013-10-16 Release Manager

3058

3059

* GCC 4.8.2 released.

3060

Index: libstdc++-v3/testsuite/25_algorithms/nth_element/58800.cc

3061

===================================================================

3062

--- a/src/libstdc++-v3/testsuite/25_algorithms/nth_element/58800.cc (.../tags/gcc_4_8_2_release)

3063

+++ b/src/libstdc++-v3/testsuite/25_algorithms/nth_element/58800.cc (.../branches/gcc-4_8-branch)

3064

@@ -0,0 +1,52 @@

3065

3066

+//

3067

+// This file is part of the GNU ISO C++ Library. This library is free

3068

+// software; you can redistribute it and/or modify it under the

3069

+// terms of the GNU General Public License as published by the

3070

+// Free Software Foundation; either version 3, or (at your option)

3071

+// any later version.

3072

+

3073

+// This library is distributed in the hope that it will be useful,

3074

+// but WITHOUT ANY WARRANTY; without even the implied warranty of

3075

+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

3076

+// GNU General Public License for more details.

3077

+

3078

+// You should have received a copy of the GNU General Public License along

3079

+// with this library; see the file COPYING3. If not see

3080

+// <http://www.gnu.org/licenses/>.

3081

+

3082

+// 25.3.2 [lib.alg.nth.element]

3083

+

3084

+// { dg-options "-std=gnu++11" }

3085

+

3086

+#include <algorithm>

3087

+#include <testsuite_hooks.h>

3088

+#include <testsuite_iterators.h>

3089

+

3090

+using __gnu_test::test_container;

3091

+using __gnu_test::random_access_iterator_wrapper;

3092

+

3093

+typedef test_container<int, random_access_iterator_wrapper> Container;

3094

+

3095

+void test01()

3096

+{

3097

+ std::vector<int> v = {

3098

+ 207089,

3099

+ 202585,

3100

+ 180067,

3101

+ 157549,

3102

+ 211592,

3103

+ 216096,

3104

+ 207089

3105

+ };

3106

+

3107

+ Container con(v.data(), v.data() + 7);

3108

+

3109

+ std::nth_element(con.begin(), con.begin() + 3, con.end());

3110

+}

3111

+

3112

+int main()

3113

+{

3114

+ test01();

3115

+ return 0;

3116

+}

3117

Index: libstdc++-v3/testsuite/20_util/shared_ptr/cons/58839.cc

3118

===================================================================

3119

--- a/src/libstdc++-v3/testsuite/20_util/shared_ptr/cons/58839.cc (.../tags/gcc_4_8_2_release)

3120

+++ b/src/libstdc++-v3/testsuite/20_util/shared_ptr/cons/58839.cc (.../branches/gcc-4_8-branch)

3121

@@ -0,0 +1,33 @@

3122

+// { dg-options "-std=gnu++11" }

3123

+// { dg-do compile }

3124

+

3125

3126

+//

3127

+// This file is part of the GNU ISO C++ Library. This library is free

3128

+// software; you can redistribute it and/or modify it under the

3129

+// terms of the GNU General Public License as published by the

3130

+// Free Software Foundation; either version 3, or (at your option)

3131

+// any later version.

3132

+

3133

+// This library is distributed in the hope that it will be useful,

3134

+// but WITHOUT ANY WARRANTY; without even the implied warranty of

3135

+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

3136

+// GNU General Public License for more details.

3137

+

3138

+// You should have received a copy of the GNU General Public License along

3139

+// with this library; see the file COPYING3. If not see

3140

+// <http://www.gnu.org/licenses/>.

3141

+

3142

+#include <memory>

3143

+

3144

+// libstdc++/58839

3145

+

3146

+struct D {

3147

+ void operator()(void*) const noexcept { }

3148

+};

3149

+

3150

+void test01()

3151

+{

3152

+ std::unique_ptr<void, D> y;

3153

+ std::shared_ptr<void> x = std::move(y);

3154

+}

3155

Index: libstdc++-v3/config/abi/post/x86_64-linux-gnu/x32/baseline_symbols.txt

3156

===================================================================

3157

--- a/src/libstdc++-v3/config/abi/post/x86_64-linux-gnu/x32/baseline_symbols.txt (.../tags/gcc_4_8_2_release)

3158

+++ b/src/libstdc++-v3/config/abi/post/x86_64-linux-gnu/x32/baseline_symbols.txt (.../branches/gcc-4_8-branch)

3159

@@ -403,6 +403,7 @@

3160

FUNC:_ZNKSt15basic_streambufIwSt11char_traitsIwEE6getlocEv@@GLIBCXX_3.4

3161

FUNC:_ZNKSt15basic_stringbufIcSt11char_traitsIcESaIcEE3strEv@@GLIBCXX_3.4

3162

FUNC:_ZNKSt15basic_stringbufIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4

3163

+FUNC:_ZNKSt17bad_function_call4whatEv@@GLIBCXX_3.4.18

3164

FUNC:_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE3strEv@@GLIBCXX_3.4

3165

FUNC:_ZNKSt18basic_stringstreamIcSt11char_traitsIcESaIcEE5rdbufEv@@GLIBCXX_3.4

3166

FUNC:_ZNKSt18basic_stringstreamIwSt11char_traitsIwESaIwEE3strEv@@GLIBCXX_3.4

3167

@@ -590,6 +591,8 @@

3168

FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewm@@GLIBCXX_3.4

3169

FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewx@@GLIBCXX_3.4

3170

FUNC:_ZNKSt7num_putIwSt19ostreambuf_iteratorIwSt11char_traitsIwEEE6do_putES3_RSt8ios_basewy@@GLIBCXX_3.4

3171

+FUNC:_ZNKSt8__detail20_Prime_rehash_policy11_M_next_bktEj@@GLIBCXX_3.4.18

3172

+FUNC:_ZNKSt8__detail20_Prime_rehash_policy14_M_need_rehashEjjj@@GLIBCXX_3.4.18

3173

FUNC:_ZNKSt8bad_cast4whatEv@@GLIBCXX_3.4.9

3174

FUNC:_ZNKSt8ios_base7failure4whatEv@@GLIBCXX_3.4

3175

FUNC:_ZNKSt8messagesIcE18_M_convert_to_charERKSs@@GLIBCXX_3.4

3176

@@ -1207,6 +1210,7 @@

3177

FUNC:_ZNSt11regex_errorD0Ev@@GLIBCXX_3.4.15

3178

FUNC:_ZNSt11regex_errorD1Ev@@GLIBCXX_3.4.15

3179

FUNC:_ZNSt11regex_errorD2Ev@@GLIBCXX_3.4.15

3180

+FUNC:_ZNSt11this_thread11__sleep_forENSt6chrono8durationIxSt5ratioILx1ELx1EEEENS1_IxS2_ILx1ELx1000000000EEEE@@GLIBCXX_3.4.18

3181

FUNC:_ZNSt12__basic_fileIcE2fdEv@@GLIBCXX_3.4

3182

FUNC:_ZNSt12__basic_fileIcE4fileEv@@GLIBCXX_3.4.1

3183

FUNC:_ZNSt12__basic_fileIcE4openEPKcSt13_Ios_Openmodei@@GLIBCXX_3.4

3184

@@ -1485,6 +1489,11 @@

3185

FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEt@@GLIBCXX_3.4

3186

FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEx@@GLIBCXX_3.4

3187

FUNC:_ZNSt13basic_ostreamIwSt11char_traitsIwEElsEy@@GLIBCXX_3.4

3188

+FUNC:_ZNSt13random_device14_M_init_pretr1ERKSs@@GLIBCXX_3.4.18

3189

+FUNC:_ZNSt13random_device16_M_getval_pretr1Ev@@GLIBCXX_3.4.18

3190

+FUNC:_ZNSt13random_device7_M_finiEv@@GLIBCXX_3.4.18

3191

+FUNC:_ZNSt13random_device7_M_initERKSs@@GLIBCXX_3.4.18

3192

+FUNC:_ZNSt13random_device9_M_getvalEv@@GLIBCXX_3.4.18

3193

FUNC:_ZNSt13runtime_errorC1ERKSs@@GLIBCXX_3.4

3194

FUNC:_ZNSt13runtime_errorC2ERKSs@@GLIBCXX_3.4

3195

FUNC:_ZNSt13runtime_errorD0Ev@@GLIBCXX_3.4

3196

@@ -1929,6 +1938,8 @@

3197

FUNC:_ZNSt6__norm15_List_node_base8transferEPS0_S1_@@GLIBCXX_3.4.9

3198

FUNC:_ZNSt6__norm15_List_node_base9_M_unhookEv@@GLIBCXX_3.4.14

3199

FUNC:_ZNSt6chrono12system_clock3nowEv@@GLIBCXX_3.4.11

3200

+FUNC:_ZNSt6chrono3_V212steady_clock3nowEv@@GLIBCXX_3.4.19

3201

+FUNC:_ZNSt6chrono3_V212system_clock3nowEv@@GLIBCXX_3.4.19

3202

FUNC:_ZNSt6gslice8_IndexerC1EjRKSt8valarrayIjES4_@@GLIBCXX_3.4

3203

FUNC:_ZNSt6gslice8_IndexerC2EjRKSt8valarrayIjES4_@@GLIBCXX_3.4

3204

FUNC:_ZNSt6locale11_M_coalesceERKS_S1_i@@GLIBCXX_3.4

3205

@@ -2467,6 +2478,7 @@

3206

FUNC:__cxa_guard_release@@CXXABI_1.3

3207

FUNC:__cxa_pure_virtual@@CXXABI_1.3

3208

FUNC:__cxa_rethrow@@CXXABI_1.3

3209

+FUNC:__cxa_thread_atexit@@CXXABI_1.3.7

3210

FUNC:__cxa_throw@@CXXABI_1.3

3211

FUNC:__cxa_tm_cleanup@@CXXABI_TM_1

3212

FUNC:__cxa_vec_cctor@@CXXABI_1.3

3213

@@ -2491,6 +2503,7 @@

3214

OBJECT:0:CXXABI_1.3.4

3215

OBJECT:0:CXXABI_1.3.5

3216

OBJECT:0:CXXABI_1.3.6

3217

+OBJECT:0:CXXABI_1.3.7

3218

OBJECT:0:CXXABI_TM_1

3219

OBJECT:0:GLIBCXX_3.4

3220

OBJECT:0:GLIBCXX_3.4.1

3221

@@ -2502,6 +2515,8 @@

3222

OBJECT:0:GLIBCXX_3.4.15

3223

OBJECT:0:GLIBCXX_3.4.16

3224

OBJECT:0:GLIBCXX_3.4.17

3225

+OBJECT:0:GLIBCXX_3.4.18

3226

+OBJECT:0:GLIBCXX_3.4.19

3227

OBJECT:0:GLIBCXX_3.4.2

3228

OBJECT:0:GLIBCXX_3.4.3

3229

OBJECT:0:GLIBCXX_3.4.4

3230

@@ -3033,6 +3048,8 @@

3231

OBJECT:1:_ZNSt21__numeric_limits_base9is_moduloE@@GLIBCXX_3.4

3232

OBJECT:1:_ZNSt21__numeric_limits_base9is_signedE@@GLIBCXX_3.4

3233

OBJECT:1:_ZNSt6chrono12system_clock12is_monotonicE@@GLIBCXX_3.4.11

3234

+OBJECT:1:_ZNSt6chrono3_V212steady_clock9is_steadyE@@GLIBCXX_3.4.19

3235

+OBJECT:1:_ZNSt6chrono3_V212system_clock9is_steadyE@@GLIBCXX_3.4.19

3236

OBJECT:1:_ZSt10adopt_lock@@GLIBCXX_3.4.11

3237

OBJECT:1:_ZSt10defer_lock@@GLIBCXX_3.4.11

3238

OBJECT:1:_ZSt11try_to_lock@@GLIBCXX_3.4.11

3239

Index: libstdc++-v3/acinclude.m4

3240

===================================================================

3241

--- a/src/libstdc++-v3/acinclude.m4 (.../tags/gcc_4_8_2_release)

3242

+++ b/src/libstdc++-v3/acinclude.m4 (.../branches/gcc-4_8-branch)

3243

@@ -3266,7 +3266,7 @@

3244

fi

3245

3246

# For libtool versioning info, format is CURRENT:REVISION:AGE

3247

-libtool_VERSION=6:18:0

3248

+libtool_VERSION=6:19:0

3249

3250

# Everything parsed; figure out what files and settings to use.

3251

case $enable_symvers in

3252

Index: boehm-gc/include/private/gcconfig.h

3253

===================================================================

3254

--- a/src/boehm-gc/include/private/gcconfig.h (.../tags/gcc_4_8_2_release)

3255

+++ b/src/boehm-gc/include/private/gcconfig.h (.../branches/gcc-4_8-branch)

3256

@@ -837,7 +837,15 @@

3257

# define NO_PTHREAD_TRYLOCK

3258

# endif

3259

# ifdef FREEBSD

3260

+# if defined(__powerpc64__)

3261

+# define ALIGNMENT 8

3262

+# define CPP_WORDSZ 64

3263

+# ifndef HBLKSIZE

3264

+# define HBLKSIZE 4096

3265

+# endif

3266

+# else

3267

# define ALIGNMENT 4

3268

+# endif

3269

# define OS_TYPE "FREEBSD"

3270

# ifndef GC_FREEBSD_THREADS

3271

# define MPROTECT_VDB

3272

Index: boehm-gc/ChangeLog

3273

===================================================================

3274

--- a/src/boehm-gc/ChangeLog (.../tags/gcc_4_8_2_release)

3275

+++ b/src/boehm-gc/ChangeLog (.../branches/gcc-4_8-branch)

3276

@@ -1,3 +1,8 @@

3277

+2013-12-29 Andreas Tobler <andreast@gcc.gnu.org>

3278

+

3279

+ Merge from trunk:

3280

+ * include/private/gcconfig.h: Add FreeBSD powerpc64 defines.

3281

+

3282

2013-10-16 Release Manager

3283

3284

* GCC 4.8.2 released.

3285

Index: contrib/ChangeLog

3286

===================================================================

3287

--- a/src/contrib/ChangeLog (.../tags/gcc_4_8_2_release)

3288

+++ b/src/contrib/ChangeLog (.../branches/gcc-4_8-branch)

3289

@@ -1,3 +1,7 @@

3290

+2013-10-21 Mike Stump <mikestump@comcast.net>

3291

+

3292

+ * gcc_update (configure): Update to handle svn 1.8.1.

3293

+

3294

2013-10-16 Release Manager

3295

3296

* GCC 4.8.2 released.

3297

Index: contrib/gcc_update

3298

===================================================================

3299

--- a/src/contrib/gcc_update (.../tags/gcc_4_8_2_release)

3300

+++ b/src/contrib/gcc_update (.../branches/gcc-4_8-branch)

3301

@@ -382,7 +382,7 @@

3302

fi

3303

3304

revision=`$GCC_SVN info | awk '/Revision:/ { print $2 }'`

3305

- branch=`$GCC_SVN info | sed -ne "/URL:/ {

3306

+ branch=`$GCC_SVN info | sed -ne "/^URL:/ {

3307

s,.*/trunk,trunk,

3308

s,.*/branches/,,

3309

s,.*/tags/,,

3310

Index: libbacktrace/dwarf.c

3311

===================================================================

3312

--- a/src/libbacktrace/dwarf.c (.../tags/gcc_4_8_2_release)

3313

+++ b/src/libbacktrace/dwarf.c (.../branches/gcc-4_8-branch)

3314

@@ -2507,19 +2507,23 @@

3315

if (pfvec->count == 0)

3316

return;

3317

3318

- addrs = (struct function_addrs *) pfvec->vec.base;

3319

addrs_count = pfvec->count;

3320

3321

if (fvec == NULL)

3322

{

3323

if (!backtrace_vector_release (state, &lvec.vec, error_callback, data))

3324

return;

3325

+ addrs = (struct function_addrs *) pfvec->vec.base;

3326

}

3327

else

3328

{

3329

/* Finish this list of addresses, but leave the remaining space in

3330

the vector available for the next function unit. */

3331

- backtrace_vector_finish (state, &fvec->vec);

3332

+ addrs = ((struct function_addrs *)

3333

+ backtrace_vector_finish (state, &fvec->vec,

3334

+ error_callback, data));

3335

+ if (addrs == NULL)

3336

+ return;

3337

fvec->count = 0;

3338

}

3339

3340

Index: libbacktrace/ChangeLog

3341

===================================================================

3342

--- a/src/libbacktrace/ChangeLog (.../tags/gcc_4_8_2_release)

3343

+++ b/src/libbacktrace/ChangeLog (.../branches/gcc-4_8-branch)

3344

@@ -1,3 +1,21 @@

3345

+2013-12-05 Ian Lance Taylor <iant@google.com>

3346

+

3347

+ * alloc.c (backtrace_vector_finish): Add error_callback and data

3348

+ parameters. Call backtrace_vector_release. Return address base.

3349

+ * mmap.c (backtrace_vector_finish): Add error_callback and data

3350

+ parameters. Return address base.

3351

+ * dwarf.c (read_function_info): Get new address base from

3352

+ backtrace_vector_finish.

3353

+ * internal.h (backtrace_vector_finish): Update declaration.

3354

+

3355

+2013-11-30 Ian Lance Taylor <iant@google.com>

3356

+

3357

+ Backport from mainline:

3358

+ 2013-10-17 Ian Lance Taylor <iant@google.com>

3359

+

3360

+ * elf.c (elf_add): Don't get the wrong offsets if a debug section

3361

+ is missing.

3362

+

3363

2013-10-16 Release Manager

3364

3365

* GCC 4.8.2 released.

3366

Index: libbacktrace/elf.c

3367

===================================================================

3368

--- a/src/libbacktrace/elf.c (.../tags/gcc_4_8_2_release)

3369

+++ b/src/libbacktrace/elf.c (.../branches/gcc-4_8-branch)

3370

@@ -725,6 +725,8 @@

3371

{

3372

off_t end;

3373

3374

+ if (sections[i].size == 0)

3375

+ continue;

3376

if (min_offset == 0 || sections[i].offset < min_offset)

3377

min_offset = sections[i].offset;

3378

end = sections[i].offset + sections[i].size;

3379

@@ -751,8 +753,13 @@

3380

descriptor = -1;

3381

3382

for (i = 0; i < (int) DEBUG_MAX; ++i)

3383

- sections[i].data = ((const unsigned char *) debug_view.data

3384

- + (sections[i].offset - min_offset));

3385

+ {

3386

+ if (sections[i].size == 0)

3387

+ sections[i].data = NULL;

3388

+ else

3389

+ sections[i].data = ((const unsigned char *) debug_view.data

3390

+ + (sections[i].offset - min_offset));

3391

+ }

3392

3393

if (!backtrace_dwarf_add (state, base_address,

3394

sections[DEBUG_INFO].data,

3395

Index: libbacktrace/internal.h

3396

===================================================================

3397

--- a/src/libbacktrace/internal.h (.../tags/gcc_4_8_2_release)

3398

+++ b/src/libbacktrace/internal.h (.../branches/gcc-4_8-branch)

3399

@@ -192,13 +192,17 @@

3400

struct backtrace_vector *vec);

3401

3402

/* Finish the current allocation on VEC. Prepare to start a new

3403

- allocation. The finished allocation will never be freed. */

3404

+ allocation. The finished allocation will never be freed. Returns

3405

+ a pointer to the base of the finished entries, or NULL on

3406

+ failure. */

3407

3408

-extern void backtrace_vector_finish (struct backtrace_state *state,

3409

- struct backtrace_vector *vec);

3410

+extern void* backtrace_vector_finish (struct backtrace_state *state,

3411

+ struct backtrace_vector *vec,

3412

+ backtrace_error_callback error_callback,

3413

+ void *data);

3414

3415

-/* Release any extra space allocated for VEC. Returns 1 on success, 0

3416

- on failure. */

3417

+/* Release any extra space allocated for VEC. This may change

3418

+ VEC->base. Returns 1 on success, 0 on failure. */

3419

3420

extern int backtrace_vector_release (struct backtrace_state *state,

3421

struct backtrace_vector *vec,

3422

Index: libbacktrace/alloc.c

3423

===================================================================

3424

--- a/src/libbacktrace/alloc.c (.../tags/gcc_4_8_2_release)

3425

+++ b/src/libbacktrace/alloc.c (.../branches/gcc-4_8-branch)

3426

@@ -113,12 +113,24 @@

3427

3428

/* Finish the current allocation on VEC. */

3429

3430

-void

3431

-backtrace_vector_finish (struct backtrace_state *state ATTRIBUTE_UNUSED,

3432

- struct backtrace_vector *vec)

3433

+void *

3434

+backtrace_vector_finish (struct backtrace_state *state,

3435

+ struct backtrace_vector *vec,

3436

+ backtrace_error_callback error_callback,

3437

+ void *data)

3438

{

3439

- vec->base = (char *) vec->base + vec->size;

3440

+ void *ret;

3441

+

3442

+ /* With this allocator we call realloc in backtrace_vector_grow,

3443

+ which means we can't easily reuse the memory here. So just

3444

+ release it. */

3445

+ if (!backtrace_vector_release (state, vec, error_callback, data))

3446

+ return NULL;

3447

+ ret = vec->base;

3448

+ vec->base = NULL;

3449

vec->size = 0;

3450

+ vec->alc = 0;

3451

+ return ret;

3452

}

3453

3454

/* Release any extra space allocated for VEC. */

3455

Index: libbacktrace/mmap.c

3456

===================================================================

3457

--- a/src/libbacktrace/mmap.c (.../tags/gcc_4_8_2_release)

3458

+++ b/src/libbacktrace/mmap.c (.../branches/gcc-4_8-branch)

3459

@@ -230,12 +230,19 @@

3460

3461

/* Finish the current allocation on VEC. */

3462

3463

-void

3464

-backtrace_vector_finish (struct backtrace_state *state ATTRIBUTE_UNUSED,

3465

- struct backtrace_vector *vec)

3466

+void *

3467

+backtrace_vector_finish (

3468

+ struct backtrace_state *state ATTRIBUTE_UNUSED,

3469

+ struct backtrace_vector *vec,

3470

+ backtrace_error_callback error_callback ATTRIBUTE_UNUSED,

3471

+ void *data ATTRIBUTE_UNUSED)

3472

{

3473

+ void *ret;

3474

+

3475

+ ret = vec->base;

3476

vec->base = (char *) vec->base + vec->size;

3477

vec->size = 0;

3478

+ return ret;

3479

}

3480

3481

/* Release any extra space allocated for VEC. */

3482

Index: libjava/classpath/native/jni/gtk-peer/gnu_java_awt_peer_gtk_GdkFontPeer.c

3483

===================================================================

3484

--- a/src/libjava/classpath/native/jni/gtk-peer/gnu_java_awt_peer_gtk_GdkFontPeer.c (.../tags/gcc_4_8_2_release)

3485

+++ b/src/libjava/classpath/native/jni/gtk-peer/gnu_java_awt_peer_gtk_GdkFontPeer.c (.../branches/gcc-4_8-branch)

3486

@@ -39,10 +39,11 @@

3487

#include <pango/pango.h>

3488

#include <pango/pangoft2.h>

3489

#include <pango/pangofc-font.h>

3490

-#include <freetype/ftglyph.h>

3491

-#include <freetype/ftoutln.h>

3492

-#include <freetype/fttypes.h>

3493

-#include <freetype/tttables.h>

3494

+#include <ft2build.h>

3495

+#include FT_GLYPH_H

3496

+#include FT_OUTLINE_H

3497

+#include FT_TYPES_H

3498

+#include FT_TRUETYPE_TABLES_H

3499

#include "gdkfont.h"

3500

#include "gtkpeer.h"

3501

#include "gnu_java_awt_peer_gtk_GdkFontPeer.h"

3502

Index: libjava/classpath/native/jni/gtk-peer/gnu_java_awt_peer_gtk_FreetypeGlyphVector.c

3503

===================================================================

3504

--- a/src/libjava/classpath/native/jni/gtk-peer/gnu_java_awt_peer_gtk_FreetypeGlyphVector.c (.../tags/gcc_4_8_2_release)

3505

+++ b/src/libjava/classpath/native/jni/gtk-peer/gnu_java_awt_peer_gtk_FreetypeGlyphVector.c (.../branches/gcc-4_8-branch)

3506

@@ -42,8 +42,9 @@

3507

#include <pango/pango.h>

3508

#include <pango/pangoft2.h>

3509

#include <pango/pangofc-font.h>

3510

-#include <freetype/ftglyph.h>

3511

-#include <freetype/ftoutln.h>

3512

+#include <ft2build.h>

3513

+#include FT_GLYPH_H

3514

+#include FT_OUTLINE_H

3515

#include "jcl.h"

3516

#include "gdkfont.h"

3517

#include "gnu_java_awt_peer_gtk_FreetypeGlyphVector.h"

3518

Index: libjava/classpath/ChangeLog.gcj

3519

===================================================================

3520

--- a/src/libjava/classpath/ChangeLog.gcj (.../tags/gcc_4_8_2_release)

3521

+++ b/src/libjava/classpath/ChangeLog.gcj (.../branches/gcc-4_8-branch)

3522

@@ -1,3 +1,9 @@

3523

+2013-11-29 Matthias Klose <doko@ubuntu.com>

3524

+

3525

+ * native/jni/gtk-peer/gnu_java_awt_peer_gtk_FreetypeGlyphVector.c,

3526

+ native/jni/gtk-peer/gnu_java_awt_peer_gtk_GdkFontPeer.c:

3527

+ Fix freetype includes.

3528

+

3529

2013-03-22 Jakub Jelinek <jakub@redhat.com>

3530

3531

PR other/43620

3532

Index: gnattools/configure

3533

===================================================================

3534

--- a/src/gnattools/configure (.../tags/gcc_4_8_2_release)

3535

+++ b/src/gnattools/configure (.../branches/gcc-4_8-branch)

3536

@@ -2029,66 +2029,59 @@

3537

# Per-target case statement

3538

# -------------------------

3539

case "${target}" in

3540

- alpha*-dec-vx*) # Unlike all other Vxworks

3541

+ *-*-aix*)

3542

+ TOOLS_TARGET_PAIRS="\

3543

+ mlib-tgt-specific.adb<mlib-tgt-specific-aix.adb \

3544

+ indepsw.adb<indepsw-aix.adb"

3545

;;

3546

- m68k*-wrs-vx* \

3547

- | powerpc*-wrs-vxworks \

3548

- | sparc*-wrs-vx* \

3549

- | *86-wrs-vxworks \

3550

- | mips*-wrs-vx*)

3551

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-vxworks.adb"

3552

+ *-*-darwin*)

3553

+ TOOLS_TARGET_PAIRS="\

3554

+ mlib-tgt-specific.adb<mlib-tgt-specific-darwin.adb \

3555

+ indepsw.adb<indepsw-darwin.adb"

3556

;;

3557

- sparc-sun-solaris*)

3558

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-solaris.adb"

3559

+ *-*-freebsd*)

3560

+ TOOLS_TARGET_PAIRS="\

3561

+ mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb \

3562

+ indepsw.adb<indepsw-gnu.adb"

3563

;;

3564

- *86-*-solaris2* | x86_64-*-solaris2.1[0-9]*)

3565

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-solaris.adb"

3566

- ;;

3567

- *86-*-linux* \

3568

- | powerpc*-*-linux* \

3569

- | *ia64-*-linux* \

3570

- | alpha*-*-linux* \

3571

- | sparc*-*-linux* \

3572

- | hppa*-*-linux* \

3573

- | *x86_64-*-linux*)

3574

+ *-*-linux*)

3575

TOOLS_TARGET_PAIRS="\

3576

mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb \

3577

indepsw.adb<indepsw-gnu.adb"

3578

;;

3579

- s390*-*-linux*)

3580

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb"

3581

+ *-*-lynxos*)

3582

+ TOOLS_TARGET_PAIRS="\

3583

+ mlib-tgt-specific.adb<mlib-tgt-specific-lynxos.adb \

3584

+ indepsw.adb<indepsw-gnu.adb"

3585

;;

3586

- *86-*-freebsd*)

3587

+ *-*-solaris*)

3588

+ TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-solaris.adb"

3589

+ ;;

3590

+ *-*-vxworks*)

3591

TOOLS_TARGET_PAIRS="\

3592

- mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb \

3593

+ mlib-tgt-specific.adb<mlib-tgt-specific-vxworks.adb \

3594

indepsw.adb<indepsw-gnu.adb"

3595

;;

3596

- hppa*-hp-hpux10*) # Unlike hpux11

3597

+ hppa*-hp-hpux10*)

3598

;;

3599

hppa*-hp-hpux11*)

3600

TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-hpux.adb"

3601

;;

3602

- *-ibm-aix*)

3603

- TOOLS_TARGET_PAIRS="\

3604

- mlib-tgt-specific.adb<mlib-tgt-specific-aix.adb \

3605

- indepsw.adb<indepsw-aix.adb"

3606

+ ia64-hp-hpux11*)

3607

+ TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-ia64-hpux.adb"

3608

;;

3609

- alpha*-dec-vms* | alpha*-dec-openvms* | alpha*-dec-vms* \

3610

- | alpha*-hp-vms* | alpha*-hp-openvms* | alpha*-hp-vms*)

3611

+ alpha*-*-vms* | alpha*-*-openvms*)

3612

TOOLS_TARGET_PAIRS="\

3613

mlib-tgt-specific.adb<mlib-tgt-specific-vms-alpha.adb \

3614

symbols.adb<symbols-vms.adb \

3615

symbols-processing.adb<symbols-processing-vms-alpha.adb"

3616

-

3617

EXTRA_GNATTOOLS='../../gnatlbr$(exeext) ../../gnatsym$(exeext)'

3618

;;

3619

- ia64*-dec-vms* | ia64*-dec-openvms* | ia64*-dec-vms* \

3620

- | ia64*-hp-vms* | ia64*-hp-openvms* | ia64*-hp-vms*)

3621

+ ia64-*-vms* | ia64-*-openvms*)

3622

TOOLS_TARGET_PAIRS="\

3623

mlib-tgt-specific.adb<mlib-tgt-specific-vms-ia64.adb \

3624

symbols.adb<symbols-vms.adb \

3625

symbols-processing.adb<symbols-processing-vms-ia64.adb"

3626

-

3627

EXTRA_GNATTOOLS='../../gnatlbr$(exeext) ../../gnatsym$(exeext)'

3628

;;

3629

*-*-cygwin32* | *-*-mingw32* | *-*-pe)

3630

@@ -2097,14 +2090,6 @@

3631

indepsw.adb<indepsw-mingw.adb"

3632

EXTRA_GNATTOOLS='../../gnatdll$(exeext)'

3633

;;

3634

- *-*-darwin*)

3635

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-darwin.adb"

3636

- ;;

3637

- *-*-lynxos)

3638

- TOOLS_TARGET_PAIRS="\

3639

- mlib-tgt-specific.adb<mlib-tgt-specific-lynxos.adb \

3640

- indepsw.adb<indepsw-gnu.adb"

3641

- ;;

3642

esac

3643

3644

# From user or toplevel makefile.

3645

Index: gnattools/Makefile.in

3646

===================================================================

3647

--- a/src/gnattools/Makefile.in (.../tags/gcc_4_8_2_release)

3648

+++ b/src/gnattools/Makefile.in (.../branches/gcc-4_8-branch)

3649

@@ -24,6 +24,8 @@

3650

libdir = @libdir@

3651

build = @build@

3652

target = @target@

3653

+host = @host@

3654

+host_alias = @host_alias@

3655

prefix = @prefix@

3656

INSTALL = @INSTALL@

3657

INSTALL_DATA = @INSTALL_DATA@

3658

@@ -84,6 +86,7 @@

3659

TOOLS_FLAGS_TO_PASS_RE= \

3660

"CC=../../xgcc -B../../" \

3661

"CFLAGS=$(CFLAGS)" \

3662

+ "LDFLAGS=$(LDFLAGS)" \

3663

"ADAFLAGS=$(ADAFLAGS)" \

3664

"ADA_CFLAGS=$(ADA_CFLAGS)" \

3665

"INCLUDES=$(INCLUDES_FOR_SUBDIR)" \

3666

@@ -97,6 +100,22 @@

3667

"TOOLSCASE=cross"

3668

3669

# Variables for gnattools, cross

3670

+ifeq ($(build), $(host))

3671

+ GNATMAKE_FOR_HOST=gnatmake

3672

+ GNATLINK_FOR_HOST=gnatlink

3673

+ GNATBIND_FOR_HOST=gnatbind

3674

+ GNATLS_FOR_HOST=gnatls

3675

+else

3676

+ GNATMAKE_FOR_HOST=$(host_alias)-gnatmake

3677

+ GNATLINK_FOR_HOST=$(host_alias)-gnatlink

3678

+ GNATBIND_FOR_HOST=$(host_alias)-gnatbind

3679

+ GNATLS_FOR_HOST=$(host_alias)-gnatls

3680

+endif

3681

+

3682

+# Put the host RTS dir first in the PATH to hide the default runtime

3683

+# files that are among the sources

3684

+RTS_DIR:=$(strip $(subst \,/,$(shell $(GNATLS_FOR_HOST) -v | grep adalib )))

3685

+

3686

TOOLS_FLAGS_TO_PASS_CROSS= \

3687

"CC=$(CC)" \

3688

"CFLAGS=$(CFLAGS) $(WARN_CFLAGS)" \

3689

@@ -108,9 +127,9 @@

3690

"exeext=$(exeext)" \

3691

"fsrcdir=$(fsrcdir)" \

3692

"srcdir=$(fsrcdir)" \

3693

- "GNATMAKE=gnatmake" \

3694

- "GNATLINK=gnatlink" \

3695

- "GNATBIND=gnatbind" \

3696

+ "GNATMAKE=$(GNATMAKE_FOR_HOST)" \

3697

+ "GNATLINK=$(GNATLINK_FOR_HOST)" \

3698

+ "GNATBIND=$(GNATBIND_FOR_HOST)" \

3699

"TOOLSCASE=cross" \

3700

"LIBGNAT="

3701

3702

@@ -179,11 +198,6 @@

3703

$(MAKE) -C $(GCC_DIR)/ada/tools -f ../Makefile \

3704

$(TOOLS_FLAGS_TO_PASS_NATIVE) common-tools

3705

3706

-# For cross builds of gnattools,

3707

-# put the host RTS dir first in the PATH to hide the default runtime

3708

-# files that are among the sources

3709

-# FIXME: This should be done in configure.

3710

-RTS_DIR:=$(strip $(subst \,/,$(shell gnatls -v | grep adalib )))

3711

gnattools-cross: $(GCC_DIR)/stamp-tools

3712

# gnattools1-re

3713

$(MAKE) -C $(GCC_DIR)/ada/tools -f ../Makefile \

3714

Index: gnattools/configure.ac

3715

===================================================================

3716

--- a/src/gnattools/configure.ac (.../tags/gcc_4_8_2_release)

3717

+++ b/src/gnattools/configure.ac (.../branches/gcc-4_8-branch)

3718

@@ -69,66 +69,59 @@

3719

# Per-target case statement

3720

# -------------------------

3721

case "${target}" in

3722

- alpha*-dec-vx*) # Unlike all other Vxworks

3723

+ *-*-aix*)

3724

+ TOOLS_TARGET_PAIRS="\

3725

+ mlib-tgt-specific.adb<mlib-tgt-specific-aix.adb \

3726

+ indepsw.adb<indepsw-aix.adb"

3727

;;

3728

- m68k*-wrs-vx* \

3729

- | powerpc*-wrs-vxworks \

3730

- | sparc*-wrs-vx* \

3731

- | *86-wrs-vxworks \

3732

- | mips*-wrs-vx*)

3733

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-vxworks.adb"

3734

+ *-*-darwin*)

3735

+ TOOLS_TARGET_PAIRS="\

3736

+ mlib-tgt-specific.adb<mlib-tgt-specific-darwin.adb \

3737

+ indepsw.adb<indepsw-darwin.adb"

3738

;;

3739

- sparc-sun-solaris*)

3740

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-solaris.adb"

3741

+ *-*-freebsd*)

3742

+ TOOLS_TARGET_PAIRS="\

3743

+ mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb \

3744

+ indepsw.adb<indepsw-gnu.adb"

3745

;;

3746

- *86-*-solaris2* | x86_64-*-solaris2.1[[0-9]]*)

3747

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-solaris.adb"

3748

- ;;

3749

- *86-*-linux* \

3750

- | powerpc*-*-linux* \

3751

- | *ia64-*-linux* \

3752

- | alpha*-*-linux* \

3753

- | sparc*-*-linux* \

3754

- | hppa*-*-linux* \

3755

- | *x86_64-*-linux*)

3756

+ *-*-linux*)

3757

TOOLS_TARGET_PAIRS="\

3758

mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb \

3759

indepsw.adb<indepsw-gnu.adb"

3760

;;

3761

- s390*-*-linux*)

3762

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb"

3763

+ *-*-lynxos*)

3764

+ TOOLS_TARGET_PAIRS="\

3765

+ mlib-tgt-specific.adb<mlib-tgt-specific-lynxos.adb \

3766

+ indepsw.adb<indepsw-gnu.adb"

3767

;;

3768

- *86-*-freebsd*)

3769

+ *-*-solaris*)

3770

+ TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-solaris.adb"

3771

+ ;;

3772

+ *-*-vxworks*)

3773

TOOLS_TARGET_PAIRS="\

3774

- mlib-tgt-specific.adb<mlib-tgt-specific-linux.adb \

3775

+ mlib-tgt-specific.adb<mlib-tgt-specific-vxworks.adb \

3776

indepsw.adb<indepsw-gnu.adb"

3777

;;

3778

- hppa*-hp-hpux10*) # Unlike hpux11

3779

+ hppa*-hp-hpux10*)

3780

;;

3781

hppa*-hp-hpux11*)

3782

TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-hpux.adb"

3783

;;

3784

- *-ibm-aix*)

3785

- TOOLS_TARGET_PAIRS="\

3786

- mlib-tgt-specific.adb<mlib-tgt-specific-aix.adb \

3787

- indepsw.adb<indepsw-aix.adb"

3788

+ ia64-hp-hpux11*)

3789

+ TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-ia64-hpux.adb"

3790

;;

3791

- alpha*-dec-vms* | alpha*-dec-openvms* | alpha*-dec-vms* \

3792

- | alpha*-hp-vms* | alpha*-hp-openvms* | alpha*-hp-vms*)

3793

+ alpha*-*-vms* | alpha*-*-openvms*)

3794

TOOLS_TARGET_PAIRS="\

3795

mlib-tgt-specific.adb<mlib-tgt-specific-vms-alpha.adb \

3796

symbols.adb<symbols-vms.adb \

3797

symbols-processing.adb<symbols-processing-vms-alpha.adb"

3798

-

3799

EXTRA_GNATTOOLS='../../gnatlbr$(exeext) ../../gnatsym$(exeext)'

3800

;;

3801

- ia64*-dec-vms* | ia64*-dec-openvms* | ia64*-dec-vms* \

3802

- | ia64*-hp-vms* | ia64*-hp-openvms* | ia64*-hp-vms*)

3803

+ ia64-*-vms* | ia64-*-openvms*)

3804

TOOLS_TARGET_PAIRS="\

3805

mlib-tgt-specific.adb<mlib-tgt-specific-vms-ia64.adb \

3806

symbols.adb<symbols-vms.adb \

3807

symbols-processing.adb<symbols-processing-vms-ia64.adb"

3808

-

3809

EXTRA_GNATTOOLS='../../gnatlbr$(exeext) ../../gnatsym$(exeext)'

3810

;;

3811

*-*-cygwin32* | *-*-mingw32* | *-*-pe)

3812

@@ -137,14 +130,6 @@

3813

indepsw.adb<indepsw-mingw.adb"

3814

EXTRA_GNATTOOLS='../../gnatdll$(exeext)'

3815

;;

3816

- *-*-darwin*)

3817

- TOOLS_TARGET_PAIRS="mlib-tgt-specific.adb<mlib-tgt-specific-darwin.adb"

3818

- ;;

3819

- *-*-lynxos)

3820

- TOOLS_TARGET_PAIRS="\

3821

- mlib-tgt-specific.adb<mlib-tgt-specific-lynxos.adb \

3822

- indepsw.adb<indepsw-gnu.adb"

3823

- ;;

3824

esac

3825

3826

# From user or toplevel makefile.

3827

Index: gnattools/ChangeLog

3828

===================================================================

3829

--- a/src/gnattools/ChangeLog (.../tags/gcc_4_8_2_release)

3830

+++ b/src/gnattools/ChangeLog (.../branches/gcc-4_8-branch)

3831

@@ -1,3 +1,23 @@

3832

+2013-12-12 Eric Botcazou <ebotcazou@adacore.com>

3833

+ Iain Sandoe <iain@codesourcery.com>

3834

+

3835

+ PR ada/55946

3836

+ * Makefile.in (host): Define.

3837

+ (host_alias): Likewise.

3838

+ (TOOLS_FLAGS_TO_PASS_RE): Add LDFLAGS.

3839

+ (GNATMAKE_FOR_HOST): Define.

3840

+ (GNATLINK_FOR_HOST): Likewise.

3841

+ (GNATBIND_FOR_HOST): Likewise.

3842

+ (GNATLS_FOR_HOST): Likewise.

3843

+ (RTS_DIR): Move around and use GNATLS_FOR_HOST.

3844

+ (TOOLS_FLAGS_TO_PASS_CROSS): Use the other *_HOST variables.

3845

+

3846

+2013-12-04 Eric Botcazou <ebotcazou@adacore.com>

3847

+

3848

+ PR ada/59382

3849

+ * configure.ac (target parameterization): Rewrite.

3850

+ * configure: Regenerate.

3851

+

3852

2013-10-16 Release Manager

3853

3854

* GCC 4.8.2 released.

3855

Index: libgcc/config.host

3856

===================================================================

3857

--- a/src/libgcc/config.host (.../tags/gcc_4_8_2_release)

3858

+++ b/src/libgcc/config.host (.../branches/gcc-4_8-branch)

3859

@@ -331,10 +331,10 @@

3860

;;

3861

arm*-*-uclinux*) # ARM ucLinux

3862

tmake_file="${tmake_file} t-fixedpoint-gnu-prefix"

3863

+ tmake_file="$tmake_file arm/t-arm arm/t-elf t-softfp-sfdf t-softfp-excl arm/t-softfp t-softfp"

3864

tmake_file="${tmake_file} arm/t-bpabi"

3865

tm_file="$tm_file arm/bpabi-lib.h"

3866

unwind_header=config/arm/unwind-arm.h

3867

- tmake_file="$tmake_file arm/t-arm arm/t-elf t-softfp-sfdf t-softfp-excl arm/t-softfp t-softfp"

3868

extra_parts="$extra_parts crti.o crtn.o"

3869

;;

3870

arm*-*-eabi* | arm*-*-symbianelf* | arm*-*-rtems*)

3871

@@ -718,6 +718,10 @@

3872

tmake_file="${tmake_file} microblaze/t-microblaze t-fdpbit"

3873

extra_parts="$extra_parts crtbeginS.o crtendS.o crtbeginT.o crti.o crtn.o"

3874

;;

3875

+microblaze*-*-rtems*)

3876

+ tmake_file="${tmake_file} microblaze/t-microblaze t-fdpbit"

3877

+ extra_parts="$extra_parts crtbeginS.o crtendS.o crtbeginT.o crti.o crtn.o"

3878

+ ;;

3879

mips*-*-netbsd*) # NetBSD/mips, either endian.

3880

;;

3881

mips*-*-linux*) # Linux MIPS, either endian.

3882

Index: libgcc/ChangeLog

3883

===================================================================

3884

--- a/src/libgcc/ChangeLog (.../tags/gcc_4_8_2_release)

3885

+++ b/src/libgcc/ChangeLog (.../branches/gcc-4_8-branch)

3886

@@ -1,3 +1,41 @@

3887

+2014-01-03 Joseph Myers <joseph@codesourcery.com>

3888

+

3889

+ * config/rs6000/ibm-ldouble.c (__gcc_qdiv): Scale up arguments in

3890

+ case of small numerator and finite nonzero result.

3891

+

3892

+2013-12-12 Zhenqiang Chen <zhenqiang.chen@arm.com>

3893

+

3894

+ Backport from trunk r205917.

3895

+ 2013-12-12 Zhenqiang Chen <zhenqiang.chen@arm.com>

3896

+ * config.host (arm*-*-uclinux*): Move t-arm before t-bpabi.

3897

+

3898

+2013-12-10 Uros Bizjak <ubizjak@gmail.com>

3899

+

3900

+ * config/i386/sfp-exceptions.c (__sfp_handle_exceptions): Emit SSE

3901

+ instructions when __SSE_MATH__ is defined.

3902

+

3903

+2013-12-06 Ralf Corsépius <ralf.corsepius@rtems.org>

3904

+

3905

+ * config.host (microblaze-*-rtems*): New.

3906

+

3907

+2013-11-10 Kai Tietz <ktietz@redhat.com>

3908

+

3909

+ Back-merged from trunk

3910

+ * config/i386/cygming-crtbegin.c (__gcc_register_frame):

3911

+ Increment load-count on use of LIBGCC_SONAME DLL.

3912

+ (hmod_libgcc): New static variable to hold handle of

3913

+ LIBGCC_SONAME DLL.

3914

+ (__gcc_deregister_frame): Decrement load-count of

3915

+ LIBGCC_SONAME DLL.

3916

+

3917

+2013-11-07 Uros Bizjak <ubizjak@gmail.com>

3918

+

3919

+ * config/i386/sfp-exceptions.c (__sfp_handle_exceptions): Handle

3920

+ FP_EX_DENORM. Store result to volatile location after SSE division

3921

+ to close interrupt window. Remove unneeded fwait after x87

3922

+ division since interrupt window will be closed by emitted fstp.

3923

+ Rewrite FP_EX_INEXACT handling.

3924

+

3925

2013-10-16 Release Manager

3926

3927

* GCC 4.8.2 released.

3928

@@ -151,7 +189,7 @@

3929

* config/mips/crtn.S (fini, init): New labels.

3930

3931

2012-02-19 Edgar E. Iglesias <edgar.iglesias@gmail.com>

3932

- * config/microblaze/modsi3.S (modsi3): Fix case with 0x80000000

3933

+ * config/microblaze/modsi3.S (modsi3): Fix case with 0x80000000

3934

as dividend.

3935

3936

2013-02-16 Alan Modra <amodra@gmail.com>

3937

Index: libgcc/config/i386/sfp-exceptions.c

3938

===================================================================

3939

--- a/src/libgcc/config/i386/sfp-exceptions.c (.../tags/gcc_4_8_2_release)

3940

+++ b/src/libgcc/config/i386/sfp-exceptions.c (.../branches/gcc-4_8-branch)

3941

@@ -47,21 +47,33 @@

3942

if (_fex & FP_EX_INVALID)

3943

{

3944

float f = 0.0f;

3945

-#ifdef __x86_64__

3946

+#ifdef __SSE_MATH__

3947

+ volatile float r __attribute__ ((unused));

3948

asm volatile ("%vdivss\t{%0, %d0|%d0, %0}" : "+x" (f));

3949

+ r = f; /* Needed to trigger exception. */

3950

#else

3951

asm volatile ("fdiv\t{%y0, %0|%0, %y0}" : "+t" (f));

3952

- asm volatile ("fwait");

3953

+ /* No need for fwait, exception is triggered by emitted fstp. */

3954

#endif

3955

}

3956

+ if (_fex & FP_EX_DENORM)

3957

+ {

3958

+ struct fenv temp;

3959

+ asm volatile ("fnstenv\t%0" : "=m" (temp));

3960

+ temp.__status_word |= FP_EX_DENORM;

3961

+ asm volatile ("fldenv\t%0" : : "m" (temp));

3962

+ asm volatile ("fwait");

3963

+ }

3964

if (_fex & FP_EX_DIVZERO)

3965

{

3966

float f = 1.0f, g = 0.0f;

3967

-#ifdef __x86_64__

3968

+#ifdef __SSE_MATH__

3969

+ volatile float r __attribute__ ((unused));

3970

asm volatile ("%vdivss\t{%1, %d0|%d0, %1}" : "+x" (f) : "xm" (g));

3971

+ r = f; /* Needed to trigger exception. */

3972

#else

3973

asm volatile ("fdivs\t%1" : "+t" (f) : "m" (g));

3974

- asm volatile ("fwait");

3975

+ /* No need for fwait, exception is triggered by emitted fstp. */

3976

#endif

3977

}

3978

if (_fex & FP_EX_OVERFLOW)

3979

@@ -82,11 +94,15 @@

3980

}

3981

if (_fex & FP_EX_INEXACT)

3982

{

3983

- struct fenv temp;

3984

- asm volatile ("fnstenv\t%0" : "=m" (temp));

3985

- temp.__status_word |= FP_EX_INEXACT;

3986

- asm volatile ("fldenv\t%0" : : "m" (temp));

3987

- asm volatile ("fwait");

3988

+ float f = 1.0f, g = 3.0f;

3989

+#ifdef __SSE_MATH__

3990

+ volatile float r __attribute__ ((unused));

3991

+ asm volatile ("%vdivss\t{%1, %d0|%d0, %1}" : "+x" (f) : "xm" (g));

3992

+ r = f; /* Needed to trigger exception. */

3993

+#else

3994

+ asm volatile ("fdivs\t%1" : "+t" (f) : "m" (g));

3995

+ /* No need for fwait, exception is triggered by emitted fstp. */

3996

+#endif

3997

}

3998

};

3999

#endif

4000

Index: libgcc/config/i386/cygming-crtbegin.c

4001

===================================================================

4002

--- a/src/libgcc/config/i386/cygming-crtbegin.c (.../tags/gcc_4_8_2_release)

4003

+++ b/src/libgcc/config/i386/cygming-crtbegin.c (.../branches/gcc-4_8-branch)

4004

@@ -69,6 +69,9 @@

4005

= { };

4006

4007

static struct object obj;

4008

+

4009

+/* Handle of libgcc's DLL reference. */

4010

+HANDLE hmod_libgcc;

4011

#endif

4012

4013

#if TARGET_USE_JCR_SECTION

4014

@@ -93,9 +96,14 @@

4015

4016

void (*register_frame_fn) (const void *, struct object *);

4017

HANDLE h = GetModuleHandle (LIBGCC_SONAME);

4018

+

4019

if (h)

4020

- register_frame_fn = (void (*) (const void *, struct object *))

4021

- GetProcAddress (h, "__register_frame_info");

4022

+ {

4023

+ /* Increasing the load-count of LIBGCC_SONAME DLL. */

4024

+ hmod_libgcc = LoadLibrary (LIBGCC_SONAME);

4025

+ register_frame_fn = (void (*) (const void *, struct object *))

4026

+ GetProcAddress (h, "__register_frame_info");

4027

+ }

4028

else

4029

register_frame_fn = __register_frame_info;

4030

if (register_frame_fn)

4031

@@ -132,5 +140,7 @@

4032

deregister_frame_fn = __deregister_frame_info;

4033

if (deregister_frame_fn)

4034

deregister_frame_fn (__EH_FRAME_BEGIN__);

4035

+ if (hmod_libgcc)

4036

+ FreeLibrary (hmod_libgcc);

4037

#endif

4038

}

4039

Index: libgcc/config/rs6000/ibm-ldouble.c

4040

===================================================================

4041

--- a/src/libgcc/config/rs6000/ibm-ldouble.c (.../tags/gcc_4_8_2_release)

4042

+++ b/src/libgcc/config/rs6000/ibm-ldouble.c (.../branches/gcc-4_8-branch)

4043

@@ -188,7 +188,16 @@

4044

|| nonfinite (t))

4045

return t;

4046

4047

- /* Finite nonzero result requires corrections to the highest order term. */

4048

+ /* Finite nonzero result requires corrections to the highest order

4049

+ term. These corrections require the low part of c * t to be

4050

+ exactly represented in double. */

4051

+ if (fabs (a) <= 0x1p-969)

4052

+ {

4053

+ a *= 0x1p106;

4054

+ b *= 0x1p106;

4055

+ c *= 0x1p106;

4056

+ d *= 0x1p106;

4057

+ }

4058

4059

s = c * t; /* (s,sigma) = c*t exactly. */

4060

w = -(-b + d * t); /* Written to get fnmsub for speed, but not

4061

Index: gcc/tree-vrp.c

4062

===================================================================

4063

--- a/src/gcc/tree-vrp.c (.../tags/gcc_4_8_2_release)

4064

+++ b/src/gcc/tree-vrp.c (.../branches/gcc-4_8-branch)

4065

@@ -5271,9 +5271,13 @@

4066

}

4067

else if (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (op_def)))

4068

{

4069

- /* Recurse through the type conversion. */

4070

- retval |= register_edge_assert_for_1 (gimple_assign_rhs1 (op_def),

4071

- code, e, bsi);

4072

+ /* Recurse through the type conversion, unless it is a narrowing

4073

+ conversion or conversion from non-integral type. */

4074

+ tree rhs = gimple_assign_rhs1 (op_def);

4075

+ if (INTEGRAL_TYPE_P (TREE_TYPE (rhs))

4076

+ && (TYPE_PRECISION (TREE_TYPE (rhs))

4077

+ <= TYPE_PRECISION (TREE_TYPE (op))))

4078

+ retval |= register_edge_assert_for_1 (rhs, code, e, bsi);

4079

}

4080

4081

return retval;

4082

@@ -7453,7 +7457,8 @@

4083

}

4084

else if ((operand_less_p (vr1min, *vr0max) == 1

4085

|| operand_equal_p (vr1min, *vr0max, 0))

4086

- && operand_less_p (*vr0min, vr1min) == 1)

4087

+ && operand_less_p (*vr0min, vr1min) == 1

4088

+ && operand_less_p (*vr0max, vr1max) == 1)

4089

{

4090

/* [ ( ] ) or [ ]( ) */

4091

if (*vr0type == VR_RANGE

4092

@@ -7487,7 +7492,8 @@

4093

}

4094

else if ((operand_less_p (*vr0min, vr1max) == 1

4095

|| operand_equal_p (*vr0min, vr1max, 0))

4096

- && operand_less_p (vr1min, *vr0min) == 1)

4097

+ && operand_less_p (vr1min, *vr0min) == 1

4098

+ && operand_less_p (vr1max, *vr0max) == 1)

4099

{

4100

/* ( [ ) ] or ( )[ ] */

4101

if (*vr0type == VR_RANGE

4102

Index: gcc/loop-unswitch.c

4103

===================================================================

4104

--- a/src/gcc/loop-unswitch.c (.../tags/gcc_4_8_2_release)

4105

+++ b/src/gcc/loop-unswitch.c (.../branches/gcc-4_8-branch)

4106

@@ -191,6 +191,7 @@

4107

if (!test)

4108

return NULL_RTX;

4109

4110

+ mode = VOIDmode;

4111

for (i = 0; i < 2; i++)

4112

{

4113

op[i] = XEXP (test, i);

4114

@@ -205,11 +206,15 @@

4115

return NULL_RTX;

4116

4117

op[i] = get_iv_value (&iv, const0_rtx);

4118

+ if (iv.extend != IV_UNKNOWN_EXTEND

4119

+ && iv.mode != iv.extend_mode)

4120

+ op[i] = lowpart_subreg (iv.mode, op[i], iv.extend_mode);

4121

+ if (mode == VOIDmode)

4122

+ mode = iv.mode;

4123

+ else

4124

+ gcc_assert (mode == iv.mode);

4125

}

4126

4127

- mode = GET_MODE (op[0]);

4128

- if (mode == VOIDmode)

4129

- mode = GET_MODE (op[1]);

4130

if (GET_MODE_CLASS (mode) == MODE_CC)

4131

{

4132

if (at != BB_END (bb))

4133

Index: gcc/tree-ssa-loop-im.c

4134

===================================================================

4135

--- a/src/gcc/tree-ssa-loop-im.c (.../tags/gcc_4_8_2_release)

4136

+++ b/src/gcc/tree-ssa-loop-im.c (.../branches/gcc-4_8-branch)

4137

@@ -1190,6 +1190,67 @@

4138

fini_walk_dominator_tree (&walk_data);

4139

}

4140

4141

+/* Return true if CODE is an operation that when operating on signed

4142

+ integer types involves undefined behavior on overflow and the

4143

+ operation can be expressed with unsigned arithmetic. */

4144

+

4145

+static bool

4146

+arith_code_with_undefined_signed_overflow (tree_code code)

4147

+{

4148

+ switch (code)

4149

+ {

4150

+ case PLUS_EXPR:

4151

+ case MINUS_EXPR:

4152

+ case MULT_EXPR:

4153

+ case NEGATE_EXPR:

4154

+ case POINTER_PLUS_EXPR:

4155

+ return true;

4156

+ default:

4157

+ return false;

4158

+ }

4159

+}

4160

+

4161

+/* Rewrite STMT, an assignment with a signed integer or pointer arithmetic

4162

+ operation that can be transformed to unsigned arithmetic by converting

4163

+ its operand, carrying out the operation in the corresponding unsigned

4164

+ type and converting the result back to the original type.

4165

+

4166

+ Returns a sequence of statements that replace STMT and also contain

4167

+ a modified form of STMT itself. */

4168

+

4169

+static gimple_seq

4170

+rewrite_to_defined_overflow (gimple stmt)

4171

+{

4172

+ if (dump_file && (dump_flags & TDF_DETAILS))

4173

+ {

4174

+ fprintf (dump_file, "rewriting stmt with undefined signed "

4175

+ "overflow ");

4176

+ print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);

4177

+ }

4178

+

4179

+ tree lhs = gimple_assign_lhs (stmt);

4180

+ tree type = unsigned_type_for (TREE_TYPE (lhs));

4181

+ gimple_seq stmts = NULL;

4182

+ for (unsigned i = 1; i < gimple_num_ops (stmt); ++i)

4183

+ {

4184

+ gimple_seq stmts2 = NULL;

4185

+ gimple_set_op (stmt, i,

4186

+ force_gimple_operand (fold_convert (type,

4187

+ gimple_op (stmt, i)),

4188

+ &stmts2, true, NULL_TREE));

4189

+ gimple_seq_add_seq (&stmts, stmts2);

4190

+ }

4191

+ gimple_assign_set_lhs (stmt, make_ssa_name (type, stmt));

4192

+ if (gimple_assign_rhs_code (stmt) == POINTER_PLUS_EXPR)

4193

+ gimple_assign_set_rhs_code (stmt, PLUS_EXPR);

4194

+ gimple_seq_add_stmt (&stmts, stmt);

4195

+ gimple cvt = gimple_build_assign_with_ops

4196

+ (NOP_EXPR, lhs, gimple_assign_lhs (stmt), NULL_TREE);

4197

+ gimple_seq_add_stmt (&stmts, cvt);

4198

+

4199

+ return stmts;

4200

+}

4201

+

4202

/* Hoist the statements in basic block BB out of the loops prescribed by

4203

data stored in LIM_DATA structures associated with each statement. Callback

4204

for walk_dominator_tree. */

4205

@@ -1321,7 +1382,21 @@

4206

}

4207

}

4208

gsi_remove (&bsi, false);

4209

- gsi_insert_on_edge (e, stmt);

4210

+ /* In case this is a stmt that is not unconditionally executed

4211

+ when the target loop header is executed and the stmt may

4212

+ invoke undefined integer or pointer overflow rewrite it to

4213

+ unsigned arithmetic. */

4214

+ if (is_gimple_assign (stmt)

4215

+ && INTEGRAL_TYPE_P (TREE_TYPE (gimple_assign_lhs (stmt)))

4216

+ && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (gimple_assign_lhs (stmt)))

4217

+ && arith_code_with_undefined_signed_overflow

4218

+ (gimple_assign_rhs_code (stmt))

4219

+ && (!ALWAYS_EXECUTED_IN (bb)

4220

+ || !(ALWAYS_EXECUTED_IN (bb) == level

4221

+ || flow_loop_nested_p (ALWAYS_EXECUTED_IN (bb), level))))

4222

+ gsi_insert_seq_on_edge (e, rewrite_to_defined_overflow (stmt));

4223

+ else

4224

+ gsi_insert_on_edge (e, stmt);

4225

}

4226

}

4227

4228

Index: gcc/tree-ssa-tail-merge.c

4229

===================================================================

4230

--- a/src/gcc/tree-ssa-tail-merge.c (.../tags/gcc_4_8_2_release)

4231

+++ b/src/gcc/tree-ssa-tail-merge.c (.../branches/gcc-4_8-branch)

4232

@@ -297,7 +297,8 @@

4233

tree val;

4234

def_operand_p def_p;

4235

4236

- if (gimple_has_side_effects (stmt))

4237

+ if (gimple_has_side_effects (stmt)

4238

+ || gimple_vdef (stmt) != NULL_TREE)

4239

return false;

4240

4241

def_p = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_DEF);

4242

Index: gcc/cgraphbuild.c

4243

===================================================================

4244

--- a/src/gcc/cgraphbuild.c (.../tags/gcc_4_8_2_release)

4245

+++ b/src/gcc/cgraphbuild.c (.../branches/gcc-4_8-branch)

4246

@@ -73,7 +73,7 @@

4247

decl = get_base_var (*tp);

4248

if (TREE_CODE (decl) == FUNCTION_DECL)

4249

{

4250

- struct cgraph_node *node = cgraph_get_create_node (decl);

4251

+ struct cgraph_node *node = cgraph_get_create_real_symbol_node (decl);

4252

if (!ctx->only_vars)

4253

cgraph_mark_address_taken_node (node);

4254

ipa_record_reference ((symtab_node)ctx->varpool_node,

4255

@@ -143,7 +143,7 @@

4256

{

4257

struct cgraph_node *per_node;

4258

4259

- per_node = cgraph_get_create_node (DECL_FUNCTION_PERSONALITY (node->symbol.decl));

4260

+ per_node = cgraph_get_create_real_symbol_node (DECL_FUNCTION_PERSONALITY (node->symbol.decl));

4261

ipa_record_reference ((symtab_node)node, (symtab_node)per_node, IPA_REF_ADDR, NULL);

4262

cgraph_mark_address_taken_node (per_node);

4263

}

4264

@@ -218,12 +218,12 @@

4265

/* Mark address taken in STMT. */

4266

4267

static bool

4268

-mark_address (gimple stmt, tree addr, void *data)

4269

+mark_address (gimple stmt, tree addr, tree, void *data)

4270

{

4271

addr = get_base_address (addr);

4272

if (TREE_CODE (addr) == FUNCTION_DECL)

4273

{

4274

- struct cgraph_node *node = cgraph_get_create_node (addr);

4275

+ struct cgraph_node *node = cgraph_get_create_real_symbol_node (addr);

4276

cgraph_mark_address_taken_node (node);

4277

ipa_record_reference ((symtab_node)data,

4278

(symtab_node)node,

4279

@@ -245,14 +245,14 @@

4280

/* Mark load of T. */

4281

4282

static bool

4283

-mark_load (gimple stmt, tree t, void *data)

4284

+mark_load (gimple stmt, tree t, tree, void *data)

4285

{

4286

t = get_base_address (t);

4287

if (t && TREE_CODE (t) == FUNCTION_DECL)

4288

{

4289

/* ??? This can happen on platforms with descriptors when these are

4290

directly manipulated in the code. Pretend that it's an address. */

4291

- struct cgraph_node *node = cgraph_get_create_node (t);

4292

+ struct cgraph_node *node = cgraph_get_create_real_symbol_node (t);

4293

cgraph_mark_address_taken_node (node);

4294

ipa_record_reference ((symtab_node)data,

4295

(symtab_node)node,

4296

@@ -273,7 +273,7 @@

4297

/* Mark store of T. */

4298

4299

static bool

4300

-mark_store (gimple stmt, tree t, void *data)

4301

+mark_store (gimple stmt, tree t, tree, void *data)

4302

{

4303

t = get_base_address (t);

4304

if (t && TREE_CODE (t) == VAR_DECL

4305

@@ -330,7 +330,7 @@

4306

{

4307

tree fn = gimple_omp_parallel_child_fn (stmt);

4308

ipa_record_reference ((symtab_node)node,

4309

- (symtab_node)cgraph_get_create_node (fn),

4310

+ (symtab_node)cgraph_get_create_real_symbol_node (fn),

4311

IPA_REF_ADDR, stmt);

4312

}

4313

if (gimple_code (stmt) == GIMPLE_OMP_TASK)

4314

@@ -338,12 +338,12 @@

4315

tree fn = gimple_omp_task_child_fn (stmt);

4316

if (fn)

4317

ipa_record_reference ((symtab_node)node,

4318

- (symtab_node) cgraph_get_create_node (fn),

4319

+ (symtab_node) cgraph_get_create_real_symbol_node (fn),

4320

IPA_REF_ADDR, stmt);

4321

fn = gimple_omp_task_copy_fn (stmt);

4322

if (fn)

4323

ipa_record_reference ((symtab_node)node,

4324

- (symtab_node)cgraph_get_create_node (fn),

4325

+ (symtab_node)cgraph_get_create_real_symbol_node (fn),

4326

IPA_REF_ADDR, stmt);

4327

}

4328

}

4329

Index: gcc/tree-ssa-loop-niter.c

4330

===================================================================

4331

--- a/src/gcc/tree-ssa-loop-niter.c (.../tags/gcc_4_8_2_release)

4332

+++ b/src/gcc/tree-ssa-loop-niter.c (.../branches/gcc-4_8-branch)

4333

@@ -2075,7 +2075,8 @@

4334

return NULL;

4335

}

4336

4337

- if (gimple_code (stmt) != GIMPLE_ASSIGN)

4338

+ if (gimple_code (stmt) != GIMPLE_ASSIGN

4339

+ || gimple_assign_rhs_class (stmt) == GIMPLE_TERNARY_RHS)

4340

return NULL;

4341

4342

code = gimple_assign_rhs_code (stmt);

4343

@@ -2143,7 +2144,7 @@

4344

{

4345

gimple stmt;

4346

4347

- gcc_assert (is_gimple_min_invariant (base));

4348

+ gcc_checking_assert (is_gimple_min_invariant (base));

4349

4350

if (!x)

4351

return base;

4352

@@ -2152,7 +2153,7 @@

4353

if (gimple_code (stmt) == GIMPLE_PHI)

4354

return base;

4355

4356

- gcc_assert (is_gimple_assign (stmt));

4357

+ gcc_checking_assert (is_gimple_assign (stmt));

4358

4359

/* STMT must be either an assignment of a single SSA name or an

4360

expression involving an SSA name and a constant. Try to fold that

4361

Index: gcc/c-family/ChangeLog

4362

===================================================================

4363

--- a/src/gcc/c-family/ChangeLog (.../tags/gcc_4_8_2_release)

4364

+++ b/src/gcc/c-family/ChangeLog (.../branches/gcc-4_8-branch)

4365

@@ -1,3 +1,18 @@

4366

+2013-11-29 Jakub Jelinek <jakub@redhat.com>

4367

+

4368

+ PR c/59280

4369

+ * c-common.c (get_priority): If TREE_VALUE (args) is IDENTIFIER_NODE,

4370

+ goto invalid. If it is error_mark_node, don't issue further

4371

+ diagnostics.

4372

+

4373

+2013-11-04 Marek Polacek <polacek@redhat.com>

4374

+

4375

+ Backport from mainline

4376

+ 2013-11-04 Marek Polacek <polacek@redhat.com>

4377

+

4378

+ PR c++/58979

4379

+ * c-common.c (invalid_indirection_error): Handle RO_ARROW_STAR case.

4380

+

4381

2013-10-16 Release Manager

4382

4383

* GCC 4.8.2 released.

4384

Index: gcc/c-family/c-common.c

4385

===================================================================

4386

--- a/src/gcc/c-family/c-common.c (.../tags/gcc_4_8_2_release)

4387

+++ b/src/gcc/c-family/c-common.c (.../branches/gcc-4_8-branch)

4388

@@ -6917,6 +6917,10 @@

4389

}

4390

4391

arg = TREE_VALUE (args);

4392

+ if (TREE_CODE (arg) == IDENTIFIER_NODE)

4393

+ goto invalid;

4394

+ if (arg == error_mark_node)

4395

+ return DEFAULT_INIT_PRIORITY;

4396

arg = default_conversion (arg);

4397

if (!host_integerp (arg, /*pos=*/0)

4398

|| !INTEGRAL_TYPE_P (TREE_TYPE (arg)))

4399

@@ -9763,6 +9767,11 @@

4400

"invalid type argument of %<->%> (have %qT)",

4401

type);

4402

break;

4403

+ case RO_ARROW_STAR:

4404

+ error_at (loc,

4405

+ "invalid type argument of %<->*%> (have %qT)",

4406

+ type);

4407

+ break;

4408

case RO_IMPLICIT_CONVERSION:

4409

error_at (loc,

4410

"invalid type argument of implicit conversion (have %qT)",

4411

Index: gcc/c/c-typeck.c

4412

===================================================================

4413

--- a/src/gcc/c/c-typeck.c (.../tags/gcc_4_8_2_release)

4414

+++ b/src/gcc/c/c-typeck.c (.../branches/gcc-4_8-branch)

4415

@@ -3629,7 +3629,8 @@

4416

/* Report invalid types. */

4417

4418

if (typecode != POINTER_TYPE && typecode != FIXED_POINT_TYPE

4419

- && typecode != INTEGER_TYPE && typecode != REAL_TYPE)

4420

+ && typecode != INTEGER_TYPE && typecode != REAL_TYPE

4421

+ && typecode != VECTOR_TYPE)

4422

{

4423

if (code == PREINCREMENT_EXPR || code == POSTINCREMENT_EXPR)

4424

error_at (location, "wrong type argument to increment");

4425

@@ -3694,7 +3695,9 @@

4426

}

4427

else

4428

{

4429

- inc = integer_one_node;

4430

+ inc = (TREE_CODE (argtype) == VECTOR_TYPE

4431

+ ? build_one_cst (argtype)

4432

+ : integer_one_node);

4433

inc = convert (argtype, inc);

4434

}

4435

4436

Index: gcc/c/ChangeLog

4437

===================================================================

4438

--- a/src/gcc/c/ChangeLog (.../tags/gcc_4_8_2_release)

4439

+++ b/src/gcc/c/ChangeLog (.../branches/gcc-4_8-branch)

4440

@@ -1,3 +1,18 @@

4441

+2013-12-03 Marek Polacek <polacek@redhat.com>

4442

+

4443

+ Backport from mainline

4444

+ 2013-12-03 Marek Polacek <polacek@redhat.com>

4445

+

4446

+ PR c/59351

4447

+ * c-decl.c (build_compound_literal): Allow compound literals with

4448

+ empty initial value.

4449

+

4450

+2013-11-27 Tom de Vries <tom@codesourcery.com>

4451

+ Marc Glisse <marc.glisse@inria.fr>

4452

+

4453

+ PR c++/59032

4454

+ * c-typeck.c (build_unary_op): Allow vector increment and decrement.

4455

+

4456

2013-10-16 Release Manager

4457

4458

* GCC 4.8.2 released.

4459

Index: gcc/c/c-decl.c

4460

===================================================================

4461

--- a/src/gcc/c/c-decl.c (.../tags/gcc_4_8_2_release)

4462

+++ b/src/gcc/c/c-decl.c (.../branches/gcc-4_8-branch)

4463

@@ -4632,7 +4632,9 @@

4464

{

4465

int failure = complete_array_type (&TREE_TYPE (decl),

4466

DECL_INITIAL (decl), true);

4467

- gcc_assert (!failure);

4468

+ /* If complete_array_type returns 3, it means that the

4469

+ initial value of the compound literal is empty. Allow it. */

4470

+ gcc_assert (failure == 0 || failure == 3);

4471

4472

type = TREE_TYPE (decl);

4473

TREE_TYPE (DECL_INITIAL (decl)) = type;

4474

Index: gcc/cgraph.c

4475

===================================================================

4476

--- a/src/gcc/cgraph.c (.../tags/gcc_4_8_2_release)

4477

+++ b/src/gcc/cgraph.c (.../branches/gcc-4_8-branch)

4478

@@ -2596,4 +2596,47 @@

4479

FOR_EACH_FUNCTION (node)

4480

verify_cgraph_node (node);

4481

}

4482

+

4483

+/* Create external decl node for DECL.

4484

+ The difference i nbetween cgraph_get_create_node and

4485

+ cgraph_get_create_real_symbol_node is that cgraph_get_create_node

4486

+ may return inline clone, while cgraph_get_create_real_symbol_node

4487

+ will create a new node in this case.

4488

+ FIXME: This function should be removed once clones are put out of decl

4489

+ hash. */

4490

+

4491

+struct cgraph_node *

4492

+cgraph_get_create_real_symbol_node (tree decl)

4493

+{

4494

+ struct cgraph_node *first_clone = cgraph_get_node (decl);

4495

+ struct cgraph_node *node;

4496

+ /* create symbol table node. even if inline clone exists, we can not take

4497

+ it as a target of non-inlined call. */

4498

+ node = cgraph_get_node (decl);

4499

+ if (node && !node->global.inlined_to)

4500

+ return node;

4501

+

4502

+ node = cgraph_create_node (decl);

4503

+

4504

+ /* ok, we previously inlined the function, then removed the offline copy and

4505

+ now we want it back for external call. this can happen when devirtualizing

4506

+ while inlining function called once that happens after extern inlined and

4507

+ virtuals are already removed. in this case introduce the external node

4508

+ and make it available for call. */

4509

+ if (first_clone)

4510

+ {

4511

+ first_clone->clone_of = node;

4512

+ node->clones = first_clone;

4513

+ symtab_prevail_in_asm_name_hash ((symtab_node) node);

4514

+ symtab_insert_node_to_hashtable ((symtab_node) node);

4515

+ if (dump_file)

4516

+ fprintf (dump_file, "Introduced new external node "

4517

+ "(%s/%i) and turned into root of the clone tree.\n",

4518

+ xstrdup (cgraph_node_name (node)), node->uid);

4519

+ }

4520

+ else if (dump_file)

4521

+ fprintf (dump_file, "Introduced new external node "

4522

+ "(%s/%i).\n", xstrdup (cgraph_node_name (node)), node->uid);

4523

+ return node;

4524

+}

4525

#include "gt-cgraph.h"

4526

Index: gcc/cgraph.h

4527

===================================================================

4528

--- a/src/gcc/cgraph.h (.../tags/gcc_4_8_2_release)

4529

+++ b/src/gcc/cgraph.h (.../branches/gcc-4_8-branch)

4530

@@ -575,6 +575,7 @@

4531

struct cgraph_node * cgraph_create_node (tree);

4532

struct cgraph_node * cgraph_create_empty_node (void);

4533

struct cgraph_node * cgraph_get_create_node (tree);

4534

+struct cgraph_node * cgraph_get_create_real_symbol_node (tree);

4535

struct cgraph_node * cgraph_same_body_alias (struct cgraph_node *, tree, tree);

4536

struct cgraph_node * cgraph_add_thunk (struct cgraph_node *, tree, tree, bool, HOST_WIDE_INT,

4537

HOST_WIDE_INT, tree, tree);

4538

Index: gcc/optabs.c

4539

===================================================================

4540

--- a/src/gcc/optabs.c (.../tags/gcc_4_8_2_release)

4541

+++ b/src/gcc/optabs.c (.../branches/gcc-4_8-branch)

4542

@@ -4558,8 +4558,11 @@

4543

if (!COMPARISON_P (comparison))

4544

return NULL_RTX;

4545

4546

+ /* State variables we need to save and restore if cmove can't be used. */

4547

+ int save_pending_stack_adjust = pending_stack_adjust;

4548

+ int save_stack_pointer_delta = stack_pointer_delta;

4549

+ last = get_last_insn ();

4550

do_pending_stack_adjust ();

4551

- last = get_last_insn ();

4552

prepare_cmp_insn (XEXP (comparison, 0), XEXP (comparison, 1),

4553

GET_CODE (comparison), NULL_RTX, unsignedp, OPTAB_WIDEN,

4554

&comparison, &cmode);

4555

@@ -4579,6 +4582,8 @@

4556

}

4557

}

4558

delete_insns_since (last);

4559

+ pending_stack_adjust = save_pending_stack_adjust;

4560

+ stack_pointer_delta = save_stack_pointer_delta;

4561

return NULL_RTX;

4562

}

4563

4564

@@ -6233,7 +6238,7 @@

4565

4566

/* If the optabs changed, record it. */

4567

if (memcmp (tmp_optabs, this_target_optabs, sizeof (struct target_optabs)))

4568

- TREE_OPTIMIZATION_OPTABS (optnode) = (unsigned char *) tmp_optabs;

4569

+ TREE_OPTIMIZATION_OPTABS (optnode) = tmp_optabs;

4570

else

4571

{

4572

TREE_OPTIMIZATION_OPTABS (optnode) = NULL;

4573

@@ -7035,8 +7040,7 @@

4574

4575

create_output_operand (&ops[0], target, mode);

4576

create_fixed_operand (&ops[1], mem);

4577

- /* VAL may have been promoted to a wider mode. Shrink it if so. */

4578

- create_convert_operand_to (&ops[2], val, mode, true);

4579

+ create_input_operand (&ops[2], val, mode);

4580

create_integer_operand (&ops[3], model);

4581

if (maybe_expand_insn (icode, 4, ops))

4582

return ops[0].value;

4583

@@ -7075,8 +7079,7 @@

4584

struct expand_operand ops[3];

4585

create_output_operand (&ops[0], target, mode);

4586

create_fixed_operand (&ops[1], mem);

4587

- /* VAL may have been promoted to a wider mode. Shrink it if so. */

4588

- create_convert_operand_to (&ops[2], val, mode, true);

4589

+ create_input_operand (&ops[2], val, mode);

4590

if (maybe_expand_insn (icode, 3, ops))

4591

return ops[0].value;

4592

}

4593

@@ -7118,8 +7121,6 @@

4594

{

4595

if (!target || !register_operand (target, mode))

4596

target = gen_reg_rtx (mode);

4597

- if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)

4598

- val = convert_modes (mode, GET_MODE (val), val, 1);

4599

if (expand_compare_and_swap_loop (mem, target, val, NULL_RTX))

4600

return target;

4601

}

4602

@@ -7331,8 +7332,8 @@

4603

create_output_operand (&ops[0], target_bool, bool_mode);

4604

create_output_operand (&ops[1], target_oval, mode);

4605

create_fixed_operand (&ops[2], mem);

4606

- create_convert_operand_to (&ops[3], expected, mode, true);

4607

- create_convert_operand_to (&ops[4], desired, mode, true);

4608

+ create_input_operand (&ops[3], expected, mode);

4609

+ create_input_operand (&ops[4], desired, mode);

4610

create_integer_operand (&ops[5], is_weak);

4611

create_integer_operand (&ops[6], succ_model);

4612

create_integer_operand (&ops[7], fail_model);

4613

@@ -7353,8 +7354,8 @@

4614

4615

create_output_operand (&ops[0], target_oval, mode);

4616

create_fixed_operand (&ops[1], mem);

4617

- create_convert_operand_to (&ops[2], expected, mode, true);

4618

- create_convert_operand_to (&ops[3], desired, mode, true);

4619

+ create_input_operand (&ops[2], expected, mode);

4620

+ create_input_operand (&ops[3], desired, mode);

4621

if (!maybe_expand_insn (icode, 4, ops))

4622

return false;

4623

4624

Index: gcc/DATESTAMP

4625

===================================================================

4626

--- a/src/gcc/DATESTAMP (.../tags/gcc_4_8_2_release)

4627

+++ b/src/gcc/DATESTAMP (.../branches/gcc-4_8-branch)

4628

@@ -1 +1 @@

4629

-20131016

4630

+20140112

4631

Index: gcc/value-prof.c

4632

===================================================================

4633

--- a/src/gcc/value-prof.c (.../tags/gcc_4_8_2_release)

4634

+++ b/src/gcc/value-prof.c (.../branches/gcc-4_8-branch)

4635

@@ -1270,8 +1270,7 @@

4636

4637

/* Build an EH edge for the direct call if necessary. */

4638

lp_nr = lookup_stmt_eh_lp (icall_stmt);

4639

- if (lp_nr != 0

4640

- && stmt_could_throw_p (dcall_stmt))

4641

+ if (lp_nr > 0 && stmt_could_throw_p (dcall_stmt))

4642

{

4643

edge e_eh, e;

4644

edge_iterator ei;

4645

Index: gcc/tree.h

4646

===================================================================

4647

--- a/src/gcc/tree.h (.../tags/gcc_4_8_2_release)

4648

+++ b/src/gcc/tree.h (.../branches/gcc-4_8-branch)

4649

@@ -3589,7 +3589,7 @@

4650

4651

/* Target optabs for this set of optimization options. This is of

4652

type `struct target_optabs *'. */

4653

- unsigned char *GTY ((atomic)) optabs;

4654

+ void *GTY ((atomic)) optabs;

4655

4656

/* The value of this_target_optabs against which the optabs above were

4657

generated. */

4658

Index: gcc/configure

4659

===================================================================

4660

--- a/src/gcc/configure (.../tags/gcc_4_8_2_release)

4661

+++ b/src/gcc/configure (.../branches/gcc-4_8-branch)

4662

@@ -11202,13 +11202,11 @@

4663

/* | A-Za-z:\\/* ) realsrcdir=${srcdir};;

4664

*) realsrcdir=../${srcdir};;

4665

esac

4666

- saved_CFLAGS="${CFLAGS}"

4667

CC="${CC_FOR_BUILD}" CFLAGS="${CFLAGS_FOR_BUILD}" \

4668

- LDFLAGS="${LDFLAGS_FOR_BUILD}" \

4669

+ LDFLAGS="${LDFLAGS_FOR_BUILD}" GMPINC="" \

4670

${realsrcdir}/configure \

4671

--enable-languages=${enable_languages-all} \

4672

--target=$target_alias --host=$build_alias --build=$build_alias

4673

- CFLAGS="${saved_CFLAGS}"

4674

4675

# We just finished tests for the build machine, so rename

4676

# the file auto-build.h in the gcc directory.

4677

@@ -11703,6 +11701,7 @@

4678

if test x$build != x$host || test "x$coverage_flags" != x

4679

then

4680

BUILD_CFLAGS='$(INTERNAL_CFLAGS) $(T_CFLAGS) $(CFLAGS_FOR_BUILD)'

4681

+ BUILD_CXXFLAGS='$(INTERNAL_CFLAGS) $(T_CFLAGS) $(CXXFLAGS_FOR_BUILD)'

4682

BUILD_LDFLAGS='$(LDFLAGS_FOR_BUILD)'

4683

fi

4684

4685

@@ -17828,7 +17827,7 @@

4686

lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2

4687

lt_status=$lt_dlunknown

4688

cat > conftest.$ac_ext <<_LT_EOF

4689

-#line 17831 "configure"

4690

+#line 17830 "configure"

4691

#include "confdefs.h"

4692

4693

#if HAVE_DLFCN_H

4694

@@ -17934,7 +17933,7 @@

4695

lt_dlunknown=0; lt_dlno_uscore=1; lt_dlneed_uscore=2

4696

lt_status=$lt_dlunknown

4697

cat > conftest.$ac_ext <<_LT_EOF

4698

-#line 17937 "configure"

4699

+#line 17936 "configure"

4700

#include "confdefs.h"

4701

4702

#if HAVE_DLFCN_H

4703

@@ -24263,6 +24262,43 @@

4704

$as_echo "#define HAVE_AS_SPARC4 1" >>confdefs.h

4705

4706

fi

4707

+

4708

+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking assembler for LEON instructions" >&5

4709

+$as_echo_n "checking assembler for LEON instructions... " >&6; }

4710

+if test "${gcc_cv_as_sparc_leon+set}" = set; then :

4711

+ $as_echo_n "(cached) " >&6

4712

+else

4713

+ gcc_cv_as_sparc_leon=no

4714

+ if test x$gcc_cv_as != x; then

4715

+ $as_echo '.text

4716

+ .register %g2, #scratch

4717

+ .register %g3, #scratch

4718

+ .align 4

4719

+ smac %g2, %g3, %g1

4720

+ umac %g2, %g3, %g1

4721

+ cas [%g2], %g3, %g1' > conftest.s

4722

+ if { ac_try='$gcc_cv_as $gcc_cv_as_flags -Aleon -o conftest.o conftest.s >&5'

4723

+ { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_try\""; } >&5

4724

+ (eval $ac_try) 2>&5

4725

+ ac_status=$?

4726

+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5

4727

+ test $ac_status = 0; }; }

4728

+ then

4729

+ gcc_cv_as_sparc_leon=yes

4730

+ else

4731

+ echo "configure: failed program was" >&5

4732

+ cat conftest.s >&5

4733

+ fi

4734

+ rm -f conftest.o conftest.s

4735

+ fi

4736

+fi

4737

+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $gcc_cv_as_sparc_leon" >&5

4738

+$as_echo "$gcc_cv_as_sparc_leon" >&6; }

4739

+if test $gcc_cv_as_sparc_leon = yes; then

4740

+

4741

+$as_echo "#define HAVE_AS_LEON 1" >>confdefs.h

4742

+

4743

+fi

4744

;;

4745

4746

i[34567]86-*-* | x86_64-*-*)

4747

@@ -27239,8 +27275,8 @@

4748

$as_echo_n "checking for exported symbols... " >&6; }

4749

if test "x$export_sym_check" != x; then

4750

echo "int main() {return 0;} int foobar() {return 0;}" > conftest.c

4751

- ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest > /dev/null 2>&1

4752

- if $export_sym_check conftest | grep foobar > /dev/null; then

4753

+ ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest$ac_exeext > /dev/null 2>&1

4754

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

4755

: # No need to use a flag

4756

{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5

4757

$as_echo "yes" >&6; }

4758

@@ -27249,8 +27285,8 @@

4759

$as_echo "yes" >&6; }

4760

{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for -rdynamic" >&5

4761

$as_echo_n "checking for -rdynamic... " >&6; }

4762

- ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest > /dev/null 2>&1

4763

- if $export_sym_check conftest | grep foobar > /dev/null; then

4764

+ ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest$ac_exeext > /dev/null 2>&1

4765

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

4766

plugin_rdynamic=yes

4767

pluginlibs="-rdynamic"

4768

else

4769

Index: gcc/builtins.c

4770

===================================================================

4771

--- a/src/gcc/builtins.c (.../tags/gcc_4_8_2_release)

4772

+++ b/src/gcc/builtins.c (.../branches/gcc-4_8-branch)

4773

@@ -1958,6 +1958,7 @@

4774

tree fndecl = get_callee_fndecl (exp);

4775

enum machine_mode mode;

4776

bool errno_set = false;

4777

+ bool try_widening = false;

4778

tree arg;

4779

4780

if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))

4781

@@ -1969,6 +1970,7 @@

4782

{

4783

CASE_FLT_FN (BUILT_IN_SQRT):

4784

errno_set = ! tree_expr_nonnegative_p (arg);

4785

+ try_widening = true;

4786

builtin_optab = sqrt_optab;

4787

break;

4788

CASE_FLT_FN (BUILT_IN_EXP):

4789

@@ -2025,8 +2027,10 @@

4790

if (! flag_errno_math || ! HONOR_NANS (mode))

4791

errno_set = false;

4792

4793

- /* Before working hard, check whether the instruction is available. */

4794

- if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing

4795

+ /* Before working hard, check whether the instruction is available, but try

4796

+ to widen the mode for specific operations. */

4797

+ if ((optab_handler (builtin_optab, mode) != CODE_FOR_nothing

4798

+ || (try_widening && !excess_precision_type (TREE_TYPE (exp))))

4799

&& (!errno_set || !optimize_insn_for_size_p ()))

4800

{

4801

rtx result = gen_reg_rtx (mode);

4802

Index: gcc/fold-const.c

4803

===================================================================

4804

--- a/src/gcc/fold-const.c (.../tags/gcc_4_8_2_release)

4805

+++ b/src/gcc/fold-const.c (.../branches/gcc-4_8-branch)

4806

@@ -2664,10 +2664,11 @@

4807

case COMPONENT_REF:

4808

/* Handle operand 2 the same as for ARRAY_REF. Operand 0

4809

may be NULL when we're called to compare MEM_EXPRs. */

4810

- if (!OP_SAME_WITH_NULL (0))

4811

+ if (!OP_SAME_WITH_NULL (0)

4812

+ || !OP_SAME (1))

4813

return 0;

4814

flags &= ~OEP_CONSTANT_ADDRESS_OF;

4815

- return OP_SAME (1) && OP_SAME_WITH_NULL (2);

4816

+ return OP_SAME_WITH_NULL (2);

4817

4818

case BIT_FIELD_REF:

4819

if (!OP_SAME (0))

4820

@@ -10927,6 +10928,13 @@

4821

fold_build2_loc (loc, MULT_EXPR, type,

4822

build_int_cst (type, 2) , arg1));

4823

4824

+ /* ((T) (X /[ex] C)) * C cancels out if the conversion is

4825

+ sign-changing only. */

4826

+ if (TREE_CODE (arg1) == INTEGER_CST

4827

+ && TREE_CODE (arg0) == EXACT_DIV_EXPR

4828

+ && operand_equal_p (arg1, TREE_OPERAND (arg0, 1), 0))

4829

+ return fold_convert_loc (loc, type, TREE_OPERAND (arg0, 0));

4830

+

4831

strict_overflow_p = false;

4832

if (TREE_CODE (arg1) == INTEGER_CST

4833

&& 0 != (tem = extract_muldiv (op0, arg1, code, NULL_TREE,

4834

@@ -16587,7 +16595,7 @@

4835

unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;

4836

tree index = bitsize_int (indexi);

4837

4838

- if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))

4839

+ if (offset / part_widthi < TYPE_VECTOR_SUBPARTS (op00type))

4840

return fold_build3_loc (loc,

4841

BIT_FIELD_REF, type, op00,

4842

part_width, index);

4843

Index: gcc/reorg.c

4844

===================================================================

4845

--- a/src/gcc/reorg.c (.../tags/gcc_4_8_2_release)

4846

+++ b/src/gcc/reorg.c (.../branches/gcc-4_8-branch)

4847

@@ -1105,6 +1105,7 @@

4848

int used_annul = 0;

4849

int i;

4850

struct resources cc_set;

4851

+ bool *redundant;

4852

4853

/* We can't do anything if there are more delay slots in SEQ than we

4854

can handle, or if we don't know that it will be a taken branch.

4855

@@ -1145,6 +1146,7 @@

4856

return delay_list;

4857

#endif

4858

4859

+ redundant = XALLOCAVEC (bool, XVECLEN (seq, 0));

4860

for (i = 1; i < XVECLEN (seq, 0); i++)

4861

{

4862

rtx trial = XVECEXP (seq, 0, i);

4863

@@ -1166,7 +1168,8 @@

4864

4865

/* If this insn was already done (usually in a previous delay slot),

4866

pretend we put it in our delay slot. */

4867

- if (redundant_insn (trial, insn, new_delay_list))

4868

+ redundant[i] = redundant_insn (trial, insn, new_delay_list);

4869

+ if (redundant[i])

4870

continue;

4871

4872

/* We will end up re-vectoring this branch, so compute flags

4873

@@ -1199,6 +1202,12 @@

4874

return delay_list;

4875

}

4876

4877

+ /* Record the effect of the instructions that were redundant and which

4878

+ we therefore decided not to copy. */

4879

+ for (i = 1; i < XVECLEN (seq, 0); i++)

4880

+ if (redundant[i])

4881

+ update_block (XVECEXP (seq, 0, i), insn);

4882

+

4883

/* Show the place to which we will be branching. */

4884

*pnew_thread = first_active_target_insn (JUMP_LABEL (XVECEXP (seq, 0, 0)));

4885

4886

@@ -1262,6 +1271,7 @@

4887

/* If this insn was already done, we don't need it. */

4888

if (redundant_insn (trial, insn, delay_list))

4889

{

4890

+ update_block (trial, insn);

4891

delete_from_delay_slot (trial);

4892

continue;

4893

}

4894

@@ -3266,6 +3276,7 @@

4895

to reprocess this insn. */

4896

if (redundant_insn (XVECEXP (pat, 0, 1), delay_insn, 0))

4897

{

4898

+ update_block (XVECEXP (pat, 0, 1), insn);

4899

delete_from_delay_slot (XVECEXP (pat, 0, 1));

4900

next = prev_active_insn (next);

4901

continue;

4902

@@ -3385,6 +3396,7 @@

4903

&& redirect_with_delay_slots_safe_p (delay_insn, target_label,

4904

insn))

4905

{

4906

+ update_block (XVECEXP (PATTERN (trial), 0, 1), insn);

4907

reorg_redirect_jump (delay_insn, target_label);

4908

next = insn;

4909

continue;

4910

Index: gcc/tree-ssa-sccvn.c

4911

===================================================================

4912

--- a/src/gcc/tree-ssa-sccvn.c (.../tags/gcc_4_8_2_release)

4913

+++ b/src/gcc/tree-ssa-sccvn.c (.../branches/gcc-4_8-branch)

4914

@@ -660,7 +660,7 @@

4915

}

4916

4917

/* For non-calls, store the information that makes up the address. */

4918

-

4919

+ tree orig = ref;

4920

while (ref)

4921

{

4922

vn_reference_op_s temp;

4923

@@ -711,7 +711,15 @@

4924

.arshift (BITS_PER_UNIT == 8

4925

? 3 : exact_log2 (BITS_PER_UNIT),

4926

HOST_BITS_PER_DOUBLE_INT);

4927

- if (off.fits_shwi ())

4928

+ if (off.fits_shwi ()

4929

+ /* Probibit value-numbering zero offset components

4930

+ of addresses the same before the pass folding

4931

+ __builtin_object_size had a chance to run

4932

+ (checking cfun->after_inlining does the

4933

+ trick here). */

4934

+ && (TREE_CODE (orig) != ADDR_EXPR

4935

+ || !off.is_zero ()

4936

+ || cfun->after_inlining))

4937

temp.off = off.low;

4938

}

4939

}

4940

Index: gcc/ChangeLog

4941

===================================================================

4942

--- a/src/gcc/ChangeLog (.../tags/gcc_4_8_2_release)

4943

+++ b/src/gcc/ChangeLog (.../branches/gcc-4_8-branch)

4944

@@ -1,3 +1,1030 @@

4945

+2014-01-10 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

4946

+

4947

+ * config/s390/s390.c (s390_expand_tbegin): Remove jump over CC

4948

+ extraction in good case.

4949

+

4950

+2014-01-10 Huacai Chen <chenhc@lemote.com>

4951

+

4952

+ * config/mips/driver-native.c (host_detect_local_cpu): Handle new

4953

+ kernel strings for Loongson-2E/2F/3A.

4954

+

4955

+2014-01-10 Richard Biener <rguenther@suse.de>

4956

+

4957

+ PR tree-optimization/59715

4958

+ * tree-flow.h (split_critical_edges): Declare.

4959

+ * tree-cfg.c (split_critical_edges): Export.

4960

+ * tree-ssa-sink.c (execute_sink_code): Split critical edges.

4961

+

4962

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

4963

+

4964

+ * config/mips/mips.h (ISA_HAS_WSBH): Define.

4965

+ * config/mips/mips.md (UNSPEC_WSBH, UNSPEC_DSBH, UNSPEC_DSHD): New

4966

+ constants.

4967

+ (bswaphi2, bswapsi2, bswapdi2, wsbh, dsbh, dshd): New patterns.

4968

+

4969

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

4970

+

4971

+ PR rtl-optimization/59137

4972

+ * reorg.c (steal_delay_list_from_target): Call update_block for

4973

+ elided insns.

4974

+ (steal_delay_list_from_fallthrough, relax_delay_slots): Likewise.

4975

+

4976

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

4977

+

4978

+ Revert:

4979

+ 2012-10-07 Richard Sandiford <rdsandiford@googlemail.com>

4980

+

4981

+ * config/mips/mips.c (mips_truncated_op_cost): New function.

4982

+ (mips_rtx_costs): Adjust test for BADDU.

4983

+ * config/mips/mips.md (*baddu_di<mode>): Push truncates to operands.

4984

+

4985

+ 2012-10-02 Richard Sandiford <rdsandiford@googlemail.com>

4986

+

4987

+ * config/mips/mips.md (*baddu_si_eb, *baddu_si_el): Merge into...

4988

+ (*baddu_si): ...this new pattern.

4989

+

4990

+2014-01-09 Richard Biener <rguenther@suse.de>

4991

+

4992

+ Backport from mainline

4993

+ 2013-11-18 Richard Biener <rguenther@suse.de>

4994

+

4995

+ PR tree-optimization/59125

4996

+ PR tree-optimization/54570

4997

+ * tree-ssa-sccvn.c (copy_reference_ops_from_ref): When inlining

4998

+ is not complete do not treat component-references with offset zero

4999

+ but different fields as equal.

5000

+ * tree-object-size.c: Include tree-phinodes.h and ssa-iterators.h.

5001

+ (compute_object_sizes): Apply TLC. Propagate the constant

5002

+ results into all uses and fold their stmts.

5003

+ * passes.def (pass_all_optimizations): Move pass_object_sizes

5004

+ after the first pass_forwprop and before pass_fre.

5005

+

5006

+ 2013-12-03 Jakub Jelinek <jakub@redhat.com>

5007

+

5008

+ PR tree-optimization/59362

5009

+ * tree-object-size.c (object_sizes): Change into array of

5010

+ vec<unsigned HOST_WIDE_INT>.

5011

+ (compute_builtin_object_size): Check computed bitmap for

5012

+ non-NULL instead of object_sizes. Call safe_grow on object_sizes

5013

+ vector if new SSA_NAMEs appeared.

5014

+ (init_object_sizes): Check computed bitmap for non-NULL.

5015

+ Call safe_grow on object_sizes elements instead of initializing

5016

+ it with XNEWVEC.

5017

+ (fini_object_sizes): Call release on object_sizes elements, don't

5018

+ set it to NULL.

5019

+

5020

+2014-01-09 Richard Earnshaw <rearnsha@arm.com>

5021

+

5022

+ PR rtl-optimization/54300

5023

+ * regcprop.c (copyprop_hardreg_forward_1): Ensure any unused

5024

+ outputs in a single-set are killed from the value chains.

5025

+

5026

+2014-01-09 Jakub Jelinek <jakub@redhat.com>

5027

+

5028

+ PR rtl-optimization/59724

5029

+ * ifcvt.c (cond_exec_process_if_block): Don't call

5030

+ flow_find_head_matching_sequence with 0 longest_match.

5031

+ * cfgcleanup.c (flow_find_head_matching_sequence): Count even

5032

+ non-active insns if !stop_after.

5033

+ (try_head_merge_bb): Revert 2014-01-07 changes.

5034

+

5035

+2014-01-09 Hans-Peter Nilsson <hp@axis.com>

5036

+

5037

+ Backport from mainline

5038

+ 2013-12-23 Hans-Peter Nilsson <hp@axis.com>

5039

+

5040

+ PR middle-end/59584

5041

+ * config/cris/predicates.md (cris_nonsp_register_operand):

5042

+ New define_predicate.

5043

+ * config/cris/cris.md: Replace register_operand with

5044

+ cris_nonsp_register_operand for destinations in all

5045

+ define_splits where a register is set more than once.

5046

+

5047

+2014-01-08 H.J. Lu <hongjiu.lu@intel.com>

5048

+

5049

+ Backport from mainline

5050

+ 2013-12-25 H.J. Lu <hongjiu.lu@intel.com>

5051

+

5052

+ PR target/59587

5053

+ * config/i386/i386.c (struct ptt): Add a field for processor

5054

+ name.

5055

+ (processor_target_table): Sync with processor_type. Add

5056

+ processor names.

5057

+ (cpu_names): Removed.

5058

+ (ix86_option_override_internal): Default x_ix86_tune_string

5059

+ to processor_target_table[TARGET_CPU_DEFAULT].name.

5060

+ (ix86_function_specific_print): Assert arch and tune <

5061

+ PROCESSOR_max. Use processor_target_table to print arch and

5062

+ tune names.

5063

+ * config/i386/i386.h (TARGET_CPU_DEFAULT): Default to

5064

+ PROCESSOR_GENERIC32.

5065

+ (target_cpu_default): Removed.

5066

+ (processor_type): Reordered.

5067

+

5068

+2014-01-08 Uros Bizjak <ubizjak@gmail.com>

5069

+

5070

+ Backport from mainline

5071

+ 2014-01-05 Uros Bizjak <ubizjak@gmail.com>

5072

+

5073

+ * config/i386/i386.c (ix86_data_alignment): Calculate max_align

5074

+ from prefetch_block tune setting.

5075

+ (nocona_cost): Correct size of prefetch block to 64.

5076

+

5077

+2014-01-08 Martin Jambor <mjambor@suse.cz>

5078

+

5079

+ PR ipa/59610

5080

+ * ipa-prop.c (ipa_compute_jump_functions): Bail out if not optimizing.

5081

+ (parm_preserved_before_stmt_p): Assume modification present when not

5082

+ optimizing.

5083

+

5084

+2014-01-07 John David Anglin <danglin@gcc.gnu.org>

5085

+

5086

+ PR target/59652

5087

+ * config/pa/pa.c (pa_legitimate_address_p): Return false before reload

5088

+ for 14-bit register offsets when INT14_OK_STRICT is false.

5089

+

5090

+2014-01-07 Roland Stigge <stigge@antcom.de>

5091

+ Michael Meissner <meissner@linux.vnet.ibm.com>

5092

+

5093

+ PR 57386/target

5094

+ * config/rs6000/rs6000.c (rs6000_legitimate_offset_address_p):

5095

+ Only check TFmode for SPE constants. Don't check TImode or TDmode.

5096

+

5097

+2014-01-07 Jakub Jelinek <jakub@redhat.com>

5098

+

5099

+ PR rtl-optimization/58668

5100

+ * cfgcleanup.c (flow_find_cross_jump): Don't count

5101

+ any jumps if dir_p is NULL. Remove p1 variable and make USE/CLOBBER

5102

+ check consistent with other places.

5103

+ (flow_find_head_matching_sequence): Don't count USE or CLOBBER insns.

5104

+ (try_head_merge_bb): Adjust for the flow_find_head_matching_sequence

5105

+ counting change.

5106

+ * ifcvt.c (count_bb_insns): Don't count USE or CLOBBER insns.

5107

+

5108

+2014-01-07 Mike Stump <mikestump@comcast.net>

5109

+ Jakub Jelinek <jakub@redhat.com>

5110

+

5111

+ PR pch/59436

5112

+ * tree.h (struct tree_optimization_option): Change optabs

5113

+ type from unsigned char * to void *.

5114

+ * optabs.c (init_tree_optimization_optabs): Adjust

5115

+ TREE_OPTIMIZATION_OPTABS initialization.

5116

+

5117

+2014-01-07 Jakub Jelinek <jakub@redhat.com>

5118

+

5119

+ Backported from mainline

5120

+ 2013-12-16 Jakub Jelinek <jakub@redhat.com>

5121

+

5122

+ PR middle-end/58956

5123

+ PR middle-end/59470

5124

+ * gimple.h (walk_stmt_load_store_addr_fn): New typedef.

5125

+ (walk_stmt_load_store_addr_ops, walk_stmt_load_store_ops): Use it

5126

+ for callback params.

5127

+ * gimple.c (walk_stmt_load_store_ops): Likewise.

5128

+ (walk_stmt_load_store_addr_ops): Likewise. Adjust all callback

5129

+ calls to supply the gimple operand containing the base tree

5130

+ as an extra argument.

5131

+ * tree-ssa-ter.c (find_ssaname, find_ssaname_in_store): New helper

5132

+ functions.

5133

+ (find_replaceable_in_bb): For calls or GIMPLE_ASM, only set

5134

+ same_root_var if USE is used somewhere in the stores of the stmt.

5135

+ * ipa-prop.c (visit_ref_for_mod_analysis): Remove name of the stmt

5136

+ argument and ATTRIBUTE_UNUSED, add another unnamed tree argument.

5137

+ * ipa-pure-const.c (check_load, check_store, check_ipa_load,

5138

+ check_ipa_store): Likewise.

5139

+ * gimple.c (gimple_ior_addresses_taken_1): Likewise.

5140

+ * ipa-split.c (test_nonssa_use, mark_nonssa_use): Likewise.

5141

+ (verify_non_ssa_vars, visit_bb): Adjust their callers.

5142

+ * cfgexpand.c (add_scope_conflicts_1): Use

5143

+ walk_stmt_load_store_addr_fn type for visit variable.

5144

+ (visit_op, visit_conflict): Remove name of the stmt

5145

+ argument and ATTRIBUTE_UNUSED, add another unnamed tree argument.

5146

+ * tree-sra.c (asm_visit_addr): Likewise. Remove name of the data

5147

+ argument and ATTRIBUTE_UNUSED.

5148

+ * cgraphbuild.c (mark_address, mark_load, mark_store): Add another

5149

+ unnamed tree argument.

5150

+

5151

+2014-01-03 Andreas Schwab <schwab@linux-m68k.org>

5152

+

5153

+ * config/m68k/m68k.c (handle_move_double): Handle pushes with

5154

+ overlapping registers also for registers other than the stack

5155

+ pointer.

5156

+

5157

+2014-01-03 Jakub Jelinek <jakub@redhat.com>

5158

+

5159

+ PR target/59625

5160

+ * config/i386/i386.c (ix86_avoid_jump_mispredicts): Don't consider

5161

+ asm goto as jump.

5162

+

5163

+2014-01-01 Jakub Jelinek <jakub@redhat.com>

5164

+

5165

+ PR rtl-optimization/59647

5166

+ * cse.c (cse_process_notes_1): Don't substitute negative VOIDmode

5167

+ new_rtx into UNSIGNED_FLOAT rtxes.

5168

+

5169

+2013-12-28 Eric Botcazou <ebotcazou@adacore.com>

5170

+

5171

+ * doc/invoke.texi (output file options): Document -fada-spec-parent.

5172

+

5173

+2013-12-26 Uros Bizjak <ubizjak@gmail.com>

5174

+

5175

+ * config/i386/driver-i386.c (decode_caches_intel): Add missing entries.

5176

+

5177

+2013-12-20 Jakub Jelinek <jakub@redhat.com>

5178

+

5179

+ PR c++/59255

5180

+ Backported from mainline

5181

+ 2013-08-19 Dehao Chen <dehao@google.com>

5182

+

5183

+ * value-prof.c (gimple_ic): Fix the bug of adding EH edge.

5184

+

5185

+2013-12-19 James Greenhalgh <james.greenhalgh@arm.com>

5186

+

5187

+ Backport from Mainline.

5188

+ 2013-05-01 James Greenhalgh <james.greenhalgh@arm.com>

5189

+

5190

+ * config/aarch64/aarch64-simd-builtins.def (cmhs): Rename to...

5191

+ (cmgeu): ...This.

5192

+ (cmhi): Rename to...

5193

+ (cmgtu): ...This.

5194

+ * config/aarch64/aarch64-simd.md

5195

+ (simd_mode): Add SF.

5196

+ (aarch64_vcond_internal): Use new names for unsigned comparison insns.

5197

+ (aarch64_cm<optab><mode>): Rewrite to not use UNSPECs.

5198

+ * config/aarch64/aarch64.md (*cstore<mode>_neg): Rename to...

5199

+ (cstore<mode>_neg): ...This.

5200

+ * config/aarch64/iterators.md

5201

+ (VALLF): new.

5202

+ (unspec): Remove UNSPEC_CM<EQ, LE, LT, GE, GT, HS, HI, TST>.

5203

+ (COMPARISONS): New.

5204

+ (UCOMPARISONS): Likewise.

5205

+ (optab): Add missing comparisons.

5206

+ (n_optab): New.

5207

+ (cmp_1): Likewise.

5208

+ (cmp_2): Likewise.

5209

+ (CMP): Likewise.

5210

+ (cmp): Remove.

5211

+ (VCMP_S): Likewise.

5212

+ (VCMP_U): Likewise.

5213

+ (V_cmp_result): Add DF, SF modes.

5214

+ (v_cmp_result): Likewise.

5215

+ (v): Likewise.

5216

+ (vmtype): Likewise.

5217

+ * config/aarch64/predicates.md (aarch64_reg_or_fp_zero): New.

5218

+

5219

+ Partial Backport from mainline.

5220

+ 2013-05-01 James Greenhalgh <james.greenhalgh@arm.com>

5221

+

5222

+ * config/aarch64/arm_neon.h

5223

+ (vc<eq, lt, le, gt, ge, tst><qsd>_<u><8,16,32,64>): Remap

5224

+ to builtins or C as appropriate.

5225

+

5226

+2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

5227

+ Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5228

+

5229

+ Backport from mainline

5230

+ 2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

5231

+ * config/s390/s390.c (s390_hotpatch_trampoline_halfwords_default): New

5232

+ constant

5233

+ (s390_hotpatch_trampoline_halfwords_max): New constant

5234

+ (s390_hotpatch_trampoline_halfwords): New static variable

5235

+ (get_hotpatch_attribute): New function

5236

+ (s390_handle_hotpatch_attribute): New function

5237

+ (s390_attribute_table): New target specific attribute table to implement

5238

+ the hotpatch attribute

5239

+ (s390_option_override): Parse hotpatch options

5240

+ (s390_function_num_hotpatch_trampoline_halfwords): New function

5241

+ (s390_can_inline_p): Implement target hook to

5242

+ suppress hotpatching for explicitly inlined functions

5243

+ (s390_asm_output_function_label): Generate hotpatch prologue

5244

+ (TARGET_ATTRIBUTE_TABLE): Define to implement target attribute table

5245

+ (TARGET_CAN_INLINE_P): Define to implement target hook

5246

+ * config/s390/s390.opt (mhotpatch): New options -mhotpatch, -mhotpatch=

5247

+ * config/s390/s390-protos.h (s390_asm_output_function_label): Add

5248

+ prototype

5249

+ * config/s390/s390.h (ASM_OUTPUT_FUNCTION_LABEL): Target specific

5250

+ function label generation for hotpatching

5251

+ (FUNCTION_BOUNDARY): Align functions to eight bytes

5252

+ * doc/extend.texi: Document hotpatch attribute

5253

+ * doc/invoke.texi: Document -mhotpatch option

5254

+

5255

+2013-12-18 Eric Botcazou <ebotcazou@adacore.com>

5256

+

5257

+ * config/arm/arm.c (arm_expand_epilogue_apcs_frame): Fix thinko.

5258

+

5259

+2013-12-12 Vladimir Makarov <vmakarov@redhat.com>

5260

+

5261

+ PR middle-end/59470

5262

+ * lra-coalesce.c (lra_coalesce): Invalidate inheritance pseudo

5263

+ values if necessary.

5264

+

5265

+2013-12-12 Jakub Jelinek <jakub@redhat.com>

5266

+

5267

+ PR libgomp/59467

5268

+ * gimplify.c (omp_check_private): Add copyprivate argument, if it

5269

+ is true, don't check omp_privatize_by_reference.

5270

+ (gimplify_scan_omp_clauses): For OMP_CLAUSE_COPYPRIVATE verify

5271

+ decl is private in outer context. Adjust omp_check_private caller.

5272

+

5273

+2013-12-10 Eric Botcazou <ebotcazou@adacore.com>

5274

+

5275

+ PR rtl-optimization/58295

5276

+ * simplify-rtx.c (simplify_truncation): Restrict the distribution for

5277

+ WORD_REGISTER_OPERATIONS targets.

5278

+

5279

+2013-12-10 Kai Tietz <ktietz@redhat.com>

5280

+

5281

+ PR target/56807

5282

+ * config/i386/i386.c (ix86_expand_prologue): Address saved

5283

+ registers stack-relative, not via frame-pointer.

5284

+

5285

+2013-12-09 Alan Modra <amodra@gmail.com>

5286

+

5287

+ Apply from mainline

5288

+ 2013-12-05 Alan Modra <amodra@gmail.com>

5289

+ * configure.ac (BUILD_CXXFLAGS) Don't use ALL_CXXFLAGS for

5290

+ build != host.

5291

+ <recursive call for build != host>: Clear GMPINC. Don't bother

5292

+ saving CFLAGS.

5293

+ * configure: Regenerate.

5294

+

5295

+2013-12-08 Uros Bizjak <ubizjak@gmail.com>

5296

+

5297

+ Backport from mainline

5298

+ 2013-12-06 Uros Bizjak <ubizjak@gmail.com>

5299

+

5300

+ PR target/59405

5301

+ * config/i386/i386.c (type_natural_mode): Properly handle

5302

+ size 8 for !TARGET_64BIT.

5303

+

5304

+2013-12-07 Ralf Corsépius <ralf.corsepius@rtems.org>

5305

+

5306

+ * config.gcc (microblaze*-*-rtems*): Add TARGET_BIG_ENDIAN_DEFAULT.

5307

+

5308

+2013-12-06 Jakub Jelinek <jakub@redhat.com>

5309

+

5310

+ PR tree-optimization/59388

5311

+ * tree-ssa-reassoc.c (update_range_test): If op == range->exp,

5312

+ gimplify tem after stmt rather than before it.

5313

+

5314

+2013-12-06 Oleg Endo <olegendo@gcc.gnu.org>

5315

+

5316

+ Backport from mainline

5317

+ 2013-11-26 Oleg Endo <olegendo@gcc.gnu.org>

5318

+

5319

+ PR target/58314

5320

+ PR target/50751

5321

+ * config/sh/sh.c (max_mov_insn_displacement, disp_addr_displacement):

5322

+ Prefix function names with 'sh_'. Make them non-static.

5323

+ * config/sh/sh-protos.h (sh_disp_addr_displacement,

5324

+ sh_max_mov_insn_displacement): Add declarations.

5325

+ * config/sh/constraints.md (Q): Reject QImode.

5326

+ (Sdd): Use match_code "mem".

5327

+ (Snd): Fix erroneous matching of non-memory operands.

5328

+ * config/sh/predicates.md (short_displacement_mem_operand): New

5329

+ predicate.

5330

+ (general_movsrc_operand): Disallow PC relative QImode loads.

5331

+ * config/sh/sh.md (*mov<mode>_reg_reg): Remove it.

5332

+ (*movqi, *movhi): Merge both insns into...

5333

+ (*mov<mode>): ... this new insn. Replace generic 'm' constraints with

5334

+ 'Snd' and 'Sdd' constraints. Calculate insn length dynamically based

5335

+ on the operand types.

5336

+

5337

+2013-12-06 Richard Biener <rguenther@suse.de>

5338

+

5339

+ Backport from mainline

5340

+ 2013-11-29 Richard Biener <rguenther@suse.de>

5341

+

5342

+ PR tree-optimization/59334

5343

+ * tree-ssa-dce.c (eliminate_unnecessary_stmts): Fix bug

5344

+ in previous commit.

5345

+

5346

+ 2013-11-28 Richard Biener <rguenther@suse.de>

5347

+

5348

+ PR tree-optimization/59330

5349

+ * tree-ssa-dce.c (eliminate_unnecessary_stmts): Simplify

5350

+ and fix delayed marking of free calls not necessary.

5351

+

5352

+2013-12-06 Richard Biener <rguenther@suse.de>

5353

+

5354

+ Backport from mainline

5355

+ 2013-11-27 Richard Biener <rguenther@suse.de>

5356

+

5357

+ PR tree-optimization/59288

5358

+ * tree-vect-loop.c (get_initial_def_for_induction): Do not

5359

+ re-analyze the PHI but use STMT_VINFO_LOOP_PHI_EVOLUTION_PART.

5360

+

5361

+ 2013-11-19 Richard Biener <rguenther@suse.de>

5362

+

5363

+ PR tree-optimization/59164

5364

+ * tree-vect-loop.c (vect_analyze_loop_operations): Adjust

5365

+ check whether we can create an epilogue loop to reflect the

5366

+ cases where we create one.

5367

+

5368

+ 2013-09-05 Richard Biener <rguenther@suse.de>

5369

+

5370

+ PR tree-optimization/58137

5371

+ * tree-vect-stmts.c (get_vectype_for_scalar_type_and_size):

5372

+ Do not create vectors of pointers.

5373

+ * tree-vect-loop.c (get_initial_def_for_induction): Use proper

5374

+ types for the components of the vector initializer.

5375

+ * tree-cfg.c (verify_gimple_assign_binary): Remove special-casing

5376

+ allowing pointer vectors with PLUS_EXPR/MINUS_EXPR.

5377

+

5378

+2013-12-06 Oleg Endo <olegendo@gcc.gnu.org>

5379

+

5380

+ PR target/51244

5381

+ PR target/59343

5382

+ * config/sh/sh.md (*cbranch_t): Check that there are no labels between

5383

+ the s1 insn and the testing insn. Remove REG_DEAD note from s1 insn.

5384

+

5385

+2013-12-05 Richard Biener <rguenther@suse.de>

5386

+

5387

+ Backport from mainline

5388

+ 2013-11-19 Richard Biener <rguenther@suse.de>

5389

+

5390

+ PR middle-end/58956

5391

+ * tree-ssa-ter.c (find_replaceable_in_bb): Avoid forwarding

5392

+ loads into stmts that may clobber it.

5393

+

5394

+2013-12-04 Jakub Jelinek <jakub@redhat.com>

5395

+

5396

+ PR rtl-optimization/58726

5397

+ * combine.c (force_to_mode): Fix comment typo. Don't destructively

5398

+ modify x for ROTATE, ROTATERT and IF_THEN_ELSE.

5399

+

5400

+2013-12-04 Jakub Jelinek <jakub@redhat.com>

5401

+ Uros Bizjak <ubizjak@gmail.com>

5402

+

5403

+ PR target/59163

5404

+ * config/i386/i386.c (ix86_legitimate_combined_insn): If for

5405

+ !TARGET_AVX there is misaligned MEM operand with vector mode

5406

+ and get_attr_ssememalign is 0, return false.

5407

+ (ix86_expand_special_args_builtin): Add get_pointer_alignment

5408

+ computed alignment and for non-temporal loads/stores also

5409

+ at least GET_MODE_ALIGNMENT as MEM_ALIGN.

5410

+ * config/i386/sse.md

5411

+ (<sse>_loadu<ssemodesuffix><avxsizesuffix>,

5412

+ <sse>_storeu<ssemodesuffix><avxsizesuffix>,

5413

+ <sse2>_loaddqu<avxsizesuffix>,

5414

+ <sse2>_storedqu<avxsizesuffix>, <sse3>_lddqu<avxsizesuffix>,

5415

+ sse_vmrcpv4sf2, sse_vmrsqrtv4sf2, sse2_cvtdq2pd, sse_movhlps,

5416

+ sse_movlhps, sse_storehps, sse_loadhps, sse_loadlps,

5417

+ *vec_interleave_highv2df, *vec_interleave_lowv2df,

5418

+ *vec_extractv2df_1_sse, sse2_loadhpd, sse2_loadlpd, sse2_movsd,

5419

+ sse4_1_<code>v8qiv8hi2, sse4_1_<code>v4qiv4si2,

5420

+ sse4_1_<code>v4hiv4si2, sse4_1_<code>v2qiv2di2,

5421

+ sse4_1_<code>v2hiv2di2, sse4_1_<code>v2siv2di2, sse4_2_pcmpestr,

5422

+ *sse4_2_pcmpestr_unaligned, sse4_2_pcmpestri, sse4_2_pcmpestrm,

5423

+ sse4_2_pcmpestr_cconly, sse4_2_pcmpistr, *sse4_2_pcmpistr_unaligned,

5424

+ sse4_2_pcmpistri, sse4_2_pcmpistrm, sse4_2_pcmpistr_cconly): Add

5425

+ ssememalign attribute.

5426

+ * config/i386/i386.md (ssememalign): New define_attr.

5427

+

5428

+2013-12-03 Jakub Jelinek <jakub@redhat.com>

5429

+

5430

+ PR middle-end/59011

5431

+ * gimplify.c (nonlocal_vla_vars): New variable.

5432

+ (gimplify_var_or_parm_decl): Put VAR_DECLs for VLAs into

5433

+ nonlocal_vla_vars chain.

5434

+ (gimplify_body): Call declare_vars on nonlocal_vla_vars chain

5435

+ if outer_bind has DECL_INITIAL (current_function_decl) block.

5436

+

5437

+ PR target/58864

5438

+ * optabs.c (emit_conditional_move): Save and restore

5439

+ pending_stack_adjust and stack_pointer_delta if cmove can't be used.

5440

+

5441

+2013-12-02 Jakub Jelinek <jakub@redhat.com>

5442

+

5443

+ PR tree-optimization/59358

5444

+ * tree-vrp.c (union_ranges): To check for the partially

5445

+ overlapping ranges or adjacent ranges, also compare *vr0max

5446

+ with vr1max.

5447

+

5448

+2013-12-02 Richard Biener <rguenther@suse.de>

5449

+

5450

+ PR tree-optimization/59139

5451

+ * tree-ssa-loop-niter.c (chain_of_csts_start): Properly match

5452

+ code in get_val_for.

5453

+ (get_val_for): Use gcc_checking_asserts.

5454

+

5455

+2013-11-27 Tom de Vries <tom@codesourcery.com>

5456

+ Marc Glisse <marc.glisse@inria.fr>

5457

+

5458

+ PR middle-end/59037

5459

+ * fold-const.c (fold_indirect_ref_1): Don't create out-of-bounds

5460

+ BIT_FIELD_REF.

5461

+ * gimplify.c (gimple_fold_indirect_ref): Same.

5462

+

5463

+2013-12-01 Eric Botcazou <ebotcazou@adacore.com>

5464

+

5465

+ * config/i386/winnt.c (i386_pe_asm_named_section): Be prepared for an

5466

+ identifier node.

5467

+

5468

+2013-12-01 Bernd Edlinger <bernd.edlinger@hotmail.de>

5469

+

5470

+ * expr.c (emit_group_store): Fix off-by-one BITFIELD_END argument.

5471

+

5472

+2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

5473

+

5474

+ Backport from mainline

5475

+ 2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

5476

+

5477

+ * config/arm/iterators.md (vrint_conds): New int attribute.

5478

+ * config/arm/vfp.md (<vrint_pattern><SDF:mode>2): Set conds attribute.

5479

+ (smax<mode>3): Likewise.

5480

+ (smin<mode>3): Likewise.

5481

+

5482

+2013-11-28 Uros Bizjak <ubizjak@gmail.com>

5483

+

5484

+ Backport from mainline

5485

+ 2013-11-27 Uros Bizjak <ubizjak@gmail.com>

5486

+ Ganesh Gopalasubramanian <Ganesh.Gopalasubramanian@amd.com>

5487

+

5488

+ PR target/56788

5489

+ * gcc.target/i386/xop-frczX.c: New test.

5490

+

5491

+2013-11-28 Terry Guo <terry.guo@arm.com>

5492

+

5493

+ Backport mainline r205391

5494

+ 2013-11-26 Terry Guo <terry.guo@arm.com>

5495

+

5496

+ * config/arm/arm.c (require_pic_register): Handle high pic base

5497

+ register for thumb-1.

5498

+ (arm_load_pic_register): Also initialize high pic base register.

5499

+ * doc/invoke.texi: Update documentation for option -mpic-register.

5500

+

5501

+2013-11-27 Jakub Jelinek <jakub@redhat.com>

5502

+

5503

+ Backported from mainline

5504

+ 2013-11-26 Jakub Jelinek <jakub@redhat.com>

5505

+

5506

+ PR tree-optimization/59014

5507

+ * tree-vrp.c (register_edge_assert_for_1): Don't look

5508

+ through conversions from non-integral types or through

5509

+ narrowing conversions.

5510

+

5511

+2013-11-27 Eric Botcazou <ebotcazou@adacore.com>

5512

+

5513

+ PR middle-end/59138

5514

+ * expr.c (emit_group_store): Don't write past the end of the structure.

5515

+ (store_bit_field): Fix formatting.

5516

+

5517

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5518

+

5519

+ Backport from mainline

5520

+ 2013-09-17 Sebastian Huber <sebastian.huber@embedded-brains.de>

5521

+

5522

+ * config/sparc/t-rtems: Add leon3 multilibs.

5523

+

5524

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5525

+

5526

+ Backport from mainline

5527

+ 2013-08-09 Eric Botcazou <ebotcazou@adacore.com>

5528

+

5529

+ * configure.ac: Add GAS check for LEON instructions on SPARC.

5530

+ * configure: Regenerate.

5531

+ * config.in: Likewise.

5532

+ * config.gcc (with_cpu): Remove sparc-leon*-* and deal with LEON in the

5533

+ sparc*-*-* block.

5534

+ * config/sparc/sparc.opt (LEON, LEON3): New masks.

5535

+ * config/sparc/sparc.h (ASM_CPU32_DEFAULT_SPEC): Set to AS_LEON_FLAG

5536

+ for LEON or LEON3.

5537

+ (ASM_CPU_SPEC): Pass AS_LEON_FLAG if -mcpu=leon or -mcpu=leon3.

5538

+ (AS_LEON_FLAG): New macro.

5539

+ * config/sparc/sparc.c (sparc_option_override): Set MASK_LEON for leon

5540

+ and MASK_LEON3 for leon3 and unset them if HAVE_AS_LEON is not defined.

5541

+ Deal with LEON and LEON3 for the memory model.

5542

+ * config/sparc/sync.md (atomic_compare_and_swap<mode>): Enable if LEON3

5543

+ (atomic_compare_and_swap<mode>_1): Likewise.

5544

+ (*atomic_compare_and_swap<mode>_1): Likewise.

5545

+

5546

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5547

+

5548

+ Backport from mainline

5549

+ 2013-07-23 Eric Botcazou <ebotcazou@adacore.com>

5550

+

5551

+ * doc/invoke.texi (SPARC Options): Document new leon3 processor value.

5552

+

5553

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5554

+

5555

+ Backport from mainline

5556

+ 2013-07-22 Eric Botcazou <ebotcazou@adacore.com>

5557

+

5558

+ * config.gcc (sparc*-*-*): Accept leon3 processor.

5559

+ (sparc-leon*-*): Merge with sparc*-*-* and add leon3 support.

5560

+ * doc/invoke.texi (SPARC Options): Adjust -mfix-ut699 entry.

5561

+ * config/sparc/sparc-opts.h (enum processor_type): Add PROCESSOR_LEON3.

5562

+ * config/sparc/sparc.opt (enum processor_type): Add leon3.

5563

+ (mfix-ut699): Adjust comment.

5564

+ * config/sparc/sparc.h (TARGET_CPU_leon3): New define.

5565

+ (CPP_CPU32_DEFAULT_SPEC): Add leon3 support.

5566

+ (CPP_CPU_SPEC): Likewise.

5567

+ (ASM_CPU_SPEC): Likewise.

5568

+ * config/sparc/sparc.c (leon3_cost): New constant.

5569

+ (sparc_option_override): Add leon3 support.

5570

+ (mem_ref): New function.

5571

+ (sparc_gate_work_around_errata): Return true if -mfix-ut699 is enabled.

5572

+ (sparc_do_work_around_errata): Look into the instruction in the delay

5573

+ slot and adjust accordingly. Add fix for the data cache nullify issues

5574

+ of the UT699. Change insertion position for the NOP.

5575

+ * config/sparc/leon.md (leon_fpalu, leon_fpmds, write_buf): Delete.

5576

+ (leon3_load): New reservation.

5577

+ (leon_store): Bump latency to 2.

5578

+ (grfpu): New automaton.

5579

+ (grfpu_alu): New unit.

5580

+ (grfpu_ds): Likewise.

5581

+ (leon_fp_alu): Adjust.

5582

+ (leon_fp_mult): Delete.

5583

+ (leon_fp_div): Split into leon_fp_divs and leon_fp_divd.

5584

+ (leon_fp_sqrt): Split into leon_fp_sqrts and leon_fp_sqrtd.

5585

+ * config/sparc/sparc.md (cpu): Add leon3.

5586

+ * config/sparc/sync.md (atomic_exchangesi): Disable if -mfix-ut699.

5587

+ (swapsi): Likewise.

5588

+ (atomic_test_and_set): Likewise.

5589

+ (ldstub): Likewise.

5590

+

5591

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5592

+

5593

+ Backport from mainline

5594

+ 2013-04-10 Steven Bosscher <steven@gcc.gnu.org>

5595

+

5596

+ * config/sparc/sparc.c: Include tree-pass.h.

5597

+ (TARGET_MACHINE_DEPENDENT_REORG): Do not redefine.

5598

+ (sparc_reorg): Rename to sparc_do_work_around_errata. Move to

5599

+ head of file. Change return type. Split off gate function.

5600

+ (sparc_gate_work_around_errata): New function.

5601

+ (pass_work_around_errata): New pass definition.

5602

+ (insert_pass_work_around_errata) New pass insert definition to

5603

+ insert pass_work_around_errata just after delayed-branch scheduling.

5604

+ (sparc_option_override): Insert the pass.

5605

+ * config/sparc/t-sparc (sparc.o): Add TREE_PASS_H dependence.

5606

+

5607

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5608

+

5609

+ Backport from mainline

5610

+ 2013-05-28 Eric Botcazou <ebotcazou@adacore.com>

5611

+

5612

+ * doc/invoke.texi (SPARC Options): Document -mfix-ut699.

5613

+ * builtins.c (expand_builtin_mathfn) <BUILT_IN_SQRT>: Try to widen the

5614

+ mode if the instruction isn't available in the original mode.

5615

+ * config/sparc/sparc.opt (mfix-ut699): New option.

5616

+ * config/sparc/sparc.md (muldf3_extend): Disable if -mfix-ut699.

5617

+ (divdf3): Turn into expander.

5618

+ (divdf3_nofix): New insn.

5619

+ (divdf3_fix): Likewise.

5620

+ (divsf3): Disable if -mfix-ut699.

5621

+ (sqrtdf2): Turn into expander.

5622

+ (sqrtdf2_nofix): New insn.

5623

+ (sqrtdf2_fix): Likewise.

5624

+ (sqrtsf2): Disable if -mfix-ut699.

5625

+

5626

+2013-11-22 Eric Botcazou <ebotcazou@adacore.com>

5627

+

5628

+ * print-rtl.c (print_rtx) <case MEM>: Output a space if no MEM_EXPR.

5629

+

5630

+2013-11-21 Zhenqiang Chen <zhenqiang.chen@linaro.org>

5631

+

5632

+ PR bootstrap/57683

5633

+ Backport from mainline: r197467 and r198999.

5634

+ 2013-04-03 Jeff Law <law@redhat.com>

5635

+

5636

+ * Makefile.in (lra-constraints.o): Depend on $(OPTABS_H).

5637

+ (lra-eliminations.o): Likewise.

5638

+

5639

+ 2013-05-16 Jeff Law <law@redhat.com>

5640

+

5641

+ * Makefile.in (tree-switch-conversion.o): Depend on $(OPTABS_H).

5642

+

5643

+2013-11-20 Eric Botcazou <ebotcazou@adacore.com>

5644

+

5645

+ PR target/59207

5646

+ * config/sparc/sparc.c (sparc_fold_builtin) <case CODE_FOR_pdist_vis>:

5647

+ Make sure neg2_ovf is set before being used.

5648

+

5649

+2013-11-20 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5650

+ Dominik Vogt <vogt@linux.vnet.ibm.com>

5651

+

5652

+ Backport from mainline

5653

+ * config/s390/s390.c (s390_canonicalize_comparison): Don't fold

5654

+ int comparisons with an out of range condition code.

5655

+ (s390_optimize_nonescaping_tx): Skip empty BBs.

5656

+ Generate the new tbegin RTX when removing the FPR clobbers (with

5657

+ two SETs).

5658

+ (s390_expand_tbegin): Fix the retry loop counter. Copy CC to the

5659

+ result before doing the retry calculations.

5660

+ (s390_init_builtins): Make tbegin "returns_twice" and tabort

5661

+ "noreturn".

5662

+ * config/s390/s390.md (UNSPECV_TBEGIN_TDB): New constant used for

5663

+ the TDB setting part of an tbegin.

5664

+ ("tbegin_1", "tbegin_nofloat_1"): Add a set for the TDB.

5665

+ ("tx_assist"): Set unused argument to an immediate zero instead of

5666

+ loading zero into a GPR and pass it as argument.

5667

+ * config/s390/htmxlintrin.h (__TM_simple_begin, __TM_begin):

5668

+ Remove inline and related attributes.

5669

+ (__TM_nesting_depth, __TM_is_user_abort, __TM_is_named_user_abort)

5670

+ (__TM_is_illegal, __TM_is_footprint_exceeded)

5671

+ (__TM_is_nested_too_deep, __TM_is_conflict): Fix format value

5672

+ check.

5673

+

5674

+2013-11-19 Uros Bizjak <ubizjak@gmail.com>

5675

+

5676

+ Backport from mainline

5677

+ 2013-11-18 Uros Bizjak <ubizjak@gmail.com>

5678

+

5679

+ * config/i386/i386.c (ix86_decompose_address): Use REG_P instead of

5680

+ ix86_address_subreg_operand. Move subreg checks to

5681

+ ix86_validate_address_register. Move address override check to

5682

+ ix86_legitimate_address_p.

5683

+ (ix86_validate_address_register): New function.

5684

+ (ix86_legitimate_address_p): Call ix86_validate_address_register

5685

+ to validate base and index registers. Add address override check

5686

+ from ix86_decompose_address.

5687

+ (ix86_decompose_address): Remove.

5688

+

5689

+ Backport from mainline

5690

+ 2013-11-17 Uros Bizjak <ubizjak@gmail.com>

5691

+

5692

+ PR target/59153

5693

+ * config/i386/i386.c (ix86_address_subreg_operand): Do not

5694

+ reject non-integer subregs.

5695

+ (ix86_decompose_address): Do not reject invalid CONST_INT RTXes.

5696

+ Move check for invalid x32 constant addresses ...

5697

+ (ix86_legitimate_address_p): ... here.

5698

+

5699

+2013-11-19 Richard Biener <rguenther@suse.de>

5700

+

5701

+ Backport from mainline

5702

+ 2013-11-07 Richard Biener <rguenther@suse.de>

5703

+

5704

+ * tree-dfa.c (get_ref_base_and_extent): Fix casting.

5705

+

5706

+2013-11-19 Richard Biener <rguenther@suse.de>

5707

+

5708

+ PR tree-optimization/57517

5709

+ * tree-predcom.c (combinable_refs_p): Verify the combination

5710

+ is always executed when the refs are.

5711

+

5712

+2013-11-19 Richard Biener <rguenther@suse.de>

5713

+

5714

+ Backport from mainline

5715

+ 2013-11-05 Richard Biener <rguenther@suse.de>

5716

+

5717

+ PR middle-end/58941

5718

+ * tree-dfa.c (get_ref_base_and_extent): Merge common code

5719

+ in MEM_REF and TARGET_MEM_REF handling. Make sure to

5720

+ process trailing array detection before diving into the

5721

+ view-converted object (and possibly apply some extra offset).

5722

+

5723

+2013-11-18 Richard Biener <rguenther@suse.de>

5724

+

5725

+ Backport from mainline

5726

+ 2013-10-21 Richard Biener <rguenther@suse.de>

5727

+

5728

+ PR tree-optimization/58794

5729

+ * fold-const.c (operand_equal_p): Compare FIELD_DECL operand

5730

+ of COMPONENT_REFs with OEP_CONSTANT_ADDRESS_OF left in place.

5731

+

5732

+ 2013-10-21 Richard Biener <rguenther@suse.de>

5733

+

5734

+ PR middle-end/58742

5735

+ * fold-const.c (fold_binary_loc): Fold ((T) (X /[ex] C)) * C

5736

+ to (T) X for sign-changing conversions (or no conversion).

5737

+

5738

+ 2013-11-06 Richard Biener <rguenther@suse.de>

5739

+

5740

+ PR tree-optimization/58653

5741

+ * tree-predcom.c (ref_at_iteration): Rewrite to generate

5742

+ a MEM_REF.

5743

+ (prepare_initializers_chain): Adjust.

5744

+

5745

+ PR tree-optimization/59047

5746

+ * tree-predcom.c (ref_at_iteration): Handle bitfield accesses

5747

+ properly.

5748

+

5749

+ 2013-10-15 Richard Biener <rguenther@suse.de>

5750

+

5751

+ PR tree-optimization/58143

5752

+ * tree-ssa-loop-im.c (arith_code_with_undefined_signed_overflow):

5753

+ New function.

5754

+ (rewrite_to_defined_overflow): Likewise.

5755

+ (move_computations_dom_walker::before_dom): Rewrite stmts

5756

+ with undefined signed overflow that are not always executed

5757

+ into unsigned arithmetic.

5758

+

5759

+2013-11-14 Uros Bizjak <ubizjak@gmail.com>

5760

+

5761

+ Backport from mainline

5762

+ 2013-11-10 Uros Bizjak <ubizjak@gmail.com>

5763

+

5764

+ * mode-switching.c (optimize_mode_switching): Mark block as

5765

+ nontransparent, if last_mode at block exit is different from no_mode.

5766

+

5767

+ Backport from mainline

5768

+ 2013-11-06 Uros Bizjak <ubizjak@gmail.com>

5769

+

5770

+ PR target/59021

5771

+ * config/i386/i386.c (ix86_avx_u128_mode_needed): Require

5772

+ AVX_U128_DIRTY mode for call_insn RTXes that use AVX256 registers.

5773

+ (ix86_avx_u128_mode_needed): Return AVX_U128_DIRTY mode for call_insn

5774

+ RTXes that return in AVX256 register.

5775

+

5776

+2013-11-14 Jakub Jelinek <jakub@redhat.com>

5777

+ Uros Bizjak <ubizjak@gmail.com>

5778

+

5779

+ PR target/59101

5780

+ * config/i386/i386.md (*anddi_2): Only allow CCZmode if

5781

+ operands[2] satisfies_constraint_Z that might have bit 31 set.

5782

+

5783

+2013-11-12 H.J. Lu <hongjiu.lu@intel.com>

5784

+

5785

+ Backported from mainline

5786

+ 2013-11-12 H.J. Lu <hongjiu.lu@intel.com>

5787

+

5788

+ PR target/59088

5789

+ * config/i386/i386.c (initial_ix86_tune_features): Set

5790

+ X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL and

5791

+ X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL for m_HASWELL.

5792

+

5793

+2013-11-11 Ramana Radhakrishnan <ramana.radhakrishnan@arm.com>

5794

+

5795

+ Backported from mainline

5796

+ 2013-10-30 Ramana Radhakrishnan <ramana.radhakrishnan@arm.com>

5797

+

5798

+ PR target/58854

5799

+ * config/arm/arm.c (arm_expand_epilogue_apcs_frame): Emit blockage

5800

+

5801

+2013-11-11 Jakub Jelinek <jakub@redhat.com>

5802

+

5803

+ Backported from mainline

5804

+ 2013-11-06 Jakub Jelinek <jakub@redhat.com>

5805

+

5806

+ PR middle-end/58970

5807

+ * expr.c (get_bit_range): Handle *offset == NULL_TREE.

5808

+ (expand_assignment): If *bitpos is negative, set *offset

5809

+ and adjust *bitpos, so that it is not negative.

5810

+

5811

+ 2013-11-05 Jakub Jelinek <jakub@redhat.com>

5812

+

5813

+ PR rtl-optimization/58997

5814

+ * loop-iv.c (iv_subreg): For IV_UNKNOWN_EXTEND, expect

5815

+ get_iv_value to be in iv->mode rather than iv->extend_mode.

5816

+ (iv_extend): Likewise. Otherwise, if iv->extend != extend,

5817

+ use lowpart_subreg on get_iv_value before calling simplify_gen_unary.

5818

+ * loop-unswitch.c (may_unswitch_on): Make sure op[i] is in the right

5819

+ mode.

5820

+

5821

+2013-11-10 Karlson2k <k2k@narod.ru>

5822

+ Kai Tietz <ktietz@redhat.com>

5823

+

5824

+ Merged from trunk

5825

+ PR plugins/52872

5826

+ * configure.ac: Adding for exported symbols check

5827

+ and for rdynamic-check executable-extension.

5828

+ * configure: Regenerated.

5829

+

5830

+2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

5831

+

5832

+ PR target/59034

5833

+ * config/i386/i386.md (push peepholer/splitter): Use Pmode

5834

+ with stack_pointer_rtx.

5835

+

5836

+2013-11-05 Uros Bizjak <ubizjak@gmail.com>

5837

+

5838

+ * config/i386/t-rtems (MULTILIB_MATCHES): Fix option typos.

5839

+

5840

+2013-11-05 Jakub Jelinek <jakub@redhat.com>

5841

+

5842

+ PR tree-optimization/58984

5843

+ * ipa-prop.c (ipa_load_from_parm_agg_1): Add SIZE_P argument,

5844

+ set *SIZE_P if non-NULL on success.

5845

+ (ipa_load_from_parm_agg, ipa_analyze_indirect_call_uses): Adjust

5846

+ callers.

5847

+ (ipcp_transform_function): Likewise. Punt if size of access

5848

+ is different from TYPE_SIZE on v->value's type.

5849

+

5850

+2013-11-03 H.J. Lu <hongjiu.lu@intel.com>

5851

+

5852

+ Backport from mainline

5853

+ 2013-10-12 H.J. Lu <hongjiu.lu@intel.com>

5854

+

5855

+ PR target/58690

5856

+ * config/i386/i386.c (ix86_copy_addr_to_reg): New function.

5857

+ (ix86_expand_movmem): Replace copy_addr_to_reg with

5858

+ ix86_copy_addr_to_reg.

5859

+ (ix86_expand_setmem): Likewise.

5860

+

5861

+2013-10-29 Uros Bizjak <ubizjak@gmail.com>

5862

+

5863

+ Backport from mainline

5864

+ 2013-08-08 Richard Sandiford <rdsandiford@googlemail.com>

5865

+

5866

+ PR rtl-optimization/58079

5867

+ * combine.c (combine_simplify_rtx): Avoid using SUBST if

5868

+ simplify_comparison has widened a comparison with an integer.

5869

+

5870

+2013-10-29 Martin Jambor <mjambor@suse.cz>

5871

+

5872

+ PR middle-end/58789

5873

+ Backport from mainline

5874

+ 2013-05-09 Martin Jambor <mjambor@suse.cz>

5875

+

5876

+ PR lto/57084

5877

+ * gimple-fold.c (canonicalize_constructor_val): Call

5878

+ cgraph_get_create_real_symbol_node instead of cgraph_get_create_node.

5879

+

5880

+ Backport from mainline

5881

+ 2013-03-16 Jan Hubicka <jh@suse.cz>

5882

+

5883

+ * cgraph.h (cgraph_get_create_real_symbol_node): Declare.

5884

+ * cgraph.c (cgraph_get_create_real_symbol_node): New function.

5885

+ * cgrpahbuild.c: Use cgraph_get_create_real_symbol_node instead

5886

+ of cgraph_get_create_node.

5887

+ * ipa-prop.c (ipa_make_edge_direct_to_target): Likewise.

5888

+

5889

+2013-10-28 Tom de Vries <tom@codesourcery.com>

5890

+

5891

+ * cfgexpand.c (gimple_expand_cfg): Remove test for parm_birth_insn.

5892

+ Don't commit insertions after NOTE_INSN_FUNCTION_BEG.

5893

+

5894

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

5895

+

5896

+ Backport from mainline

5897

+ 2013-10-22 Uros Bizjak <ubizjak@gmail.com>

5898

+

5899

+ PR target/58779

5900

+ * config/i386/i386.c (put_condition_code) <case GTU, case LEU>:

5901

+ Remove CCCmode handling.

5902

+ <case LTU>: Return 'c' suffix for CCCmode.

5903

+ <case GEU>: Return 'nc' suffix for CCCmode.

5904

+ (ix86_cc_mode) <case GTU, case LEU>: Do not generate overflow checks.

5905

+ * config/i386/i386.md (*sub<mode>3_cconly_overflow): Remove.

5906

+ (*sub<mode>3_cc_overflow): Ditto.

5907

+ (*subsi3_zext_cc_overflow): Ditto.

5908

+

5909

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

5910

+

5911

+ Backport from mainline

5912

+ 2013-10-19 Uros Bizjak <ubizjak@gmail.com>

5913

+

5914

+ PR target/58792

5915

+ * config/i386/i386.c (ix86_function_value_regno): Add DX_REG,

5916

+ ST1_REG and XMM1_REG for 32bit and 64bit targets. Also add DI_REG

5917

+ and SI_REG for 64bit SYSV ABI targets.

5918

+

5919

+2013-08-25 Richard Henderson <rth@twiddle.net>

5920

+

5921

+ PR rtl/58542

5922

+ * optabs.c (maybe_emit_atomic_exchange): Use create_input_operand

5923

+ instead of create_convert_operand_to.

5924

+ (maybe_emit_sync_lock_test_and_set): Likewise.

5925

+ (expand_atomic_compare_and_swap): Likewise.

5926

+ (maybe_emit_compare_and_swap_exchange_loop): Don't convert_modes.

5927

+

5928

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

5929

+

5930

+ PR rtl-optimization/58831

5931

+ * alias.c (init_alias_analysis): At the beginning of each iteration, set

5932

+ the reg_seen[N] bit if static_reg_base_value[N] is non-null.

5933

+

5934

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

5935

+

5936

+ * recog.c (search_ofs): New static variable moved from...

5937

+ (peep2_find_free_register): ...here.

5938

+ (peephole2_optimize): Initialize it.

5939

+

5940

+2013-10-24 David Edelsohn <dje.gcc@gmail.com>

5941

+

5942

+ Backport from mainline

5943

+ 2013-10-23 David Edelsohn <dje.gcc@gmail.com>

5944

+

5945

+ PR target/58838

5946

+ * config/rs6000/rs6000.md (mulsi3_internal1 and splitter): Add

5947

+ TARGET_32BIT final condition.

5948

+ (mulsi3_internal2 and splitter): Same.

5949

+

5950

+2013-10-23 Tom de Vries <tom@codesourcery.com>

5951

+

5952

+ PR tree-optimization/58805

5953

+ * tree-ssa-tail-merge.c (stmt_local_def): Add gimple_vdef check.

5954

+

5955

+2013-10-23 Richard Biener <rguenther@suse.de>

5956

+

5957

+ Backport from mainline

5958

+ 2013-06-24 Richard Biener <rguenther@suse.de>

5959

+

5960

+ PR tree-optimization/57488

5961

+ * tree-ssa-pre.c (insert): Clear NEW sets before each iteration.

5962

+

5963

+2013-10-16 Ganesh Gopalasubramanian <Ganesh.Gopalasubramanian@amd.com>

5964

+

5965

+ Backport from mainline

5966

+ 2013-10-16 Ganesh Gopalasubramanian

5967

+ <Ganesh.Gopalasubramanian@amd.com>

5968

+

5969

+ * config/i386/i386.c (ix86_option_override_internal): Enable FMA4

5970

+ for AMD bdver3.

5971

+

5972

2013-10-16 Release Manager

5973

5974

* GCC 4.8.2 released.

5975

@@ -639,7 +1671,7 @@

5976

2013-07-31 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5977

5978

Backport from mainline

5979

- 2013-03-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5980

+ 2013-03-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5981

5982

* config/s390/s390.h (TARGET_FLT_EVAL_METHOD): Define.

5983

5984

Index: gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c

5985

===================================================================

5986

--- a/src/gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c (.../tags/gcc_4_8_2_release)

5987

+++ b/src/gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c (.../branches/gcc-4_8-branch)

5988

@@ -0,0 +1,11 @@

5989

+/* { dg-do compile } */

5990

+/* { dg-require-effective-target arm_thumb1_ok } */

5991

+/* { dg-options "-mthumb -fpic -msingle-pic-base" } */

5992

+

5993

+int g_test;

5994

+

5995

+int

5996

+foo (int par)

5997

+{

5998

+ g_test = par;

5999

+}

6000

Index: gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c

6001

===================================================================

6002

--- a/src/gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c (.../tags/gcc_4_8_2_release)

6003

+++ b/src/gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c (.../branches/gcc-4_8-branch)

6004

@@ -0,0 +1,11 @@

6005

+/* { dg-do compile } */

6006

+/* { dg-require-effective-target arm_thumb1_ok } */

6007

+/* { dg-options "-mthumb -fpic -mpic-register=9" } */

6008

+

6009

+int g_test;

6010

+

6011

+int

6012

+foo (int par)

6013

+{

6014

+ g_test = par;

6015

+}

6016

Index: gcc/testsuite/gcc.target/arm/require-pic-register-loc.c

6017

===================================================================

6018

--- a/src/gcc/testsuite/gcc.target/arm/require-pic-register-loc.c (.../tags/gcc_4_8_2_release)

6019

+++ b/src/gcc/testsuite/gcc.target/arm/require-pic-register-loc.c (.../branches/gcc-4_8-branch)

6020

@@ -0,0 +1,29 @@

6021

+/* { dg-do compile } */

6022

+/* { dg-options "-g -fPIC" } */

6023

+

6024

+void *v;

6025

+void a (void *x) { }

6026

+void b (void) { }

6027

+ /* line 7. */

6028

+int /* line 8. */

6029

+main (int argc) /* line 9. */

6030

+{ /* line 10. */

6031

+ if (argc == 12345) /* line 11. */

6032

+ {

6033

+ a (v);

6034

+ return 1;

6035

+ }

6036

+ b ();

6037

+

6038

+ return 0;

6039

+}

6040

+

6041

+/* { dg-final { scan-assembler-not "\.loc 1 7 0" } } */

6042

+/* { dg-final { scan-assembler-not "\.loc 1 8 0" } } */

6043

+/* { dg-final { scan-assembler-not "\.loc 1 9 0" } } */

6044

+

6045

+/* The loc at the start of the prologue. */

6046

+/* { dg-final { scan-assembler-times "\.loc 1 10 0" 1 } } */

6047

+

6048

+/* The loc at the end of the prologue, with the first user line. */

6049

+/* { dg-final { scan-assembler-times "\.loc 1 11 0" 1 } } */

6050

Index: gcc/testsuite/gcc.target/arm/vrinta-ce.c

6051

===================================================================

6052

--- a/src/gcc/testsuite/gcc.target/arm/vrinta-ce.c (.../tags/gcc_4_8_2_release)

6053

+++ b/src/gcc/testsuite/gcc.target/arm/vrinta-ce.c (.../branches/gcc-4_8-branch)

6054

@@ -0,0 +1,15 @@

6055

+/* { dg-do compile } */

6056

+/* { dg-require-effective-target arm_v8_vfp_ok } */

6057

+/* { dg-options "-O2 -marm -march=armv8-a" } */

6058

+/* { dg-add-options arm_v8_vfp } */

6059

+

6060

+double foo (double a)

6061

+{

6062

+ if (a > 3.0)

6063

+ return __builtin_round (a);

6064

+

6065

+ return 0.0;

6066

+}

6067

+

6068

+/* { dg-final { scan-assembler-times "vrinta.f64\td\[0-9\]+" 1 } } */

6069

+

6070

Index: gcc/testsuite/gcc.target/arm/pr54300.C

6071

===================================================================

6072

--- a/src/gcc/testsuite/gcc.target/arm/pr54300.C (.../tags/gcc_4_8_2_release)

6073

+++ b/src/gcc/testsuite/gcc.target/arm/pr54300.C (.../branches/gcc-4_8-branch)

6074

@@ -0,0 +1,61 @@

6075

+/* { dg-do run } */

6076

+/* { dg-require-effective-target arm_neon } */

6077

+/* { dg-options "-O2" } */

6078

+/* { dg-add-options arm_neon } */

6079

+

6080

+#include <arm_neon.h>

6081

+#include <stdlib.h>

6082

+

6083

+struct __attribute__ ((aligned(8))) _v16u8_ {

6084

+ uint8x16_t val;

6085

+ _v16u8_( const int16x8_t &src) { val = vreinterpretq_u8_s16(src); }

6086

+ operator int16x8_t () const { return vreinterpretq_s16_u8(val); }

6087

+};

6088

+typedef struct _v16u8_ v16u8;

6089

+

6090

+struct __attribute__ ((aligned(4))) _v8u8_ {

6091

+ uint8x8_t val;

6092

+ _v8u8_( const uint8x8_t &src) { val = src; }

6093

+ operator int16x4_t () const { return vreinterpret_s16_u8(val); }

6094

+};

6095

+typedef struct _v8u8_ v8u8;

6096

+

6097

+typedef v16u8 v8i16;

6098

+typedef int32x4_t v4i32;

6099

+typedef const short cv1i16;

6100

+typedef const unsigned char cv1u8;

6101

+typedef const v8i16 cv8i16;

6102

+

6103

+static inline __attribute__((always_inline)) v8u8 zero_64(){ return vdup_n_u8( 0 ); }

6104

+

6105

+static inline __attribute__((always_inline)) v8i16 loadlo_8i16( cv8i16* p ){

6106

+ return vcombine_s16( vld1_s16( (cv1i16 *)p ), zero_64() );

6107

+}

6108

+static inline __attribute__((always_inline)) v8i16 _loadlo_8i16( cv8i16* p, int offset ){

6109

+ return loadlo_8i16( (cv8i16*)(&((cv1u8*)p)[offset]) );

6110

+}

6111

+

6112

+void __attribute__((noinline))

6113

+test(unsigned short *_Inp, int32_t *_Out,

6114

+ unsigned int s1v, unsigned int dv0,

6115

+ unsigned int smask_v)

6116

+{

6117

+ int32x4_t c = vdupq_n_s32(0);

6118

+

6119

+ for(unsigned int sv=0 ; sv!=dv0 ; sv=(sv+s1v)&smask_v )

6120

+ {

6121

+ int32x4_t s;

6122

+ s = vmovl_s16( vget_low_s16( _loadlo_8i16( (cv8i16*) _Inp, sv ) ) );

6123

+ c = vaddq_s32( c, s );

6124

+ }

6125

+ vst1q_s32( _Out, c );

6126

+}

6127

+

6128

+main()

6129

+{

6130

+ unsigned short a[4] = {1, 2, 3, 4};

6131

+ int32_t b[4] = {0, 0, 0, 0};

6132

+ test(a, b, 1, 1, ~0);

6133

+ if (b[0] != 1 || b[1] != 2 || b[2] != 3 || b[3] != 4)

6134

+ abort();

6135

+}

6136

Index: gcc/testsuite/gcc.target/powerpc/rs6000-ldouble-3.c

6137

===================================================================

6138

--- a/src/gcc/testsuite/gcc.target/powerpc/rs6000-ldouble-3.c (.../tags/gcc_4_8_2_release)

6139

+++ b/src/gcc/testsuite/gcc.target/powerpc/rs6000-ldouble-3.c (.../branches/gcc-4_8-branch)

6140

@@ -0,0 +1,21 @@

6141

+/* Test accuracy of long double division (glibc bug 15396). */

6142

+/* { dg-do run { target powerpc*-*-linux* powerpc*-*-darwin* powerpc*-*-aix* rs6000-*-* } } */

6143

+/* { dg-options "-mlong-double-128" } */

6144

+

6145

+extern void exit (int);

6146

+extern void abort (void);

6147

+

6148

+volatile long double a = 0x1p-1024L;

6149

+volatile long double b = 0x3p-53L;

6150

+volatile long double r;

6151

+volatile long double expected = 0x1.55555555555555555555555555p-973L;

6152

+

6153

+int

6154

+main (void)

6155

+{

6156

+ r = a / b;

6157

+ /* Allow error up to 2ulp. */

6158

+ if (__builtin_fabsl (r - expected) > 0x1p-1073L)

6159

+ abort ();

6160

+ exit (0);

6161

+}

6162

Index: gcc/testsuite/gcc.target/aarch64/scalar_intrinsics.c

6163

===================================================================

6164

--- a/src/gcc/testsuite/gcc.target/aarch64/scalar_intrinsics.c (.../tags/gcc_4_8_2_release)

6165

+++ b/src/gcc/testsuite/gcc.target/aarch64/scalar_intrinsics.c (.../branches/gcc-4_8-branch)

6166

@@ -1,8 +1,14 @@

6167

/* { dg-do compile } */

6168

/* { dg-options "-O2" } */

6169

6170

-#include "../../../config/aarch64/arm_neon.h"

6171

+#include <arm_neon.h>

6172

6173

+/* Used to force a variable to a SIMD register. */

6174

+#define force_simd(V1) asm volatile ("mov %d0, %1.d[0]" \

6175

+ : "=w"(V1) \

6176

+ : "w"(V1) \

6177

+ : /* No clobbers */);

6178

+

6179

/* { dg-final { scan-assembler-times "\\tadd\\tx\[0-9\]+" 2 } } */

6180

6181

uint64x1_t

6182

@@ -31,7 +37,12 @@

6183

uint64x1_t

6184

test_vceqd_s64 (int64x1_t a, int64x1_t b)

6185

{

6186

- return vceqd_s64 (a, b);

6187

+ uint64x1_t res;

6188

+ force_simd (a);

6189

+ force_simd (b);

6190

+ res = vceqd_s64 (a, b);

6191

+ force_simd (res);

6192

+ return res;

6193

}

6194

6195

/* { dg-final { scan-assembler-times "\\tcmeq\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6196

@@ -39,7 +50,11 @@

6197

uint64x1_t

6198

test_vceqzd_s64 (int64x1_t a)

6199

{

6200

- return vceqzd_s64 (a);

6201

+ uint64x1_t res;

6202

+ force_simd (a);

6203

+ res = vceqzd_s64 (a);

6204

+ force_simd (res);

6205

+ return res;

6206

}

6207

6208

/* { dg-final { scan-assembler-times "\\tcmge\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 2 } } */

6209

@@ -47,21 +62,36 @@

6210

uint64x1_t

6211

test_vcged_s64 (int64x1_t a, int64x1_t b)

6212

{

6213

- return vcged_s64 (a, b);

6214

+ uint64x1_t res;

6215

+ force_simd (a);

6216

+ force_simd (b);

6217

+ res = vcged_s64 (a, b);

6218

+ force_simd (res);

6219

+ return res;

6220

}

6221

6222

uint64x1_t

6223

test_vcled_s64 (int64x1_t a, int64x1_t b)

6224

{

6225

- return vcled_s64 (a, b);

6226

+ uint64x1_t res;

6227

+ force_simd (a);

6228

+ force_simd (b);

6229

+ res = vcled_s64 (a, b);

6230

+ force_simd (res);

6231

+ return res;

6232

}

6233

6234

-/* { dg-final { scan-assembler-times "\\tcmge\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6235

+/* Idiom recognition will cause this testcase not to generate

6236

+ the expected cmge instruction, so do not check for it. */

6237

6238

uint64x1_t

6239

test_vcgezd_s64 (int64x1_t a)

6240

{

6241

- return vcgezd_s64 (a);

6242

+ uint64x1_t res;

6243

+ force_simd (a);

6244

+ res = vcgezd_s64 (a);

6245

+ force_simd (res);

6246

+ return res;

6247

}

6248

6249

/* { dg-final { scan-assembler-times "\\tcmhs\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 1 } } */

6250

@@ -69,7 +99,12 @@

6251

uint64x1_t

6252

test_vcged_u64 (uint64x1_t a, uint64x1_t b)

6253

{

6254

- return vcged_u64 (a, b);

6255

+ uint64x1_t res;

6256

+ force_simd (a);

6257

+ force_simd (b);

6258

+ res = vcged_u64 (a, b);

6259

+ force_simd (res);

6260

+ return res;

6261

}

6262

6263

/* { dg-final { scan-assembler-times "\\tcmgt\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 2 } } */

6264

@@ -77,13 +112,23 @@

6265

uint64x1_t

6266

test_vcgtd_s64 (int64x1_t a, int64x1_t b)

6267

{

6268

- return vcgtd_s64 (a, b);

6269

+ uint64x1_t res;

6270

+ force_simd (a);

6271

+ force_simd (b);

6272

+ res = vcgtd_s64 (a, b);

6273

+ force_simd (res);

6274

+ return res;

6275

}

6276

6277

uint64x1_t

6278

test_vcltd_s64 (int64x1_t a, int64x1_t b)

6279

{

6280

- return vcltd_s64 (a, b);

6281

+ uint64x1_t res;

6282

+ force_simd (a);

6283

+ force_simd (b);

6284

+ res = vcltd_s64 (a, b);

6285

+ force_simd (res);

6286

+ return res;

6287

}

6288

6289

/* { dg-final { scan-assembler-times "\\tcmgt\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6290

@@ -91,7 +136,11 @@

6291

uint64x1_t

6292

test_vcgtzd_s64 (int64x1_t a)

6293

{

6294

- return vcgtzd_s64 (a);

6295

+ uint64x1_t res;

6296

+ force_simd (a);

6297

+ res = vcgtzd_s64 (a);

6298

+ force_simd (res);

6299

+ return res;

6300

}

6301

6302

/* { dg-final { scan-assembler-times "\\tcmhi\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 1 } } */

6303

@@ -99,7 +148,12 @@

6304

uint64x1_t

6305

test_vcgtd_u64 (uint64x1_t a, uint64x1_t b)

6306

{

6307

- return vcgtd_u64 (a, b);

6308

+ uint64x1_t res;

6309

+ force_simd (a);

6310

+ force_simd (b);

6311

+ res = vcgtd_u64 (a, b);

6312

+ force_simd (res);

6313

+ return res;

6314

}

6315

6316

/* { dg-final { scan-assembler-times "\\tcmle\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6317

@@ -107,15 +161,24 @@

6318

uint64x1_t

6319

test_vclezd_s64 (int64x1_t a)

6320

{

6321

- return vclezd_s64 (a);

6322

+ uint64x1_t res;

6323

+ force_simd (a);

6324

+ res = vclezd_s64 (a);

6325

+ force_simd (res);

6326

+ return res;

6327

}

6328

6329

-/* { dg-final { scan-assembler-times "\\tcmlt\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6330

+/* Idiom recognition will cause this testcase not to generate

6331

+ the expected cmlt instruction, so do not check for it. */

6332

6333

uint64x1_t

6334

test_vcltzd_s64 (int64x1_t a)

6335

{

6336

- return vcltzd_s64 (a);

6337

+ uint64x1_t res;

6338

+ force_simd (a);

6339

+ res = vcltzd_s64 (a);

6340

+ force_simd (res);

6341

+ return res;

6342

}

6343

6344

/* { dg-final { scan-assembler-times "\\tdup\\tb\[0-9\]+, v\[0-9\]+\.b" 2 } } */

6345

@@ -179,13 +242,23 @@

6346

int64x1_t

6347

test_vtst_s64 (int64x1_t a, int64x1_t b)

6348

{

6349

- return vtstd_s64 (a, b);

6350

+ uint64x1_t res;

6351

+ force_simd (a);

6352

+ force_simd (b);

6353

+ res = vtstd_s64 (a, b);

6354

+ force_simd (res);

6355

+ return res;

6356

}

6357

6358

uint64x1_t

6359

test_vtst_u64 (uint64x1_t a, uint64x1_t b)

6360

{

6361

- return vtstd_u64 (a, b);

6362

+ uint64x1_t res;

6363

+ force_simd (a);

6364

+ force_simd (b);

6365

+ res = vtstd_s64 (a, b);

6366

+ force_simd (res);

6367

+ return res;

6368

}

6369

6370

/* { dg-final { scan-assembler-times "\\taddp\\td\[0-9\]+, v\[0-9\]+\.2d" 1 } } */

6371

@@ -722,8 +795,11 @@

6372

return vrshld_u64 (a, b);

6373

}

6374

6375

-/* { dg-final { scan-assembler-times "\\tasr\\tx\[0-9\]+" 1 } } */

6376

+/* Other intrinsics can generate an asr instruction (vcltzd, vcgezd),

6377

+ so we cannot check scan-assembler-times. */

6378

6379

+/* { dg-final { scan-assembler "\\tasr\\tx\[0-9\]+" } } */

6380

+

6381

int64x1_t

6382

test_vshrd_n_s64 (int64x1_t a)

6383

{

6384

Index: gcc/testsuite/gcc.target/i386/pr59405.c

6385

===================================================================

6386

--- a/src/gcc/testsuite/gcc.target/i386/pr59405.c (.../tags/gcc_4_8_2_release)

6387

+++ b/src/gcc/testsuite/gcc.target/i386/pr59405.c (.../branches/gcc-4_8-branch)

6388

@@ -0,0 +1,24 @@

6389

+/* { dg-do run } */

6390

+/* { dg-options "-mmmx -mfpmath=387" } */

6391

+

6392

+#include "mmx-check.h"

6393

+

6394

+#include <mmintrin.h>

6395

+

6396

+typedef float float32x2_t __attribute__ ((vector_size (8)));

6397

+

6398

+float

6399

+foo32x2_be (float32x2_t x)

6400

+{

6401

+ _mm_empty ();

6402

+ return x[1];

6403

+}

6404

+

6405

+static void

6406

+mmx_test (void)

6407

+{

6408

+ float32x2_t b = { 0.0f, 1.0f };

6409

+

6410

+ if (foo32x2_be (b) != 1.0f)

6411

+ abort ();

6412

+}

6413

Index: gcc/testsuite/gcc.target/i386/avx-vzeroupper-17.c

6414

===================================================================

6415

--- a/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-17.c (.../tags/gcc_4_8_2_release)

6416

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-17.c (.../branches/gcc-4_8-branch)

6417

@@ -1,5 +1,5 @@

6418

/* { dg-do compile { target lp64 } } */

6419

-/* { dg-options "-O2 -mavx -mabi=ms -mtune=generic -dp" } */

6420

+/* { dg-options "-O2 -mavx -mabi=ms -maccumulate-outgoing-args -dp" } */

6421

6422

typedef float __m256 __attribute__ ((__vector_size__ (32), __may_alias__));

6423

6424

Index: gcc/testsuite/gcc.target/i386/pr59470.c

6425

===================================================================

6426

--- a/src/gcc/testsuite/gcc.target/i386/pr59470.c (.../tags/gcc_4_8_2_release)

6427

+++ b/src/gcc/testsuite/gcc.target/i386/pr59470.c (.../branches/gcc-4_8-branch)

6428

@@ -0,0 +1,17 @@

6429

+/* PR middle-end/58956 */

6430

+/* PR middle-end/59470 */

6431

+/* { dg-do run } */

6432

+/* { dg-options "-O2" } */

6433

+

6434

+int a, b, d[1024];

6435

+

6436

+int

6437

+main ()

6438

+{

6439

+ int c = a;

6440

+ asm ("{movl $6, (%2); movl $1, %0|mov dword ptr [%2], 6; mov %0, 1}"

6441

+ : "=r" (d[c]) : "rm" (b), "r" (&a) : "memory");

6442

+ if (d[0] != 1 || d[6] != 0)

6443

+ __builtin_abort ();

6444

+ return 0;

6445

+}

6446

Index: gcc/testsuite/gcc.target/i386/pr59034-1.c

6447

===================================================================

6448

--- a/src/gcc/testsuite/gcc.target/i386/pr59034-1.c (.../tags/gcc_4_8_2_release)

6449

+++ b/src/gcc/testsuite/gcc.target/i386/pr59034-1.c (.../branches/gcc-4_8-branch)

6450

@@ -0,0 +1,10 @@

6451

+/* { dg-do compile { target { ! { ia32 } } } } */

6452

+/* { dg-require-effective-target maybe_x32 } */

6453

+/* { dg-options "-O -mx32 -mtune=corei7 -maddress-mode=short" } */

6454

+

6455

+extern int foo(int, ...);

6456

+int bar(void) {

6457

+ long double l = 1.2345E6;

6458

+ foo(0, l);

6459

+ return 0;

6460

+}

6461

Index: gcc/testsuite/gcc.target/i386/pr58690.c

6462

===================================================================

6463

--- a/src/gcc/testsuite/gcc.target/i386/pr58690.c (.../tags/gcc_4_8_2_release)

6464

+++ b/src/gcc/testsuite/gcc.target/i386/pr58690.c (.../branches/gcc-4_8-branch)

6465

@@ -0,0 +1,14 @@

6466

+/* { dg-do compile { target { ! { ia32 } } } } */

6467

+/* { dg-require-effective-target maybe_x32 } */

6468

+/* { dg-options "-O2 -mx32 -maddress-mode=short" } */

6469

+

6470

+struct gomp_thread

6471

+{

6472

+ char foo[41];

6473

+};

6474

+extern __thread struct gomp_thread gomp_tls_data;

6475

+void

6476

+foo (void)

6477

+{

6478

+ __builtin_memset (&gomp_tls_data, '\0', sizeof (gomp_tls_data));

6479

+}

6480

Index: gcc/testsuite/gcc.target/i386/avx-vmovapd-256-2.c

6481

===================================================================

6482

--- a/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-2.c (.../tags/gcc_4_8_2_release)

6483

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-2.c (.../branches/gcc-4_8-branch)

6484

@@ -15,7 +15,7 @@

6485

avx_test (void)

6486

{

6487

union256d u;

6488

- double e [4] __attribute__ ((aligned (8))) = {0.0};

6489

+ double e [4] __attribute__ ((aligned (32))) = {0.0};

6490

6491

u.x = _mm256_set_pd (39578.467285, 7856.342941, 85632.783567, 47563.234215);

6492

6493

Index: gcc/testsuite/gcc.target/i386/pr57003.c

6494

===================================================================

6495

--- a/src/gcc/testsuite/gcc.target/i386/pr57003.c (.../tags/gcc_4_8_2_release)

6496

+++ b/src/gcc/testsuite/gcc.target/i386/pr57003.c (.../branches/gcc-4_8-branch)

6497

@@ -1,6 +1,6 @@

6498

/* PR rtl-optimization/57003 */

6499

/* { dg-do run } */

6500

-/* { dg-options "-O2" } */

6501

+/* { dg-options "-O2 -maccumulate-outgoing-args" } */

6502

6503

#define N 2001

6504

unsigned short *b, *c, *d;

6505

Index: gcc/testsuite/gcc.target/i386/avx-vzeroupper-18.c

6506

===================================================================

6507

--- a/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-18.c (.../tags/gcc_4_8_2_release)

6508

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-18.c (.../branches/gcc-4_8-branch)

6509

@@ -1,5 +1,5 @@

6510

/* { dg-do compile { target lp64 } } */

6511

-/* { dg-options "-O0 -mavx -mabi=ms -mtune=generic -dp" } */

6512

+/* { dg-options "-O0 -mavx -mabi=ms -maccumulate-outgoing-args -dp" } */

6513

6514

typedef float __m256 __attribute__ ((__vector_size__ (32), __may_alias__));

6515

6516

Index: gcc/testsuite/gcc.target/i386/sse2-movapd-1.c

6517

===================================================================

6518

--- a/src/gcc/testsuite/gcc.target/i386/sse2-movapd-1.c (.../tags/gcc_4_8_2_release)

6519

+++ b/src/gcc/testsuite/gcc.target/i386/sse2-movapd-1.c (.../branches/gcc-4_8-branch)

6520

@@ -25,7 +25,7 @@

6521

TEST (void)

6522

{

6523

union128d u;

6524

- double e[2] __attribute__ ((aligned (8))) = {2134.3343,1234.635654};

6525

+ double e[2] __attribute__ ((aligned (16))) = {2134.3343,1234.635654};

6526

6527

u.x = test (e);

6528

6529

Index: gcc/testsuite/gcc.target/i386/pr59021.c

6530

===================================================================

6531

--- a/src/gcc/testsuite/gcc.target/i386/pr59021.c (.../tags/gcc_4_8_2_release)

6532

+++ b/src/gcc/testsuite/gcc.target/i386/pr59021.c (.../branches/gcc-4_8-branch)

6533

@@ -0,0 +1,23 @@

6534

+/* { dg-do compile } */

6535

+/* { dg-options "-O2 -mavx -mvzeroupper" } */

6536

+

6537

+extern void abort (void);

6538

+

6539

+struct S {

6540

+ int i1;

6541

+ int i2;

6542

+ int i3;

6543

+};

6544

+

6545

+typedef double v4df __attribute__ ((vector_size (32)));

6546

+

6547

+extern int foo (v4df, int i1, int i2, int i3, int i4, int i5, struct S s);

6548

+

6549

+void bar (v4df v, struct S s)

6550

+{

6551

+ int r = foo (v, 1, 2, 3, 4, 5, s);

6552

+ if (r)

6553

+ abort ();

6554

+}

6555

+

6556

+/* { dg-final { scan-assembler-not "vzeroupper" } } */

6557

Index: gcc/testsuite/gcc.target/i386/pr59034-2.c

6558

===================================================================

6559

--- a/src/gcc/testsuite/gcc.target/i386/pr59034-2.c (.../tags/gcc_4_8_2_release)

6560

+++ b/src/gcc/testsuite/gcc.target/i386/pr59034-2.c (.../branches/gcc-4_8-branch)

6561

@@ -0,0 +1,10 @@

6562

+/* { dg-do compile { target { ! { ia32 } } } } */

6563

+/* { dg-require-effective-target maybe_x32 } */

6564

+/* { dg-options "-O -mx32 -mtune=corei7 -maddress-mode=long" } */

6565

+

6566

+extern int foo(int, ...);

6567

+int bar(void) {

6568

+ long double l = 1.2345E6;

6569

+ foo(0, l);

6570

+ return 0;

6571

+}

6572

Index: gcc/testsuite/gcc.target/i386/xop-frczX.c

6573

===================================================================

6574

--- a/src/gcc/testsuite/gcc.target/i386/xop-frczX.c (.../tags/gcc_4_8_2_release)

6575

+++ b/src/gcc/testsuite/gcc.target/i386/xop-frczX.c (.../branches/gcc-4_8-branch)

6576

@@ -0,0 +1,60 @@

6577

+/* { dg-do run } */

6578

+/* { dg-require-effective-target xop } */

6579

+/* { dg-options "-O2 -mxop" } */

6580

+

6581

+#include "xop-check.h"

6582

+

6583

+#include <x86intrin.h>

6584

+

6585

+void

6586

+check_mm_vmfrcz_sd (__m128d __A, __m128d __B)

6587

+{

6588

+ union128d a, b, c;

6589

+ double d[2];

6590

+

6591

+ a.x = __A;

6592

+ b.x = __B;

6593

+ c.x = _mm_frcz_sd (__A, __B);

6594

+ d[0] = b.a[0] - (int)b.a[0] ;

6595

+ d[1] = a.a[1];

6596

+ if (check_union128d (c, d))

6597

+ abort ();

6598

+}

6599

+

6600

+void

6601

+check_mm_vmfrcz_ss (__m128 __A, __m128 __B)

6602

+{

6603

+ union128 a, b, c;

6604

+ float f[4];

6605

+

6606

+ a.x = __A;

6607

+ b.x = __B;

6608

+ c.x = _mm_frcz_ss (__A, __B);

6609

+ f[0] = b.a[0] - (int)b.a[0] ;

6610

+ f[1] = a.a[1];

6611

+ f[2] = a.a[2];

6612

+ f[3] = a.a[3];

6613

+ if (check_union128 (c, f))

6614

+ abort ();

6615

+}

6616

+

6617

+static void

6618

+xop_test (void)

6619

+{

6620

+ union128 a, b;

6621

+ union128d c,d;

6622

+ int i;

6623

+

6624

+ for (i = 0; i < 4; i++)

6625

+ {

6626

+ a.a[i] = i + 3.5;

6627

+ b.a[i] = i + 7.9;

6628

+ }

6629

+ for (i = 0; i < 2; i++)

6630

+ {

6631

+ c.a[i] = i + 3.5;

6632

+ d.a[i] = i + 7.987654321;

6633

+ }

6634

+ check_mm_vmfrcz_ss (a.x, b.x);

6635

+ check_mm_vmfrcz_sd (c.x, d.x);

6636

+}

6637

Index: gcc/testsuite/gcc.target/i386/pr59625.c

6638

===================================================================

6639

--- a/src/gcc/testsuite/gcc.target/i386/pr59625.c (.../tags/gcc_4_8_2_release)

6640

+++ b/src/gcc/testsuite/gcc.target/i386/pr59625.c (.../branches/gcc-4_8-branch)

6641

@@ -0,0 +1,36 @@

6642

+/* PR target/59625 */

6643

+/* { dg-do compile } */

6644

+/* { dg-options "-O2 -mtune=atom" } */

6645

+

6646

+int

6647

+foo (void)

6648

+{

6649

+ asm goto ("" : : : : lab);

6650

+ asm goto ("" : : : : lab);

6651

+ asm goto ("" : : : : lab);

6652

+ asm goto ("" : : : : lab);

6653

+ asm goto ("" : : : : lab);

6654

+ asm goto ("" : : : : lab);

6655

+ asm goto ("" : : : : lab);

6656

+ asm goto ("" : : : : lab);

6657

+ asm goto ("" : : : : lab);

6658

+ asm goto ("" : : : : lab);

6659

+ asm goto ("" : : : : lab);

6660

+ asm goto ("" : : : : lab);

6661

+ asm goto ("" : : : : lab);

6662

+ asm goto ("" : : : : lab);

6663

+ asm goto ("" : : : : lab);

6664

+ asm goto ("" : : : : lab);

6665

+ asm goto ("" : : : : lab);

6666

+ asm goto ("" : : : : lab);

6667

+ asm goto ("" : : : : lab);

6668

+ asm goto ("" : : : : lab);

6669

+ return 0;

6670

+lab:

6671

+ return 1;

6672

+}

6673

+

6674

+/* Verify we don't consider asm goto as a jump for four jumps limit

6675

+ optimization. asm goto doesn't have to contain a jump at all,

6676

+ the branching to labels can happen through different means. */

6677

+/* { dg-final { scan-assembler-not "(p2align\[^\n\r\]*\[\n\r]*\[^\n\r\]*){8}p2align" } } */

6678

Index: gcc/testsuite/gcc.target/i386/sse2-movapd-2.c

6679

===================================================================

6680

--- a/src/gcc/testsuite/gcc.target/i386/sse2-movapd-2.c (.../tags/gcc_4_8_2_release)

6681

+++ b/src/gcc/testsuite/gcc.target/i386/sse2-movapd-2.c (.../branches/gcc-4_8-branch)

6682

@@ -25,7 +25,7 @@

6683

TEST (void)

6684

{

6685

union128d u;

6686

- double e[2] __attribute__ ((aligned (8))) = {0.0};

6687

+ double e[2] __attribute__ ((aligned (16))) = {0.0};

6688

6689

u.x = _mm_set_pd (2134.3343,1234.635654);

6690

6691

Index: gcc/testsuite/gcc.target/i386/pr58137.c

6692

===================================================================

6693

--- a/src/gcc/testsuite/gcc.target/i386/pr58137.c (.../tags/gcc_4_8_2_release)

6694

+++ b/src/gcc/testsuite/gcc.target/i386/pr58137.c (.../branches/gcc-4_8-branch)

6695

@@ -0,0 +1,33 @@

6696

+/* { dg-do compile } */

6697

+/* { dg-options "-O3 -mavx2" } */

6698

+

6699

+typedef unsigned int U32;

6700

+

6701

+struct sv {

6702

+ void* sv_any;

6703

+ U32 sv_refcnt;

6704

+ U32 sv_flags;

6705

+};

6706

+typedef struct sv SV;

6707

+

6708

+struct xrv {

6709

+ SV * xrv_rv;

6710

+};

6711

+typedef struct xrv XRV;

6712

+

6713

+extern XRV * PL_xrv_root;

6714

+

6715

+void

6716

+more_xrv (void)

6717

+{

6718

+ register XRV* xrv;

6719

+ register XRV* xrvend;

6720

+ xrv = PL_xrv_root;

6721

+ xrvend = &xrv[200 / sizeof (XRV) - 1];

6722

+ while (xrv < xrvend)

6723

+ {

6724

+ xrv->xrv_rv = (SV*)(xrv + 1);

6725

+ xrv++;

6726

+ }

6727

+ xrv->xrv_rv = 0;

6728

+}

6729

Index: gcc/testsuite/gcc.target/i386/avx-vzeroupper-16.c

6730

===================================================================

6731

--- a/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-16.c (.../tags/gcc_4_8_2_release)

6732

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-16.c (.../branches/gcc-4_8-branch)

6733

@@ -1,5 +1,5 @@

6734

/* { dg-do compile { target lp64 } } */

6735

-/* { dg-options "-O2 -mavx -mabi=ms -mtune=generic -dp" } */

6736

+/* { dg-options "-O2 -mavx -mabi=ms -maccumulate-outgoing-args -dp" } */

6737

6738

typedef float __m256 __attribute__ ((__vector_size__ (32), __may_alias__));

6739

6740

Index: gcc/testsuite/gcc.target/i386/pr30315.c

6741

===================================================================

6742

--- a/src/gcc/testsuite/gcc.target/i386/pr30315.c (.../tags/gcc_4_8_2_release)

6743

+++ b/src/gcc/testsuite/gcc.target/i386/pr30315.c (.../branches/gcc-4_8-branch)

6744

@@ -1,6 +1,6 @@

6745

/* { dg-do compile } */

6746

/* { dg-options "-O2" } */

6747

-/* { dg-final { scan-assembler-times "cmp" 4 } } */

6748

+/* { dg-final { scan-assembler-not "cmp" } } */

6749

6750

extern void abort (void);

6751

int c;

6752

@@ -34,39 +34,10 @@

6753

}

6754

#define PLUSCCONLY(T, t) PLUSCCONLY1(T, t, a) PLUSCCONLY1(T, t, b)

6755

6756

-#define MINUSCC(T, t) \

6757

-T minuscc##t (T a, T b) \

6758

-{ \

6759

- T difference = a - b; \

6760

- if (difference > a) \

6761

- abort (); \

6762

- return difference; \

6763

-}

6764

-

6765

-#define DECCC(T, t) \

6766

-T deccc##t (T a, T b) \

6767

-{ \

6768

- T difference = a - b; \

6769

- if (difference > a) \

6770

- c --; \

6771

- return difference; \

6772

-}

6773

-

6774

-#define MINUSCCONLY(T, t) \

6775

-void minuscconly##t (T a, T b) \

6776

-{ \

6777

- T difference = a - b; \

6778

- if (difference > a) \

6779

- abort (); \

6780

-}

6781

-

6782

#define TEST(T, t) \

6783

PLUSCC(T, t) \

6784

PLUSCCONLY(T, t) \

6785

- INCCC(T, t) \

6786

- MINUSCC(T, t) \

6787

- MINUSCCONLY(T, t) \

6788

- DECCC(T, t)

6789

+ INCCC(T, t)

6790

6791

TEST (unsigned long, l)

6792

TEST (unsigned int, i)

6793

@@ -84,14 +55,3 @@

6794

6795

PLUSCCZEXT(a)

6796

PLUSCCZEXT(b)

6797

-

6798

-#define MINUSCCZEXT \

6799

-unsigned long minuscczext (unsigned int a, unsigned int b) \

6800

-{ \

6801

- unsigned int difference = a - b; \

6802

- if (difference > a) \

6803

- abort (); \

6804

- return difference; \

6805

-}

6806

-

6807

-MINUSCCZEXT

6808

Index: gcc/testsuite/gcc.target/i386/pr43869.c

6809

===================================================================

6810

--- a/src/gcc/testsuite/gcc.target/i386/pr43869.c (.../tags/gcc_4_8_2_release)

6811

+++ b/src/gcc/testsuite/gcc.target/i386/pr43869.c (.../branches/gcc-4_8-branch)

6812

@@ -1,4 +1,5 @@

6813

/* { dg-do compile { target lp64 } } */

6814

+/* { dg-options "-maccumulate-outgoing-args" } */

6815

6816

int __attribute__((__noinline__))

6817

bugged(float f1, float f2, float f3, float f4,

6818

Index: gcc/testsuite/gcc.target/i386/pr43662.c

6819

===================================================================

6820

--- a/src/gcc/testsuite/gcc.target/i386/pr43662.c (.../tags/gcc_4_8_2_release)

6821

+++ b/src/gcc/testsuite/gcc.target/i386/pr43662.c (.../branches/gcc-4_8-branch)

6822

@@ -1,5 +1,5 @@

6823

/* { dg-do compile { target lp64 } } */

6824

-/* { dg-options "-O2" } */

6825

+/* { dg-options "-O2 -maccumulate-outgoing-args" } */

6826

6827

void __attribute__ ((ms_abi)) foo (void)

6828

{

6829

Index: gcc/testsuite/gcc.target/i386/avx-vmovapd-256-1.c

6830

===================================================================

6831

--- a/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-1.c (.../tags/gcc_4_8_2_release)

6832

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-1.c (.../branches/gcc-4_8-branch)

6833

@@ -15,7 +15,7 @@

6834

avx_test (void)

6835

{

6836

union256d u;

6837

- double e [4] __attribute__ ((aligned (8))) = {41124.234,2344.2354,8653.65635,856.43576};

6838

+ double e [4] __attribute__ ((aligned (32))) = {41124.234,2344.2354,8653.65635,856.43576};

6839

6840

u.x = test (e);

6841

6842

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/pr38891.c

6843

===================================================================

6844

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/pr38891.c (.../tags/gcc_4_8_2_release)

6845

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/pr38891.c (.../branches/gcc-4_8-branch)

6846

@@ -1,7 +1,7 @@

6847

/* Test for cross x86_64<->w64 abi standard calls.

6848

*/

6849

/* { dg-do compile } */

6850

-/* { dg-options "-mno-sse" } */

6851

+/* { dg-options "-mno-sse -maccumulate-outgoing-args" } */

6852

#include "callabi.h"

6853

6854

long double

6855

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-1.c

6856

===================================================================

6857

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-1.c (.../tags/gcc_4_8_2_release)

6858

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-1.c (.../branches/gcc-4_8-branch)

6859

@@ -2,7 +2,7 @@

6860

*/

6861

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6862

/* { dg-do run } */

6863

-/* { dg-options "-std=gnu99" } */

6864

+/* { dg-options "-std=gnu99 -maccumulate-outgoing-args" } */

6865

#include "callabi.h"

6866

6867

extern __SIZE_TYPE__ strlen (const char *);

6868

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-2.c

6869

===================================================================

6870

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-2.c (.../tags/gcc_4_8_2_release)

6871

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-2.c (.../branches/gcc-4_8-branch)

6872

@@ -2,7 +2,7 @@

6873

*/

6874

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6875

/* { dg-do run } */

6876

-/* { dg-options "-std=gnu99" } */

6877

+/* { dg-options "-std=gnu99 -maccumulate-outgoing-args" } */

6878

#include "callabi.h"

6879

6880

extern void abort (void);

6881

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-3.c

6882

===================================================================

6883

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-3.c (.../tags/gcc_4_8_2_release)

6884

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-3.c (.../branches/gcc-4_8-branch)

6885

@@ -2,7 +2,7 @@

6886

*/

6887

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6888

/* { dg-do run } */

6889

-/* { dg-options "-std=gnu99" } */

6890

+/* { dg-options "-std=gnu99 -maccumulate-outgoing-args" } */

6891

#include "callabi.h"

6892

6893

extern void abort (void);

6894

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4a.c

6895

===================================================================

6896

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4a.c (.../tags/gcc_4_8_2_release)

6897

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4a.c (.../branches/gcc-4_8-branch)

6898

@@ -1,6 +1,6 @@

6899

/* Test for cross x86_64<->w64 abi va_list calls. */

6900

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

6901

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6902

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6903

/* { dg-additional-sources "vaarg-4b.c" } */

6904

6905

extern __SIZE_TYPE__ __attribute__ ((sysv_abi)) strlen (const char *);

6906

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5a.c

6907

===================================================================

6908

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5a.c (.../tags/gcc_4_8_2_release)

6909

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5a.c (.../branches/gcc-4_8-branch)

6910

@@ -1,6 +1,6 @@

6911

/* Test for cross x86_64<->w64 abi va_list calls. */

6912

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

6913

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6914

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6915

/* { dg-additional-sources "vaarg-5b.c" } */

6916

6917

extern void __attribute__ ((sysv_abi)) abort (void);

6918

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4b.c

6919

===================================================================

6920

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4b.c (.../tags/gcc_4_8_2_release)

6921

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4b.c (.../branches/gcc-4_8-branch)

6922

@@ -1,5 +1,5 @@

6923

/* Test for cross x86_64<->w64 abi va_list calls. */

6924

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6925

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6926

6927

#include <stdarg.h>

6928

6929

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5b.c

6930

===================================================================

6931

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5b.c (.../tags/gcc_4_8_2_release)

6932

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5b.c (.../branches/gcc-4_8-branch)

6933

@@ -1,5 +1,5 @@

6934

/* Test for cross x86_64<->w64 abi va_list calls. */

6935

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6936

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6937

6938

#include <stdarg.h>

6939

6940

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-1.c

6941

===================================================================

6942

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-1.c (.../tags/gcc_4_8_2_release)

6943

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-1.c (.../branches/gcc-4_8-branch)

6944

@@ -1,5 +1,5 @@

6945

/* { dg-do compile } */

6946

-/* { dg-options "-O2 -mabi=sysv" } */

6947

+/* { dg-options "-O2 -mabi=sysv -maccumulate-outgoing-args" } */

6948

6949

__attribute__ ((ms_abi))

6950

int foo (void)

6951

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-2.c

6952

===================================================================

6953

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-2.c (.../tags/gcc_4_8_2_release)

6954

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-2.c (.../branches/gcc-4_8-branch)

6955

@@ -1,5 +1,5 @@

6956

/* { dg-do compile } */

6957

-/* { dg-options "-O2 -mabi=sysv" } */

6958

+/* { dg-options "-O2 -mabi=sysv -maccumulate-outgoing-args" } */

6959

6960

extern int glb1, gbl2, gbl3;

6961

6962

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-1.c

6963

===================================================================

6964

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-1.c (.../tags/gcc_4_8_2_release)

6965

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-1.c (.../branches/gcc-4_8-branch)

6966

@@ -2,7 +2,7 @@

6967

*/

6968

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6969

/* { dg-do run } */

6970

-/* { dg-options "-std=gnu99 -ffast-math" } */

6971

+/* { dg-options "-std=gnu99 -ffast-math -maccumulate-outgoing-args" } */

6972

#include "callabi.h"

6973

6974

extern void abort (void);

6975

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2a.c

6976

===================================================================

6977

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2a.c (.../tags/gcc_4_8_2_release)

6978

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2a.c (.../branches/gcc-4_8-branch)

6979

@@ -1,6 +1,6 @@

6980

/* Test for cross x86_64<->w64 abi standard calls via variable. */

6981

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

6982

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

6983

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

6984

/* { dg-additional-sources "func-indirect-2b.c" } */

6985

6986

extern void __attribute__ ((sysv_abi)) abort (void);

6987

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect.c

6988

===================================================================

6989

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect.c (.../tags/gcc_4_8_2_release)

6990

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect.c (.../branches/gcc-4_8-branch)

6991

@@ -2,7 +2,7 @@

6992

*/

6993

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6994

/* { dg-do run } */

6995

-/* { dg-options "-std=gnu99 -ffast-math" } */

6996

+/* { dg-options "-std=gnu99 -ffast-math -maccumulate-outgoing-args" } */

6997

#include "callabi.h"

6998

6999

extern void abort (void);

7000

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2a.c

7001

===================================================================

7002

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2a.c (.../tags/gcc_4_8_2_release)

7003

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2a.c (.../branches/gcc-4_8-branch)

7004

@@ -1,6 +1,6 @@

7005

/* Test for cross x86_64<->w64 abi standard calls. */

7006

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

7007

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

7008

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

7009

/* { dg-additional-sources "func-2b.c" } */

7010

7011

extern void __attribute__ ((sysv_abi)) abort (void);

7012

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2b.c

7013

===================================================================

7014

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2b.c (.../tags/gcc_4_8_2_release)

7015

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2b.c (.../branches/gcc-4_8-branch)

7016

@@ -1,5 +1,5 @@

7017

/* Test for cross x86_64<->w64 abi standard calls via variable. */

7018

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

7019

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

7020

7021

typedef int (*func)(void *, char *, char *, short, long long);

7022

7023

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2b.c

7024

===================================================================

7025

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2b.c (.../tags/gcc_4_8_2_release)

7026

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2b.c (.../branches/gcc-4_8-branch)

7027

@@ -1,5 +1,5 @@

7028

/* Test for cross x86_64<->w64 abi standard calls. */

7029

-/* { dg-options "-mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

7030

+/* { dg-options "-mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

7031

7032

long double func_cross (long double a, double b, float c, long d, int e,

7033

char f)

7034

Index: gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c

7035

===================================================================

7036

--- a/src/gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c (.../tags/gcc_4_8_2_release)

7037

+++ b/src/gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c (.../branches/gcc-4_8-branch)

7038

@@ -1,37 +0,0 @@

7039

-/* This checks the availability of the XL compiler intrinsics for

7040

- transactional execution with the expected prototypes. */

7041

-

7042

-/* { dg-do compile } */

7043

-/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7044

-

7045

-#include <htmxlintrin.h>

7046

-

7047

-int a = 0;

7048

-unsigned long g;

7049

-

7050

-int

7051

-foo ()

7052

-{

7053

- struct __htm_tdb *tdb_struct;

7054

- void * const tdb = tdb_struct;

7055

- long result;

7056

- unsigned char code;

7057

-

7058

- result = __TM_simple_begin ();

7059

- result = __TM_begin (tdb);

7060

- result = __TM_end ();

7061

- __TM_abort ();

7062

- __TM_named_abort (42);

7063

- __TM_non_transactional_store (&g, 42);

7064

- result = __TM_nesting_depth (tdb);

7065

-

7066

- result = __TM_is_user_abort (tdb);

7067

- result = __TM_is_named_user_abort (tdb, &code);

7068

- result = __TM_is_illegal (tdb);

7069

- result = __TM_is_footprint_exceeded (tdb);

7070

- result = __TM_is_nested_too_deep (tdb);

7071

- result = __TM_is_conflict (tdb);

7072

- result = __TM_is_failure_persistent (result);

7073

- result = __TM_failure_address (tdb);

7074

- result = __TM_failure_code (tdb);

7075

-}

7076

Index: gcc/testsuite/gcc.target/s390/htm-1.c

7077

===================================================================

7078

--- a/src/gcc/testsuite/gcc.target/s390/htm-1.c (.../tags/gcc_4_8_2_release)

7079

+++ b/src/gcc/testsuite/gcc.target/s390/htm-1.c (.../branches/gcc-4_8-branch)

7080

@@ -1,73 +0,0 @@

7081

-/* This checks the availability of the low-level builtins introduced

7082

- for transactional execution. */

7083

-

7084

-/* { dg-do compile } */

7085

-/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7086

-

7087

-#include <stdint.h>

7088

-#include <htmintrin.h>

7089

-

7090

-int global = 0;

7091

-uint64_t g;

7092

-struct __htm_tdb global_tdb;

7093

-

7094

-int

7095

-foo (struct __htm_tdb* tdb, int reg, int *mem, uint64_t *mem64)

7096

-{

7097

-

7098

- int cc;

7099

- int n;

7100

-

7101

- cc = __builtin_tbegin (0);

7102

- cc = __builtin_tbegin (tdb);

7103

- cc = __builtin_tbegin (&global_tdb);

7104

-

7105

- cc = __builtin_tbegin_nofloat (0);

7106

- cc = __builtin_tbegin_nofloat (&global_tdb);

7107

-

7108

- cc = __builtin_tbegin_retry (0, 42);

7109

- cc = __builtin_tbegin_retry (0, reg);

7110

- cc = __builtin_tbegin_retry (0, *mem);

7111

- cc = __builtin_tbegin_retry (0, global);

7112

- cc = __builtin_tbegin_retry (tdb, 42);

7113

- cc = __builtin_tbegin_retry (&global_tdb, 42);

7114

-

7115

- cc = __builtin_tbegin_retry_nofloat (0, 42);

7116

- cc = __builtin_tbegin_retry_nofloat (0, reg);

7117

- cc = __builtin_tbegin_retry_nofloat (0, *mem);

7118

- cc = __builtin_tbegin_retry_nofloat (0, global);

7119

- cc = __builtin_tbegin_retry_nofloat (&global_tdb, 42);

7120

-

7121

- __builtin_tbeginc ();

7122

-

7123

- n = __builtin_tx_nesting_depth();

7124

-

7125

- __builtin_non_tx_store(&g, 23);

7126

- __builtin_non_tx_store(mem64, 23);

7127

- __builtin_non_tx_store(&g, reg);

7128

- __builtin_non_tx_store(&g, *mem);

7129

- __builtin_non_tx_store(&g, global);

7130

-

7131

- __builtin_tabort (42 + 255);

7132

- __builtin_tabort (reg);

7133

- /* { dg-final { scan-assembler-times "tabort\t255" 1 } } */

7134

- __builtin_tabort (reg + 255);

7135

- __builtin_tabort (*mem);

7136

- __builtin_tabort (global);

7137

- /* Here global + 255 gets reloaded into a reg. Better would be to

7138

- just reload global or *mem and get the +255 for free as address

7139

- arithmetic. */

7140

- __builtin_tabort (*mem + 255);

7141

- __builtin_tabort (global + 255);

7142

-

7143

- __builtin_tend();

7144

-

7145

- __builtin_tx_assist (23);

7146

- __builtin_tx_assist (reg);

7147

- __builtin_tx_assist (*mem);

7148

- __builtin_tx_assist (global);

7149

-}

7150

-

7151

-/* Make sure the tdb NULL argument ends up as immediate value in the

7152

- instruction. */

7153

-/* { dg-final { scan-assembler-times "tbegin\t0," 10 } } */

7154

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c

7155

===================================================================

7156

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c (.../tags/gcc_4_8_2_release)

7157

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c (.../branches/gcc-4_8-branch)

7158

@@ -0,0 +1,27 @@

7159

+/* Functional tests for the function hotpatching feature. */

7160

+

7161

+/* { dg-do run } */

7162

+/* { dg-options "-O3 -mzarch -mhotpatch" } */

7163

+

7164

+#include <stdio.h>

7165

+

7166

+void hp1(void)

7167

+{

7168

+ printf("hello, world!\n");

7169

+}

7170

+

7171

+inline void hp2(void)

7172

+{

7173

+ printf("hello, world!\n");

7174

+}

7175

+

7176

+__attribute__ ((always_inline))

7177

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7178

+{

7179

+ printf("hello, world!\n");

7180

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7181

+

7182

+int main (void)

7183

+{

7184

+ return 0;

7185

+}

7186

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c

7187

===================================================================

7188

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c (.../tags/gcc_4_8_2_release)

7189

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c (.../branches/gcc-4_8-branch)

7190

@@ -0,0 +1,27 @@

7191

+/* Functional tests for the function hotpatching feature. */

7192

+

7193

+/* { dg-do run } */

7194

+/* { dg-options "-O3 -mzarch -mhotpatch=0" } */

7195

+

7196

+#include <stdio.h>

7197

+

7198

+void hp1(void)

7199

+{

7200

+ printf("hello, world!\n");

7201

+}

7202

+

7203

+inline void hp2(void)

7204

+{

7205

+ printf("hello, world!\n");

7206

+}

7207

+

7208

+__attribute__ ((always_inline))

7209

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7210

+{

7211

+ printf("hello, world!\n");

7212

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7213

+

7214

+int main (void)

7215

+{

7216

+ return 0;

7217

+}

7218

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c

7219

===================================================================

7220

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c (.../tags/gcc_4_8_2_release)

7221

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c (.../branches/gcc-4_8-branch)

7222

@@ -0,0 +1,27 @@

7223

+/* Functional tests for the function hotpatching feature. */

7224

+

7225

+/* { dg-do run } */

7226

+/* { dg-options "-O3 -mzarch -mhotpatch=1" } */

7227

+

7228

+#include <stdio.h>

7229

+

7230

+void hp1(void)

7231

+{

7232

+ printf("hello, world!\n");

7233

+}

7234

+

7235

+inline void hp2(void)

7236

+{

7237

+ printf("hello, world!\n");

7238

+}

7239

+

7240

+__attribute__ ((always_inline))

7241

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7242

+{

7243

+ printf("hello, world!\n");

7244

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7245

+

7246

+int main (void)

7247

+{

7248

+ return 0;

7249

+}

7250

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c

7251

===================================================================

7252

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c (.../tags/gcc_4_8_2_release)

7253

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c (.../branches/gcc-4_8-branch)

7254

@@ -0,0 +1,11 @@

7255

+/* Functional tests for the function hotpatching feature. */

7256

+

7257

+/* { dg-do compile } */

7258

+/* { dg-options "-O3 -mzarch -mhotpatch=-1" } */

7259

+

7260

+int main (void)

7261

+{

7262

+ return 0;

7263

+}

7264

+

7265

+/* { dg-excess-errors "argument to '-mhotpatch=' should be a non-negative integer" } */

7266

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c

7267

===================================================================

7268

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c (.../tags/gcc_4_8_2_release)

7269

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c (.../branches/gcc-4_8-branch)

7270

@@ -0,0 +1,28 @@

7271

+/* Functional tests for the function hotpatching feature. */

7272

+

7273

+/* { dg-do compile } */

7274

+/* { dg-options "-O3 -mzarch -mhotpatch=1000000" } */

7275

+

7276

+#include <stdio.h>

7277

+

7278

+void hp1(void)

7279

+{

7280

+ printf("hello, world!\n");

7281

+}

7282

+

7283

+__attribute__ ((hotpatch(1000000)))

7284

+void hp2(void)

7285

+{

7286

+ printf("hello, world!\n");

7287

+}

7288

+

7289

+__attribute__ ((hotpatch(1000001)))

7290

+void hp3(void)

7291

+{ /* { dg-error "requested 'hotpatch' attribute is not a non-negative integer constant or too large .max. 1000000." } */

7292

+ printf("hello, world!\n");

7293

+}

7294

+

7295

+int main (void)

7296

+{

7297

+ return 0;

7298

+}

7299

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c

7300

===================================================================

7301

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c (.../tags/gcc_4_8_2_release)

7302

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c (.../branches/gcc-4_8-branch)

7303

@@ -0,0 +1,11 @@

7304

+/* Functional tests for the function hotpatching feature. */

7305

+

7306

+/* { dg-do compile } */

7307

+/* { dg-options "-O3 -mzarch -mhotpatch=1000001" } */

7308

+

7309

+int main (void)

7310

+{

7311

+ return 0;

7312

+}

7313

+

7314

+/* { dg-excess-errors "argument to '-mhotpatch=' is too large .max. 1000000." } */

7315

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c

7316

===================================================================

7317

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c (.../tags/gcc_4_8_2_release)

7318

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c (.../branches/gcc-4_8-branch)

7319

@@ -0,0 +1,165 @@

7320

+/* This checks the availability of the low-level builtins introduced

7321

+ for transactional execution. */

7322

+

7323

+/* { dg-do compile } */

7324

+/* { dg-require-effective-target htm } */

7325

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7326

+

7327

+#include <stdint.h>

7328

+#include <htmintrin.h>

7329

+

7330

+int global = 0;

7331

+uint64_t g;

7332

+struct __htm_tdb global_tdb;

7333

+

7334

+int

7335

+foo (struct __htm_tdb* tdb, int reg, int *mem, uint64_t *mem64)

7336

+{

7337

+

7338

+ int cc;

7339

+ int n;

7340

+

7341

+ __builtin_tbegin ((void *)0);

7342

+ __builtin_tbegin ((void *)-99999);

7343

+ __builtin_tbegin ((void *)99999);

7344

+ while (__builtin_tbegin ((void *)0) != 0)

7345

+ {

7346

+ }

7347

+ cc = __builtin_tbegin ((void *)0x12345678);

7348

+ cc = __builtin_tbegin (tdb);

7349

+ cc = __builtin_tbegin (&global_tdb);

7350

+ cc = __builtin_tbegin ((void *)(long long)(reg + 0x12345678));

7351

+ cc = __builtin_tbegin ((void *)(long long)(reg));

7352

+

7353

+ __builtin_tbegin_nofloat ((void *)0);

7354

+ __builtin_tbegin_nofloat ((void *)-99999);

7355

+ __builtin_tbegin_nofloat ((void *)99999);

7356

+ cc = __builtin_tbegin_nofloat ((void *)0x12345678);

7357

+ cc = __builtin_tbegin_nofloat (tdb);

7358

+ cc = __builtin_tbegin_nofloat (&global_tdb);

7359

+ cc = __builtin_tbegin_nofloat ((void *)(long long)(reg + 0x12345678));

7360

+ cc = __builtin_tbegin_nofloat ((void *)(long long)(reg));

7361

+

7362

+ __builtin_tbegin_retry ((void *)0, 0);

7363

+ cc = __builtin_tbegin_retry ((void *)0, 1);

7364

+ cc = __builtin_tbegin_retry ((void *)0, -1);

7365

+ cc = __builtin_tbegin_retry ((void *)0, 42);

7366

+ cc = __builtin_tbegin_retry ((void *)0, reg);

7367

+ cc = __builtin_tbegin_retry ((void *)0, *mem);

7368

+ cc = __builtin_tbegin_retry ((void *)0, global);

7369

+ cc = __builtin_tbegin_retry (tdb, 42);

7370

+ cc = __builtin_tbegin_retry (&global_tdb, 42);

7371

+ cc = __builtin_tbegin_retry ((void *)0x12345678, global);

7372

+ cc = __builtin_tbegin_retry (

7373

+ (void *)(long long) (reg + 0x12345678), global + 1);

7374

+ cc = __builtin_tbegin_retry (

7375

+ (void *)(long long)(reg), global - 1);

7376

+

7377

+ __builtin_tbegin_retry_nofloat ((void *)0, 0);

7378

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, 1);

7379

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, -1);

7380

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, 42);

7381

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, reg);

7382

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, *mem);

7383

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, global);

7384

+ cc = __builtin_tbegin_retry_nofloat (tdb, 42);

7385

+ cc = __builtin_tbegin_retry_nofloat (&global_tdb, 42);

7386

+ cc = __builtin_tbegin_retry_nofloat ((void *)0x12345678, global);

7387

+ cc = __builtin_tbegin_retry_nofloat (

7388

+ (void *)(long long) (reg + 0x12345678), global + 1);

7389

+ cc = __builtin_tbegin_retry_nofloat (

7390

+ (void *)(long long)(reg), global - 1);

7391

+

7392

+ __builtin_tbeginc ();

7393

+

7394

+ __builtin_tx_nesting_depth ();

7395

+ n = __builtin_tx_nesting_depth ();

7396

+

7397

+ __builtin_non_tx_store (mem64, 0);

7398

+ {

7399

+ const uint64_t val_var = 0x1122334455667788;

7400

+

7401

+ __builtin_non_tx_store (mem64, val_var);

7402

+ }

7403

+ __builtin_non_tx_store (mem64, (uint64_t)reg);

7404

+ __builtin_non_tx_store (mem64, g);

7405

+ __builtin_non_tx_store ((uint64_t *)0, 0);

7406

+ __builtin_non_tx_store ((uint64_t *)0x12345678, 0);

7407

+ __builtin_non_tx_store (&g, 23);

7408

+ __builtin_non_tx_store (&g, reg);

7409

+ __builtin_non_tx_store (&g, *mem);

7410

+ __builtin_non_tx_store (&g, global);

7411

+

7412

+ __builtin_tend();

7413

+

7414

+ __builtin_tx_assist (0);

7415

+ __builtin_tx_assist (1);

7416

+ __builtin_tx_assist (reg);

7417

+ __builtin_tx_assist (*mem);

7418

+ __builtin_tx_assist (global);

7419

+}

7420

+

7421

+/* The taborts must go into separate function since they are

7422

+ "noreturn". */

7423

+

7424

+void

7425

+tabort1 ()

7426

+{

7427

+ __builtin_tabort (256);

7428

+}

7429

+

7430

+void

7431

+tabort2 (int reg)

7432

+{

7433

+ __builtin_tabort (reg);

7434

+}

7435

+

7436

+void

7437

+tabort3 (int reg)

7438

+{

7439

+ /* { dg-final { scan-assembler-times "tabort\t255" 1 } } */

7440

+ __builtin_tabort (reg + 255);

7441

+}

7442

+

7443

+void

7444

+tabort4 (int *mem)

7445

+{

7446

+ __builtin_tabort (*mem);

7447

+}

7448

+

7449

+void

7450

+tabort5 ()

7451

+{

7452

+ __builtin_tabort (global);

7453

+}

7454

+

7455

+void

7456

+tabort6 (int *mem)

7457

+{

7458

+ /* Here global + 255 gets reloaded into a reg. Better would be to

7459

+ just reload global or *mem and get the +255 for free as address

7460

+ arithmetic. */

7461

+ __builtin_tabort (*mem + 255);

7462

+}

7463

+

7464

+void

7465

+tabort7 ()

7466

+{

7467

+ __builtin_tabort (global + 255);

7468

+}

7469

+

7470

+void

7471

+tabort8 ()

7472

+{

7473

+ __builtin_tabort (-1);

7474

+}

7475

+

7476

+

7477

+/* Make sure the tdb NULL argument ends up as immediate value in the

7478

+ instruction. */

7479

+/* { dg-final { scan-assembler-times "tbegin\t0," 17 } } */

7480

+/* { dg-final { scan-assembler-times "tbegin\t" 41 } } */

7481

+/* Check number of occurences of certain instructions. */

7482

+/* { dg-final { scan-assembler-times "tbeginc\t" 1 } } */

7483

+/* { dg-final { scan-assembler-times "tabort\t" 8 } } */

7484

+/* { dg-final { scan-assembler "ppa\t" } } */

7485

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c

7486

===================================================================

7487

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c (.../tags/gcc_4_8_2_release)

7488

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c (.../branches/gcc-4_8-branch)

7489

@@ -0,0 +1,68 @@

7490

+/* Functional tests for the function hotpatching feature. */

7491

+

7492

+/* { dg-do run } */

7493

+/* { dg-options "-O3 -mzarch -mno-hotpatch" } */

7494

+

7495

+#include <stdio.h>

7496

+

7497

+__attribute__ ((hotpatch))

7498

+void hp1(void)

7499

+{

7500

+ printf("hello, world!\n");

7501

+}

7502

+

7503

+__attribute__ ((hotpatch))

7504

+inline void hp2(void)

7505

+{

7506

+ printf("hello, world!\n");

7507

+}

7508

+

7509

+__attribute__ ((hotpatch))

7510

+__attribute__ ((always_inline))

7511

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7512

+{

7513

+ printf("hello, world!\n");

7514

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7515

+

7516

+__attribute__ ((hotpatch(0)))

7517

+void hp4(void)

7518

+{

7519

+ printf("hello, world!\n");

7520

+}

7521

+

7522

+__attribute__ ((hotpatch(0)))

7523

+inline void hp5(void)

7524

+{

7525

+ printf("hello, world!\n");

7526

+}

7527

+

7528

+__attribute__ ((hotpatch(0)))

7529

+__attribute__ ((always_inline))

7530

+void hp6(void) /* { dg-warning "always_inline function might not be inlinable" } */

7531

+{

7532

+ printf("hello, world!\n");

7533

+} /* { dg-warning "function 'hp6' with the 'always_inline' attribute is not hotpatchable" } */

7534

+

7535

+__attribute__ ((hotpatch(1)))

7536

+void hp7(void)

7537

+{

7538

+ printf("hello, world!\n");

7539

+}

7540

+

7541

+__attribute__ ((hotpatch(1)))

7542

+inline void hp8(void)

7543

+{

7544

+ printf("hello, world!\n");

7545

+}

7546

+

7547

+__attribute__ ((hotpatch(1)))

7548

+__attribute__ ((always_inline))

7549

+void hp9(void) /* { dg-warning "always_inline function might not be inlinable" } */

7550

+{

7551

+ printf("hello, world!\n");

7552

+} /* { dg-warning "function 'hp9' with the 'always_inline' attribute is not hotpatchable" } */

7553

+

7554

+int main (void)

7555

+{

7556

+ return 0;

7557

+}

7558

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c

7559

===================================================================

7560

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c (.../tags/gcc_4_8_2_release)

7561

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c (.../branches/gcc-4_8-branch)

7562

@@ -0,0 +1,13 @@

7563

+/* { dg-do compile } */

7564

+/* { dg-require-effective-target htm } */

7565

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7566

+

7567

+void must_not_compile1 (void)

7568

+{

7569

+ __builtin_tabort (0); /* { dg-error "Invalid transaction abort code:" } */

7570

+}

7571

+

7572

+void must_not_compile2 (void)

7573

+{

7574

+ __builtin_tabort (255); /* { dg-error "Invalid transaction abort code:" } */

7575

+}

7576

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c

7577

===================================================================

7578

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c (.../tags/gcc_4_8_2_release)

7579

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c (.../branches/gcc-4_8-branch)

7580

@@ -0,0 +1,37 @@

7581

+/* This checks the availability of the XL compiler intrinsics for

7582

+ transactional execution with the expected prototypes. */

7583

+

7584

+/* { dg-do compile } */

7585

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7586

+

7587

+#include <htmxlintrin.h>

7588

+

7589

+int a = 0;

7590

+unsigned long g;

7591

+

7592

+int

7593

+foo ()

7594

+{

7595

+ struct __htm_tdb *tdb_struct;

7596

+ void * const tdb = tdb_struct;

7597

+ long result;

7598

+ unsigned char code;

7599

+

7600

+ result = __TM_simple_begin ();

7601

+ result = __TM_begin (tdb);

7602

+ result = __TM_end ();

7603

+ __TM_abort ();

7604

+ __TM_named_abort (42);

7605

+ __TM_non_transactional_store (&g, 42);

7606

+ result = __TM_nesting_depth (tdb);

7607

+

7608

+ result = __TM_is_user_abort (tdb);

7609

+ result = __TM_is_named_user_abort (tdb, &code);

7610

+ result = __TM_is_illegal (tdb);

7611

+ result = __TM_is_footprint_exceeded (tdb);

7612

+ result = __TM_is_nested_too_deep (tdb);

7613

+ result = __TM_is_conflict (tdb);

7614

+ result = __TM_is_failure_persistent (result);

7615

+ result = __TM_failure_address (tdb);

7616

+ result = __TM_failure_code (tdb);

7617

+}

7618

Index: gcc/testsuite/gcc.target/s390/s390.exp

7619

===================================================================

7620

--- a/src/gcc/testsuite/gcc.target/s390/s390.exp (.../tags/gcc_4_8_2_release)

7621

+++ b/src/gcc/testsuite/gcc.target/s390/s390.exp (.../branches/gcc-4_8-branch)

7622

@@ -24,6 +24,19 @@

7623

# Load support procs.

7624

load_lib gcc-dg.exp

7625

7626

+# Return 1 if htm (etnd - extract nesting depth) instructions can be

7627

+# compiled.

7628

+proc check_effective_target_htm { } {

7629

+ if { ![check_runtime s390_check_htm [subst {

7630

+ int main (void)

7631

+ {

7632

+ unsigned int nd = 77;

7633

+ asm (".insn rre,0xb2ec0000,%0,0" : "=d" (nd));

7634

+ return nd;

7635

+ }

7636

+ }]] } { return 0 } else { return 1 }

7637

+}

7638

+

7639

# If a testcase doesn't have special options, use these.

7640

global DEFAULT_CFLAGS

7641

if ![info exists DEFAULT_CFLAGS] then {

7642

Index: gcc/testsuite/gcc.target/s390/hotpatch-1.c

7643

===================================================================

7644

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-1.c (.../tags/gcc_4_8_2_release)

7645

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-1.c (.../branches/gcc-4_8-branch)

7646

@@ -0,0 +1,20 @@

7647

+/* Functional tests for the function hotpatching feature. */

7648

+

7649

+/* { dg-do run } */

7650

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7651

+

7652

+#include <stdio.h>

7653

+

7654

+void hp1(void)

7655

+{

7656

+ printf("hello, world!\n");

7657

+}

7658

+

7659

+int main (void)

7660

+{

7661

+ return 0;

7662

+}

7663

+

7664

+/* Check number of occurences of certain instructions. */

7665

+/* { dg-final { scan-assembler-times "nopr\t%r7" 12 } } */

7666

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7667

Index: gcc/testsuite/gcc.target/s390/hotpatch-2.c

7668

===================================================================

7669

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-2.c (.../tags/gcc_4_8_2_release)

7670

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-2.c (.../branches/gcc-4_8-branch)

7671

@@ -0,0 +1,20 @@

7672

+/* Functional tests for the function hotpatching feature. */

7673

+

7674

+/* { dg-do run } */

7675

+/* { dg-options "-O3 -mzarch -mhotpatch=1 --save-temps" } */

7676

+

7677

+#include <stdio.h>

7678

+

7679

+void hp1(void)

7680

+{

7681

+ printf("hello, world!\n");

7682

+}

7683

+

7684

+int main (void)

7685

+{

7686

+ return 0;

7687

+}

7688

+

7689

+/* Check number of occurences of certain instructions. */

7690

+/* { dg-final { scan-assembler-times "nopr\t%r7" 1 } } */

7691

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7692

Index: gcc/testsuite/gcc.target/s390/hotpatch-3.c

7693

===================================================================

7694

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-3.c (.../tags/gcc_4_8_2_release)

7695

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-3.c (.../branches/gcc-4_8-branch)

7696

@@ -0,0 +1,20 @@

7697

+/* Functional tests for the function hotpatching feature. */

7698

+

7699

+/* { dg-do run } */

7700

+/* { dg-options "-O3 -mzarch -mhotpatch=0 --save-temps" } */

7701

+

7702

+#include <stdio.h>

7703

+

7704

+void hp1(void)

7705

+{

7706

+ printf("hello, world!\n");

7707

+}

7708

+

7709

+int main (void)

7710

+{

7711

+ return 0;

7712

+}

7713

+

7714

+/* Check number of occurences of certain instructions. */

7715

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

7716

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7717

Index: gcc/testsuite/gcc.target/s390/hotpatch-4.c

7718

===================================================================

7719

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-4.c (.../tags/gcc_4_8_2_release)

7720

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-4.c (.../branches/gcc-4_8-branch)

7721

@@ -0,0 +1,26 @@

7722

+/* Functional tests for the function hotpatching feature. */

7723

+

7724

+/* { dg-do run } */

7725

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7726

+

7727

+#include <stdio.h>

7728

+

7729

+inline void hp1(void)

7730

+{

7731

+ printf("hello, world!\n");

7732

+}

7733

+

7734

+__attribute__ ((always_inline))

7735

+void hp2(void) /* { dg-warning "always_inline function might not be inlinable" } */

7736

+{

7737

+ printf("hello, world!\n");

7738

+} /* { dg-warning "function 'hp2' with the 'always_inline' attribute is not hotpatchable" } */

7739

+

7740

+int main (void)

7741

+{

7742

+ return 0;

7743

+}

7744

+

7745

+/* Check number of occurences of certain instructions. */

7746

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

7747

+/* { dg-final { scan-assembler-not "nop\t0" } } */

7748

Index: gcc/testsuite/gcc.target/s390/hotpatch-5.c

7749

===================================================================

7750

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-5.c (.../tags/gcc_4_8_2_release)

7751

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-5.c (.../branches/gcc-4_8-branch)

7752

@@ -0,0 +1,21 @@

7753

+/* Functional tests for the function hotpatching feature. */

7754

+

7755

+/* { dg-do run } */

7756

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7757

+

7758

+#include <stdio.h>

7759

+

7760

+__attribute__ ((hotpatch))

7761

+void hp1(void)

7762

+{

7763

+ printf("hello, world!\n");

7764

+}

7765

+

7766

+int main (void)

7767

+{

7768

+ return 0;

7769

+}

7770

+

7771

+/* Check number of occurences of certain instructions. */

7772

+/* { dg-final { scan-assembler-times "nopr\t%r7" 12 } } */

7773

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7774

Index: gcc/testsuite/gcc.target/s390/hotpatch-6.c

7775

===================================================================

7776

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-6.c (.../tags/gcc_4_8_2_release)

7777

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-6.c (.../branches/gcc-4_8-branch)

7778

@@ -0,0 +1,21 @@

7779

+/* Functional tests for the function hotpatching feature. */

7780

+

7781

+/* { dg-do run } */

7782

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7783

+

7784

+#include <stdio.h>

7785

+

7786

+__attribute__ ((hotpatch(1)))

7787

+void hp1(void)

7788

+{

7789

+ printf("hello, world!\n");

7790

+}

7791

+

7792

+int main (void)

7793

+{

7794

+ return 0;

7795

+}

7796

+

7797

+/* Check number of occurences of certain instructions. */

7798

+/* { dg-final { scan-assembler-times "nopr\t%r7" 1 } } */

7799

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7800

Index: gcc/testsuite/gcc.target/s390/htm-builtins-1.c

7801

===================================================================

7802

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-1.c (.../tags/gcc_4_8_2_release)

7803

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-1.c (.../branches/gcc-4_8-branch)

7804

@@ -0,0 +1,1073 @@

7805

+/* Functional tests of the htm __builtin_... macros. */

7806

+

7807

+/* { dg-do run } */

7808

+/* { dg-require-effective-target htm } */

7809

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7810

+

7811

+/* ---------------------------- included header files ---------------------- */

7812

+

7813

+#include <stdio.h>

7814

+#include <string.h>

7815

+#include <stdint.h>

7816

+#include <htmintrin.h>

7817

+

7818

+/* ---------------------------- local definitions -------------------------- */

7819

+

7820

+#define DEFAULT_MAX_REPETITIONS 5

7821

+#define DEFAULT_REQUIRED_QUORUM ((DEFAULT_MAX_REPETITIONS) - 1)

7822

+#define NUM_WARMUP_RUNS 10

7823

+

7824

+/* ---------------------------- local macros ------------------------------- */

7825

+

7826

+#define TEST_DF_REP(name) \

7827

+ { #name, name, DEFAULT_MAX_REPETITIONS, DEFAULT_REQUIRED_QUORUM }

7828

+#define TEST_NO_REP(name) { #name, name, 1, 1 }

7829

+

7830

+/* ---------------------------- local types -------------------------------- */

7831

+

7832

+typedef int (*test_func_t)(void);

7833

+

7834

+typedef struct

7835

+{

7836

+ const char *name;

7837

+ test_func_t test_func;

7838

+ int max_repetitions;

7839

+ int required_quorum;

7840

+} test_table_entry_t;

7841

+

7842

+/* ---------------------------- local variables ---------------------------- */

7843

+

7844

+__attribute__ ((aligned(256))) static struct __htm_tdb local_tdb256;

7845

+static struct __htm_tdb local_tdb;

7846

+static int do_dump_tdb = 0;

7847

+

7848

+/* ---------------------------- exported variables (globals) --------------- */

7849

+

7850

+__attribute__ ((aligned(256))) struct

7851

+{

7852

+ float float_1;

7853

+ float float_2;

7854

+ float float_3;

7855

+} global = { 1.0, 2.5, 0.0 };

7856

+

7857

+__attribute__ ((aligned(256))) struct

7858

+{

7859

+ volatile uint64_t c1;

7860

+ volatile uint64_t c2;

7861

+ volatile uint64_t c3;

7862

+} counters = { 0, 0, 0 };

7863

+

7864

+/* ---------------------------- local helper functions --------------------- */

7865

+

7866

+static void dump_tdb (struct __htm_tdb *tdb)

7867

+{

7868

+ unsigned char *p;

7869

+ int i;

7870

+ int j;

7871

+

7872

+ if (do_dump_tdb == 0)

7873

+ {

7874

+ return;

7875

+ }

7876

+ p = (unsigned char *)tdb;

7877

+ for (i = 0; i < 16; i++)

7878

+ {

7879

+ fprintf (stderr, "0x%02x ", i * 16);

7880

+ for (j = 0; j < 16; j++)

7881

+ {

7882

+ fprintf (stderr, "%02x", (int)p[i * 16 + j]);

7883

+ if (j < 15)

7884

+ {

7885

+ fprintf (stderr, " ");

7886

+ }

7887

+ if (j == 7)

7888

+ {

7889

+ fprintf (stderr, " ");

7890

+ }

7891

+ }

7892

+ fprintf (stderr, "\n");

7893

+ }

7894

+

7895

+ return;

7896

+}

7897

+

7898

+/* ---------------------------- local test functions ----------------------- */

7899

+

7900

+/* Check values of the constants defined in htmintrin.h. */

7901

+static int test_constants (void)

7902

+{

7903

+ if (_HTM_TBEGIN_STARTED != 0)

7904

+ {

7905

+ return 100 * _HTM_TBEGIN_STARTED + 1;

7906

+ }

7907

+ if (_HTM_TBEGIN_INDETERMINATE != 1)

7908

+ {

7909

+ return 100 * _HTM_TBEGIN_INDETERMINATE + 2;

7910

+ }

7911

+ if (_HTM_TBEGIN_TRANSIENT != 2)

7912

+ {

7913

+ return 100 * _HTM_TBEGIN_TRANSIENT + 3;

7914

+ }

7915

+ if (_HTM_TBEGIN_PERSISTENT != 3)

7916

+ {

7917

+ return 100 * _HTM_TBEGIN_PERSISTENT + 4;

7918

+ }

7919

+

7920

+ return 0;

7921

+}

7922

+

7923

+static int test_tbegin_ntstg_tend (void)

7924

+{

7925

+ int rc;

7926

+

7927

+ counters.c1 = 0;

7928

+ counters.c2 = 0;

7929

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

7930

+ {

7931

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

7932

+ counters.c2 = 2;

7933

+ rc = __builtin_tend ();

7934

+ if (rc != 0)

7935

+ {

7936

+ return 100 * rc + 5;

7937

+ }

7938

+ if (counters.c1 != 1)

7939

+ {

7940

+ return 100 * counters.c1 + 2;

7941

+ }

7942

+ if (counters.c2 != 2)

7943

+ {

7944

+ return 100 * counters.c2 + 3;

7945

+ }

7946

+ }

7947

+ else

7948

+ {

7949

+ return 100 * rc + 4;

7950

+ }

7951

+

7952

+ return 0;

7953

+}

7954

+

7955

+static int test_tbegin_ntstg_tabort (void)

7956

+{

7957

+ float f;

7958

+

7959

+ counters.c1 = 0;

7960

+ counters.c2 = 0;

7961

+ f = 0;

7962

+ if (__builtin_tbegin ((void *)0) == 0)

7963

+ {

7964

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

7965

+ counters.c2 = 2;

7966

+ f = 1;

7967

+ __builtin_tabort (256);

7968

+ return 1;

7969

+ }

7970

+ if (counters.c1 != 1)

7971

+ {

7972

+ return 100 * counters.c1 + 2;

7973

+ }

7974

+ if (counters.c2 != 0)

7975

+ {

7976

+ return 100 * counters.c2 + 3;

7977

+ }

7978

+ if (f != 0)

7979

+ {

7980

+ return 100 * f + 4;

7981

+ }

7982

+

7983

+ return 0;

7984

+}

7985

+

7986

+static int test_tbegin_nofloat (void)

7987

+{

7988

+ int rc;

7989

+

7990

+ counters.c1 = 0;

7991

+ counters.c2 = 0;

7992

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

7993

+ {

7994

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

7995

+ counters.c2 = 2;

7996

+ rc = __builtin_tend ();

7997

+ if (rc != 0)

7998

+ {

7999

+ return 100 * rc + 5;

8000

+ }

8001

+ if (counters.c1 != 1)

8002

+ {

8003

+ return 100 * counters.c1 + 2;

8004

+ }

8005

+ if (counters.c2 != 2)

8006

+ {

8007

+ return 100 * counters.c2 + 3;

8008

+ }

8009

+ }

8010

+ else

8011

+ {

8012

+ return 100 * rc + 4;

8013

+ }

8014

+

8015

+ return 0;

8016

+}

8017

+

8018

+static int test_tbegin_retry (void)

8019

+{

8020

+ int rc;

8021

+

8022

+ counters.c1 = 0;

8023

+ counters.c2 = 0;

8024

+ counters.c3 = 0;

8025

+ if ((rc = __builtin_tbegin_retry ((void *)0, 5)) == 0)

8026

+ {

8027

+ int do_abort;

8028

+

8029

+ do_abort = (counters.c1 == 0) ? 1 : 0;

8030

+ __builtin_non_tx_store (

8031

+ (uint64_t *)&counters.c1, counters.c1 + 1);

8032

+ if (do_abort == 1)

8033

+ {

8034

+ __builtin_tabort (256);

8035

+ }

8036

+ counters.c2 = counters.c2 + 10;

8037

+ __builtin_non_tx_store ((uint64_t *)&counters.c3, 3);

8038

+ rc = __builtin_tend ();

8039

+ if (rc != 0)

8040

+ {

8041

+ return 100 * rc + 5;

8042

+ }

8043

+ if (counters.c1 != 2)

8044

+ {

8045

+ return 100 * counters.c1 + 2;

8046

+ }

8047

+ if (counters.c2 != 10)

8048

+ {

8049

+ return 100 * counters.c2 + 3;

8050

+ }

8051

+ if (counters.c3 != 3)

8052

+ {

8053

+ return 100 * counters.c3 + 6;

8054

+ }

8055

+ }

8056

+ else

8057

+ {

8058

+ return 100 * rc + 4;

8059

+ }

8060

+

8061

+ return 0;

8062

+}

8063

+

8064

+static int test_tbegin_retry_nofloat (void)

8065

+{

8066

+ int rc;

8067

+

8068

+ counters.c1 = 0;

8069

+ counters.c2 = 0;

8070

+ counters.c3 = 0;

8071

+ if ((rc = __builtin_tbegin_retry_nofloat ((void *)0, 5)) == 0)

8072

+ {

8073

+ int do_abort;

8074

+

8075

+ do_abort = (counters.c1 == 0) ? 1 : 0;

8076

+ __builtin_non_tx_store (

8077

+ (uint64_t *)&counters.c1, counters.c1 + 1);

8078

+ if (do_abort == 1)

8079

+ {

8080

+ __builtin_tabort (256);

8081

+ }

8082

+ counters.c2 = counters.c2 + 10;

8083

+ __builtin_non_tx_store ((uint64_t *)&counters.c3, 3);

8084

+ rc = __builtin_tend ();

8085

+ if (rc != 0)

8086

+ {

8087

+ return 100 * rc + 5;

8088

+ }

8089

+ if (counters.c1 != 2)

8090

+ {

8091

+ return 100 * counters.c1 + 2;

8092

+ }

8093

+ if (counters.c2 != 10)

8094

+ {

8095

+ return 100 * counters.c2 + 3;

8096

+ }

8097

+ if (counters.c3 != 3)

8098

+ {

8099

+ return 100 * counters.c3 + 6;

8100

+ }

8101

+ }

8102

+ else

8103

+ {

8104

+ return 100 * rc + 4;

8105

+ }

8106

+

8107

+ return 0;

8108

+}

8109

+

8110

+static int test_tbegin_aborts (void)

8111

+{

8112

+ float f;

8113

+ int rc;

8114

+

8115

+ f = 77;

8116

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8117

+ {

8118

+ f = 88;

8119

+ __builtin_tabort (256);

8120

+ return 2;

8121

+ }

8122

+ else if (rc != 2)

8123

+ {

8124

+ return 3;

8125

+ }

8126

+ if (f != 77)

8127

+ {

8128

+ return 4;

8129

+ }

8130

+ f = 66;

8131

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8132

+ {

8133

+ f = 99;

8134

+ __builtin_tabort (257);

8135

+ return 5;

8136

+ }

8137

+ else if (rc != 3)

8138

+ {

8139

+ return 100 * rc + 6;

8140

+ }

8141

+ if (f != 66)

8142

+ {

8143

+ return 100 * f + 7;

8144

+ }

8145

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8146

+ {

8147

+ global.float_3 = global.float_1 + global.float_2;

8148

+ rc = __builtin_tend ();

8149

+ if (rc != 0)

8150

+ {

8151

+ return 100 * rc + 8;

8152

+ }

8153

+ }

8154

+ else

8155

+ {

8156

+ return 100 * rc + 9;

8157

+ }

8158

+ if (global.float_3 != global.float_1 + global.float_2)

8159

+ {

8160

+ return 100 * rc + 10;

8161

+ }

8162

+

8163

+ return 0;

8164

+}

8165

+

8166

+static __attribute__((noinline)) void indirect_abort(int abort_code)

8167

+{

8168

+ __builtin_tabort (abort_code);

8169

+

8170

+ return;

8171

+}

8172

+

8173

+static int test_tbegin_indirect_aborts (void)

8174

+{

8175

+ float f;

8176

+ int rc;

8177

+

8178

+ f = 77;

8179

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8180

+ {

8181

+ f = 88;

8182

+ indirect_abort(256);

8183

+ return 2;

8184

+ }

8185

+ else if (rc != 2)

8186

+ {

8187

+ return 100 * rc + 3;

8188

+ }

8189

+ if (f != 77)

8190

+ {

8191

+ return 100 * rc + 4;

8192

+ }

8193

+ f = 66;

8194

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8195

+ {

8196

+ f = 99;

8197

+ indirect_abort(257);

8198

+ return 5;

8199

+ }

8200

+ else if (rc != 3)

8201

+ {

8202

+ return 100 * rc + 6;

8203

+ }

8204

+ if (f != 66)

8205

+ {

8206

+ return 100 * f + 7;

8207

+ }

8208

+

8209

+ return 0;

8210

+}

8211

+

8212

+static int test_tbegin_nofloat_aborts (void)

8213

+{

8214

+ int rc;

8215

+

8216

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8217

+ {

8218

+ __builtin_tabort (256);

8219

+ return 2;

8220

+ }

8221

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8222

+ {

8223

+ __builtin_tabort (257);

8224

+ return 1005;

8225

+ }

8226

+ else if (rc != 3)

8227

+ {

8228

+ return 1000 * rc + 6;

8229

+ }

8230

+

8231

+ return 0;

8232

+}

8233

+

8234

+static int test_tbegin_nofloat_indirect_aborts (void)

8235

+{

8236

+ int rc;

8237

+

8238

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8239

+ {

8240

+ indirect_abort (256);

8241

+ return 2;

8242

+ }

8243

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8244

+ {

8245

+ indirect_abort (257);

8246

+ return 1005;

8247

+ }

8248

+ else if (rc != 3)

8249

+ {

8250

+ return 1000 * rc + 6;

8251

+ }

8252

+

8253

+ return 0;

8254

+}

8255

+

8256

+static

8257

+int _test_tbegin_retry_aborts (int retries, uint64_t abort_code)

8258

+{

8259

+ int rc;

8260

+

8261

+ counters.c1 = 0;

8262

+ if ((rc = __builtin_tbegin_retry ((void *)0, retries)) == 0)

8263

+ {

8264

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, counters.c1 + 1);

8265

+ __builtin_tabort (abort_code);

8266

+ return 2;

8267

+ }

8268

+ else

8269

+ {

8270

+ if ((abort_code & 1) == 0)

8271

+ {

8272

+ if (rc != 2)

8273

+ {

8274

+ return 100 * rc + 2003;

8275

+ }

8276

+ else if (counters.c1 != (uint64_t)retries + 1)

8277

+ {

8278

+ return 1000 * counters.c1 + 100 * retries + 4;

8279

+ }

8280

+ }

8281

+ else

8282

+ {

8283

+ if (rc != 3)

8284

+ {

8285

+ return 100 * rc + 3005;

8286

+ }

8287

+ else if (counters.c1 != 1)

8288

+ {

8289

+ return 1000 * counters.c1 + 100 * retries + 6;

8290

+ }

8291

+ }

8292

+ }

8293

+

8294

+ return 0;

8295

+}

8296

+

8297

+static int test_tbegin_retry_aborts (void)

8298

+{

8299

+ int rc;

8300

+ int retries;

8301

+

8302

+ for (retries = 1; retries <= 3; retries++)

8303

+ {

8304

+ rc = _test_tbegin_retry_aborts (retries, 256);

8305

+ if (rc != 0)

8306

+ {

8307

+ return 10000 + rc;

8308

+ }

8309

+ }

8310

+ for (retries = 1; retries <= 3; retries++)

8311

+ {

8312

+ rc = _test_tbegin_retry_aborts (retries, 257);

8313

+ if (rc != 0)

8314

+ {

8315

+ return 20000 + rc;

8316

+ }

8317

+ }

8318

+ if ((rc = __builtin_tbegin_retry ((void *)0, 5)) == 0)

8319

+ {

8320

+ global.float_3 = global.float_1 + global.float_2;

8321

+ rc = __builtin_tend ();

8322

+ if (rc != 0)

8323

+ {

8324

+ return 30000 + 100 * rc + 6;

8325

+ }

8326

+ }

8327

+ else

8328

+ {

8329

+ return 30000 + 100 * rc + 7;

8330

+ }

8331

+

8332

+ return 0;

8333

+}

8334

+

8335

+static int _test_tbegin_retry_nofloat_aborts (int retries, uint64_t abort_code)

8336

+{

8337

+ int rc;

8338

+

8339

+ counters.c1 = 0;

8340

+ if ((rc = __builtin_tbegin_retry_nofloat ((void *)0, retries)) == 0)

8341

+ {

8342

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, counters.c1 + 1);

8343

+ __builtin_tabort (abort_code);

8344

+ return 2;

8345

+ }

8346

+ else

8347

+ {

8348

+ if ((abort_code & 1) == 0)

8349

+ {

8350

+ if (rc != 2)

8351

+ {

8352

+ return 100 * rc + 2003;

8353

+ }

8354

+ else if (counters.c1 != (uint64_t)retries + 1)

8355

+ {

8356

+ return 1000 * counters.c1 + 100 * retries + 4;

8357

+ }

8358

+ }

8359

+ else

8360

+ {

8361

+ if (rc != 3)

8362

+ {

8363

+ return 100 * rc + 3005;

8364

+ }

8365

+ else if (counters.c1 != 1)

8366

+ {

8367

+ return 1000 * counters.c1 + 100 * retries + 6;

8368

+ }

8369

+ }

8370

+ }

8371

+

8372

+ return 0;

8373

+}

8374

+

8375

+static int test_tbegin_retry_nofloat_aborts (void)

8376

+{

8377

+ int rc;

8378

+ int retries;

8379

+

8380

+ for (retries = 1; retries <= 3; retries++)

8381

+ {

8382

+ rc = _test_tbegin_retry_nofloat_aborts (retries, 256);

8383

+ if (rc != 0)

8384

+ {

8385

+ return 10 * retries + rc;

8386

+ }

8387

+ }

8388

+ for (retries = 1; retries <= 3; retries++)

8389

+ {

8390

+ rc = _test_tbegin_retry_nofloat_aborts (retries, 257);

8391

+ if (rc != 0)

8392

+ {

8393

+ return 10000 + 10 * retries + rc;

8394

+ }

8395

+ }

8396

+

8397

+ return 0;

8398

+}

8399

+

8400

+static int test_tbegin_tdb (void)

8401

+{

8402

+ int rc;

8403

+

8404

+ local_tdb.format = 0;

8405

+ if ((rc = __builtin_tbegin (&local_tdb)) == 0)

8406

+ {

8407

+ rc = __builtin_tend ();

8408

+ if (rc != 0)

8409

+ {

8410

+ return 100 * rc + 1;

8411

+ }

8412

+ if (local_tdb.format != 0)

8413

+ {

8414

+ dump_tdb (&local_tdb);

8415

+ return 100 * local_tdb.format + 2;

8416

+ }

8417

+ }

8418

+ else

8419

+ {

8420

+ return 100 * rc + 3;

8421

+ }

8422

+ local_tdb.format = 0;

8423

+ if ((rc = __builtin_tbegin (&local_tdb)) == 0)

8424

+ {

8425

+ __builtin_tabort (257);

8426

+ return 4;

8427

+ }

8428

+ else

8429

+ {

8430

+ if (rc != 3)

8431

+ {

8432

+ return 100 * rc + 5;

8433

+ }

8434

+ if (local_tdb.format != 1)

8435

+ {

8436

+ dump_tdb (&local_tdb);

8437

+ return 100 * local_tdb.format + 6;

8438

+ }

8439

+ }

8440

+ local_tdb256.format = 0;

8441

+ if ((rc = __builtin_tbegin (&local_tdb256)) == 0)

8442

+ {

8443

+ rc = __builtin_tend ();

8444

+ if (rc != 0)

8445

+ {

8446

+ return 1100 * rc + 1;

8447

+ }

8448

+ if (local_tdb256.format != 0)

8449

+ {

8450

+ dump_tdb (&local_tdb256);

8451

+ return 1100 * local_tdb256.format + 2;

8452

+ }

8453

+ }

8454

+ else

8455

+ {

8456

+ return 1100 * rc + 3;

8457

+ }

8458

+ local_tdb256.format = 0;

8459

+ if ((rc = __builtin_tbegin (&local_tdb256)) == 0)

8460

+ {

8461

+ __builtin_tabort (257);

8462

+ return 2004;

8463

+ }

8464

+ else

8465

+ {

8466

+ if (rc != 3)

8467

+ {

8468

+ return 2100 * rc + 5;

8469

+ }

8470

+ if (local_tdb256.format != 1)

8471

+ {

8472

+ dump_tdb (&local_tdb256);

8473

+ return 2100 * local_tdb256.format + 6;

8474

+ }

8475

+ }

8476

+

8477

+ return 0;

8478

+}

8479

+

8480

+static int test_tbegin_nofloat_tdb (void)

8481

+{

8482

+ int rc;

8483

+

8484

+ local_tdb.format = 0;

8485

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb)) == 0)

8486

+ {

8487

+ rc = __builtin_tend ();

8488

+ if (rc != 0)

8489

+ {

8490

+ return 100 * rc + 1;

8491

+ }

8492

+ if (local_tdb.format != 0)

8493

+ {

8494

+ dump_tdb (&local_tdb);

8495

+ return 100 * local_tdb.format + 2;

8496

+ }

8497

+ }

8498

+ else

8499

+ {

8500

+ return 3;

8501

+ }

8502

+ local_tdb.format = 0;

8503

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb)) == 0)

8504

+ {

8505

+ __builtin_tabort (257);

8506

+ return 4;

8507

+ }

8508

+ else

8509

+ {

8510

+ if (rc != 3)

8511

+ {

8512

+ return 100 * rc + 5;

8513

+ }

8514

+ if (local_tdb.format != 1)

8515

+ {

8516

+ dump_tdb (&local_tdb);

8517

+ return 100 * local_tdb.format + 6;

8518

+ }

8519

+ }

8520

+ local_tdb256.format = 0;

8521

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb256)) == 0)

8522

+ {

8523

+ rc = __builtin_tend ();

8524

+ if (rc != 0)

8525

+ {

8526

+ return 1100 * rc + 1;

8527

+ }

8528

+ if (local_tdb256.format != 0)

8529

+ {

8530

+ dump_tdb (&local_tdb256);

8531

+ return 1100 * local_tdb256.format + 2;

8532

+ }

8533

+ }

8534

+ else

8535

+ {

8536

+ return 1003;

8537

+ }

8538

+ local_tdb256.format = 0;

8539

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb256)) == 0)

8540

+ {

8541

+ __builtin_tabort (257);

8542

+ return 2004;

8543

+ }

8544

+ else

8545

+ {

8546

+ if (rc != 3)

8547

+ {

8548

+ return 2100 * rc + 5;

8549

+ }

8550

+ if (local_tdb256.format != 1)

8551

+ {

8552

+ dump_tdb (&local_tdb256);

8553

+ return 2100 * local_tdb256.format + 6;

8554

+ }

8555

+ }

8556

+

8557

+ return 0;

8558

+}

8559

+

8560

+static int test_tbegin_retry_tdb (void)

8561

+{

8562

+ int rc;

8563

+

8564

+ local_tdb256.format = 0;

8565

+ if ((rc = __builtin_tbegin_retry (&local_tdb256, 2)) == 0)

8566

+ {

8567

+ rc = __builtin_tend ();

8568

+ if (rc != 0)

8569

+ {

8570

+ return 1100 * rc + 1;

8571

+ }

8572

+ if (local_tdb256.format != 0)

8573

+ {

8574

+ dump_tdb (&local_tdb256);

8575

+ return 1100 * local_tdb256.format + 2;

8576

+ }

8577

+ }

8578

+ else

8579

+ {

8580

+ return 1003;

8581

+ }

8582

+ local_tdb256.format = 0;

8583

+ if ((rc = __builtin_tbegin_retry (&local_tdb256, 2)) == 0)

8584

+ {

8585

+ __builtin_tabort (257);

8586

+ return 2004;

8587

+ }

8588

+ else

8589

+ {

8590

+ if (rc != 3)

8591

+ {

8592

+ return 2100 * rc + 5;

8593

+ }

8594

+ if (local_tdb256.format != 1)

8595

+ {

8596

+ dump_tdb (&local_tdb256);

8597

+ return 2100 * local_tdb256.format + 6;

8598

+ }

8599

+ }

8600

+

8601

+ return 0;

8602

+}

8603

+

8604

+static int test_tbegin_retry_nofloat_tdb (void)

8605

+{

8606

+ int rc;

8607

+

8608

+ local_tdb.format = 0;

8609

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb, 2)) == 0)

8610

+ {

8611

+ rc = __builtin_tend ();

8612

+ if (rc != 0)

8613

+ {

8614

+ return 100 * rc + 1;

8615

+ }

8616

+ if (local_tdb.format != 0)

8617

+ {

8618

+ dump_tdb (&local_tdb);

8619

+ return 100 * local_tdb.format + 2;

8620

+ }

8621

+ }

8622

+ else

8623

+ {

8624

+ return 100 * rc + 3;

8625

+ }

8626

+ local_tdb.format = 0;

8627

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb, 2)) == 0)

8628

+ {

8629

+ __builtin_tabort (257);

8630

+ return 4;

8631

+ }

8632

+ else

8633

+ {

8634

+ if (rc != 3)

8635

+ {

8636

+ return 100 * rc + 5;

8637

+ }

8638

+ if (local_tdb.format != 1)

8639

+ {

8640

+ dump_tdb (&local_tdb);

8641

+ return 100 * local_tdb.format + 6;

8642

+ }

8643

+ }

8644

+ local_tdb256.format = 0;

8645

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb256, 2)) == 0)

8646

+ {

8647

+ rc = __builtin_tend ();

8648

+ if (rc != 0)

8649

+ {

8650

+ return 1100 * rc + 1;

8651

+ }

8652

+ if (local_tdb256.format != 0)

8653

+ {

8654

+ dump_tdb (&local_tdb256);

8655

+ return 1100 * local_tdb256.format + 2;

8656

+ }

8657

+ }

8658

+ else

8659

+ {

8660

+ return 1100 * rc + 3;

8661

+ }

8662

+ local_tdb256.format = 0;

8663

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb256, 2)) == 0)

8664

+ {

8665

+ __builtin_tabort (257);

8666

+ return 2004;

8667

+ }

8668

+ else

8669

+ {

8670

+ if (rc != 3)

8671

+ {

8672

+ return 2100 * rc + 5;

8673

+ }

8674

+ if (local_tdb256.format != 1)

8675

+ {

8676

+ dump_tdb (&local_tdb256);

8677

+ return 2100 * local_tdb256.format + 6;

8678

+ }

8679

+ }

8680

+

8681

+ return 0;

8682

+}

8683

+

8684

+static int test_etnd (void)

8685

+{

8686

+ int rc;

8687

+

8688

+ counters.c1 = 0;

8689

+ counters.c2 = 0;

8690

+ counters.c3 = 0;

8691

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8692

+ {

8693

+ counters.c1 = __builtin_tx_nesting_depth ();

8694

+ if (__builtin_tbegin ((void *)0) == 0)

8695

+ {

8696

+ counters.c2 = __builtin_tx_nesting_depth ();

8697

+ if (__builtin_tbegin ((void *)0) == 0)

8698

+ {

8699

+ counters.c3 = __builtin_tx_nesting_depth ();

8700

+ __builtin_tend ();

8701

+ }

8702

+ __builtin_tend ();

8703

+ }

8704

+ __builtin_tend ();

8705

+ }

8706

+ else

8707

+ {

8708

+ return 100 * rc + 1;

8709

+ }

8710

+ if (counters.c1 != 1)

8711

+ {

8712

+ return 100 * counters.c1 + 2;

8713

+ }

8714

+ if (counters.c2 != 2)

8715

+ {

8716

+ return 100 * counters.c2 + 3;

8717

+ }

8718

+ if (counters.c3 != 3)

8719

+ {

8720

+ return 100 * counters.c3 + 4;

8721

+ }

8722

+

8723

+ return 0;

8724

+}

8725

+

8726

+static int test_tbeginc (void)

8727

+{

8728

+ int rc;

8729

+

8730

+ counters.c1 = 0;

8731

+ __builtin_tbeginc ();

8732

+ counters.c1 = 1;

8733

+ rc = __builtin_tend ();

8734

+ if (rc != 0)

8735

+ {

8736

+ return 10000 * rc + 1;

8737

+ }

8738

+ if (counters.c1 != 1)

8739

+ {

8740

+ return 100000 * counters.c1 + 3;

8741

+ }

8742

+

8743

+ return 0;

8744

+}

8745

+

8746

+/* ---------------------------- local testing framework functions ---------- */

8747

+

8748

+static int run_one_test (const test_table_entry_t *test_entry)

8749

+{

8750

+ int do_print_passes;

8751

+ int succeeded;

8752

+ int rc;

8753

+ int i;

8754

+

8755

+ /* Warmup run to get all necessary data and instruction pages into the page

8756

+ * tables. */

8757

+ {

8758

+ int run;

8759

+

8760

+ do_dump_tdb = 0;

8761

+ for (run = 0; run < NUM_WARMUP_RUNS; run++)

8762

+ {

8763

+ test_entry->test_func ();

8764

+ }

8765

+ do_dump_tdb = 1;

8766

+ }

8767

+ do_print_passes = (

8768

+ test_entry->required_quorum != 1 ||

8769

+ test_entry->max_repetitions != 1);

8770

+ printf ("RRR RUN %s\n", test_entry->name);

8771

+ if (do_print_passes == 1)

8772

+ {

8773

+ printf (

8774

+ " (requires %d successful out of %d runs)\n",

8775

+ test_entry->required_quorum,

8776

+ test_entry->max_repetitions);

8777

+ }

8778

+ succeeded = 0;

8779

+ rc = 0;

8780

+ for (rc = 0, i = 0; i < test_entry->max_repetitions; i++)

8781

+ {

8782

+ if (do_print_passes == 1)

8783

+ {

8784

+ if (i == 0)

8785

+ {

8786

+ printf (" ");

8787

+ }

8788

+ else

8789

+ {

8790

+ printf (",");

8791

+ }

8792

+ }

8793

+ rc = test_entry->test_func ();

8794

+ if (rc == 0)

8795

+ {

8796

+ if (do_print_passes == 1)

8797

+ {

8798

+ printf (" success");

8799

+ }

8800

+ succeeded++;

8801

+ if (succeeded >= test_entry->required_quorum)

8802

+ {

8803

+ break;

8804

+ }

8805

+ }

8806

+ else

8807

+ {

8808

+ printf (" failed (rc = %d)", rc);

8809

+ }

8810

+ }

8811

+ if (do_print_passes == 1 || rc != 0)

8812

+ {

8813

+ printf ("\n");

8814

+ }

8815

+ if (succeeded >= test_entry->required_quorum)

8816

+ {

8817

+ printf ("+++ OK %s\n", test_entry->name);

8818

+

8819

+ return 0;

8820

+ }

8821

+ else

8822

+ {

8823

+ printf ("--- FAIL %s\n", test_entry->name);

8824

+

8825

+ return (rc != 0) ? rc : -1;

8826

+ }

8827

+}

8828

+

8829

+static int run_all_tests (const test_table_entry_t *test_table)

8830

+{

8831

+ const test_table_entry_t *test;

8832

+ int rc;

8833

+

8834

+ for (

8835

+ rc = 0, test = &test_table[0];

8836

+ test->test_func != NULL && rc == 0; test++)

8837

+ {

8838

+ rc = run_one_test (test);

8839

+ }

8840

+

8841

+ return rc;

8842

+}

8843

+

8844

+/* ---------------------------- interface functions ------------------------ */

8845

+

8846

+int main (void)

8847

+{

8848

+ const test_table_entry_t test_table[] = {

8849

+ TEST_NO_REP (test_constants),

8850

+ TEST_DF_REP (test_tbegin_ntstg_tend),

8851

+ TEST_DF_REP (test_tbegin_ntstg_tabort),

8852

+ TEST_DF_REP (test_tbegin_nofloat),

8853

+ TEST_NO_REP (test_tbegin_retry),

8854

+ TEST_NO_REP (test_tbegin_retry_nofloat),

8855

+ TEST_DF_REP (test_tbegin_aborts),

8856

+ TEST_DF_REP (test_tbegin_indirect_aborts),

8857

+ TEST_DF_REP (test_tbegin_nofloat_aborts),

8858

+ TEST_DF_REP (test_tbegin_nofloat_indirect_aborts),

8859

+ TEST_NO_REP (test_tbegin_retry_aborts),

8860

+ TEST_NO_REP (test_tbegin_retry_nofloat_aborts),

8861

+ TEST_DF_REP (test_tbegin_tdb),

8862

+ TEST_DF_REP (test_tbegin_nofloat_tdb),

8863

+ TEST_NO_REP (test_tbegin_retry_tdb),

8864

+ TEST_NO_REP (test_tbegin_retry_nofloat_tdb),

8865

+ TEST_DF_REP (test_etnd),

8866

+ TEST_DF_REP (test_tbeginc),

8867

+ { (void *)0, 0, 0 }

8868

+ };

8869

+

8870

+ {

8871

+ int rc;

8872

+

8873

+ rc = run_all_tests (test_table);

8874

+

8875

+ return rc;

8876

+ }

8877

+}

8878

Index: gcc/testsuite/gcc.target/s390/hotpatch-7.c

8879

===================================================================

8880

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-7.c (.../tags/gcc_4_8_2_release)

8881

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-7.c (.../branches/gcc-4_8-branch)

8882

@@ -0,0 +1,21 @@

8883

+/* Functional tests for the function hotpatching feature. */

8884

+

8885

+/* { dg-do run } */

8886

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

8887

+

8888

+#include <stdio.h>

8889

+

8890

+__attribute__ ((hotpatch(0)))

8891

+void hp1(void)

8892

+{

8893

+ printf("hello, world!\n");

8894

+}

8895

+

8896

+int main (void)

8897

+{

8898

+ return 0;

8899

+}

8900

+

8901

+/* Check number of occurences of certain instructions. */

8902

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

8903

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

8904

Index: gcc/testsuite/gcc.target/s390/htm-builtins-2.c

8905

===================================================================

8906

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-2.c (.../tags/gcc_4_8_2_release)

8907

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-2.c (.../branches/gcc-4_8-branch)

8908

@@ -0,0 +1,682 @@

8909

+/* Functional tests of the htm __TM_... macros. */

8910

+

8911

+/* { dg-do run } */

8912

+/* { dg-require-effective-target htm } */

8913

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

8914

+

8915

+/* ---------------------------- included header files ---------------------- */

8916

+

8917

+#include <stdio.h>

8918

+#include <string.h>

8919

+#include <inttypes.h>

8920

+#include <htmxlintrin.h>

8921

+

8922

+/* ---------------------------- local definitions -------------------------- */

8923

+

8924

+#define DEFAULT_MAX_REPETITIONS 5

8925

+#define DEFAULT_REQUIRED_QUORUM ((DEFAULT_MAX_REPETITIONS) - 1)

8926

+#define DEFAULT_ABORT_ADDRESS (0x12345678u)

8927

+

8928

+/* ---------------------------- local macros ------------------------------- */

8929

+

8930

+#define TEST_DF_REP(name) \

8931

+ { #name, name, DEFAULT_MAX_REPETITIONS, DEFAULT_REQUIRED_QUORUM }

8932

+#define TEST_NO_REP(name) { #name, name, 1, 1 }

8933

+

8934

+/* ---------------------------- local types -------------------------------- */

8935

+

8936

+typedef int (*test_func_t)(void);

8937

+

8938

+typedef struct

8939

+{

8940

+ const char *name;

8941

+ test_func_t test_func;

8942

+ int max_repetitions;

8943

+ int required_quorum;

8944

+} test_table_entry_t;

8945

+

8946

+typedef enum

8947

+{

8948

+ ABORT_T_SYSTEM = 0,

8949

+ ABORT_T_USER = 1,

8950

+} abort_user_t;

8951

+

8952

+typedef enum

8953

+{

8954

+ ABORT_T_NONE = 0,

8955

+ ABORT_T_ILLEGAL,

8956

+ ABORT_T_FOOTPRINT_EXCEEDED,

8957

+ ABORT_T_NESTED_TOO_DEEP,

8958

+ ABORT_T_CONFLICT,

8959

+

8960

+ ABORT_T_INVALID_ABORT_CODE

8961

+} abort_t;

8962

+

8963

+/* ---------------------------- local variables ---------------------------- */

8964

+

8965

+__attribute__ ((aligned(256))) static struct __htm_tdb local_tdb256;

8966

+static struct __htm_tdb local_tdb;

8967

+

8968

+static abort_t const abort_classes[] =

8969

+{

8970

+ ABORT_T_INVALID_ABORT_CODE,

8971

+ ABORT_T_NONE,

8972

+ ABORT_T_NONE,

8973

+ ABORT_T_NONE,

8974

+

8975

+ ABORT_T_ILLEGAL,

8976

+ ABORT_T_NONE,

8977

+ ABORT_T_NONE,

8978

+ ABORT_T_FOOTPRINT_EXCEEDED,

8979

+

8980

+ ABORT_T_FOOTPRINT_EXCEEDED,

8981

+ ABORT_T_CONFLICT,

8982

+ ABORT_T_CONFLICT,

8983

+ ABORT_T_ILLEGAL,

8984

+

8985

+ ABORT_T_NONE,

8986

+ ABORT_T_NESTED_TOO_DEEP,

8987

+ ABORT_T_NONE,

8988

+ ABORT_T_NONE,

8989

+

8990

+ ABORT_T_NONE

8991

+};

8992

+

8993

+static size_t num_abort_classes = sizeof(abort_classes) / sizeof(abort_t);

8994

+

8995

+/* ---------------------------- exported variables (globals) --------------- */

8996

+

8997

+int global_int = 0;

8998

+uint64_t global_u64 = 0;

8999

+float global_float_1 = 1.0;

9000

+float global_float_2 = 2.5;

9001

+float global_float_3 = 0.0;

9002

+__attribute__ ((aligned(256))) struct

9003

+{

9004

+ volatile uint64_t c1;

9005

+ volatile uint64_t c2;

9006

+ volatile uint64_t c3;

9007

+} counters = { 0, 0, 0 };

9008

+

9009

+/* ---------------------------- local helper functions --------------------- */

9010

+

9011

+static void dump_tdb(struct __htm_tdb *tdb)

9012

+{

9013

+ unsigned char *p;

9014

+ int i;

9015

+ int j;

9016

+

9017

+ p = (unsigned char *)tdb;

9018

+ for (i = 0; i < 16; i++)

9019

+ {

9020

+ fprintf(stderr, "0x%02x ", i * 16);

9021

+ for (j = 0; j < 16; j++)

9022

+ {

9023

+ fprintf(stderr, "%02x", (int)p[i * 16 + j]);

9024

+ if (j < 15)

9025

+ {

9026

+ fprintf(stderr, " ");

9027

+ }

9028

+ if (j == 7)

9029

+ {

9030

+ fprintf(stderr, " ");

9031

+ }

9032

+ }

9033

+ fprintf(stderr, "\n");

9034

+ }

9035

+

9036

+ return;

9037

+}

9038

+

9039

+static void make_fake_tdb(struct __htm_tdb *tdb)

9040

+{

9041

+ memset(tdb, 0, sizeof(*tdb));

9042

+ tdb->format = 1;

9043

+ tdb->nesting_depth = 1;

9044

+ tdb->atia = DEFAULT_ABORT_ADDRESS;

9045

+ tdb->abort_code = 11;

9046

+

9047

+ return;

9048

+}

9049

+

9050

+static int check_abort_code_in_tdb(struct __htm_tdb *tdb, uint64_t abort_code)

9051

+{

9052

+ long expect_rc;

9053

+ long rc;

9054

+

9055

+ if (abort_code != 0)

9056

+ {

9057

+ long addr;

9058

+

9059

+ addr = __TM_failure_address(&local_tdb);

9060

+ if (addr != DEFAULT_ABORT_ADDRESS)

9061

+ {

9062

+ return 11;

9063

+ }

9064

+ }

9065

+ {

9066

+ long long tdb_abort_code;

9067

+

9068

+ tdb_abort_code = __TM_failure_code(tdb);

9069

+ if ((uint64_t)tdb_abort_code != abort_code)

9070

+ {

9071

+ fprintf(

9072

+ stderr, "tm_ac %" PRIu64 ", ac %" PRIu64

9073

+ ", tdb_ac %" PRIu64 "\n",

9074

+ (uint64_t)tdb_abort_code, abort_code,

9075

+ (uint64_t)tdb->abort_code);

9076

+ return 10;

9077

+ }

9078

+ }

9079

+ expect_rc = (abort_code >= 256) ? 1 : 0;

9080

+ rc = __TM_is_user_abort(tdb);

9081

+ if (rc != expect_rc)

9082

+ {

9083

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9084

+ return 1;

9085

+ }

9086

+ {

9087

+ unsigned char code;

9088

+

9089

+ code = 0xffu;

9090

+ rc = __TM_is_named_user_abort(tdb, &code);

9091

+ if (rc != expect_rc)

9092

+ {

9093

+ fprintf(

9094

+ stderr, "rc %ld, expect_rc %ld\n", rc,

9095

+ expect_rc);

9096

+ return 2;

9097

+ }

9098

+ if (expect_rc == 1 && code != abort_code - 256)

9099

+ {

9100

+ return 3;

9101

+ }

9102

+ }

9103

+ if (abort_code > (uint64_t)num_abort_classes)

9104

+ {

9105

+ abort_code = (uint64_t)num_abort_classes;

9106

+ }

9107

+ expect_rc = (abort_classes[abort_code] == ABORT_T_ILLEGAL) ? 1 : 0;

9108

+ rc = __TM_is_illegal(tdb);

9109

+ if (rc != expect_rc)

9110

+ {

9111

+ dump_tdb(tdb);

9112

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9113

+ return 4;

9114

+ }

9115

+ expect_rc =

9116

+ (abort_classes[abort_code] == ABORT_T_FOOTPRINT_EXCEEDED) ?

9117

+ 1 : 0;

9118

+ rc = __TM_is_footprint_exceeded(tdb);

9119

+ if (rc != expect_rc)

9120

+ {

9121

+ dump_tdb(tdb);

9122

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9123

+ return 5;

9124

+ }

9125

+ expect_rc =

9126

+ (abort_classes[abort_code] == ABORT_T_NESTED_TOO_DEEP) ? 1 : 0;

9127

+ rc = __TM_is_nested_too_deep(tdb);

9128

+ if (rc != expect_rc)

9129

+ {

9130

+ dump_tdb(tdb);

9131

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9132

+ return 6;

9133

+ }

9134

+ expect_rc = (abort_classes[abort_code] == ABORT_T_CONFLICT) ? 1 : 0;

9135

+ rc = __TM_is_conflict(tdb);

9136

+ if (rc != expect_rc)

9137

+ {

9138

+ dump_tdb(tdb);

9139

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9140

+ return 7;

9141

+ }

9142

+

9143

+ return 0;

9144

+}

9145

+

9146

+/* ---------------------------- local test functions ----------------------- */

9147

+

9148

+/* Not a test; make sure that the involved global cachelines are reserved for

9149

+ * writing. */

9150

+static int init_cache(void)

9151

+{

9152

+ make_fake_tdb(&local_tdb);

9153

+ make_fake_tdb(&local_tdb256);

9154

+ global_int = 0;

9155

+ global_u64 = 0;

9156

+ global_float_1 = 1.0;

9157

+ global_float_2 = 2.5;

9158

+ global_float_3 = 0.0;

9159

+ counters.c1 = 0;

9160

+ counters.c2 = 0;

9161

+ counters.c3 = 0;

9162

+

9163

+ return 0;

9164

+}

9165

+

9166

+static int test_abort_classification(void)

9167

+{

9168

+ int i;

9169

+

9170

+ make_fake_tdb(&local_tdb);

9171

+ for (i = 0; i <= 256; i++)

9172

+ {

9173

+ int rc;

9174

+

9175

+ local_tdb.abort_code = (uint64_t)i;

9176

+ rc = check_abort_code_in_tdb(&local_tdb, (uint64_t)i);

9177

+ if (rc != 0)

9178

+ {

9179

+ return 100 * i + rc;

9180

+ }

9181

+ }

9182

+

9183

+ return 0;

9184

+}

9185

+

9186

+static int test_cc_classification(void)

9187

+{

9188

+ long rc;

9189

+

9190

+ rc = __TM_is_failure_persistent(0);

9191

+ if (rc != 0)

9192

+ {

9193

+ return 1;

9194

+ }

9195

+ rc = __TM_is_failure_persistent(1);

9196

+ if (rc != 0)

9197

+ {

9198

+ return 2;

9199

+ }

9200

+ rc = __TM_is_failure_persistent(2);

9201

+ if (rc != 0)

9202

+ {

9203

+ return 3;

9204

+ }

9205

+ rc = __TM_is_failure_persistent(3);

9206

+ if (rc != 1)

9207

+ {

9208

+ return 4;

9209

+ }

9210

+

9211

+ return 0;

9212

+}

9213

+

9214

+static int test_tbegin_ntstg_tend(void)

9215

+{

9216

+ long rc;

9217

+

9218

+ counters.c1 = 0;

9219

+ counters.c2 = 0;

9220

+ if ((rc = __TM_simple_begin()) == 0)

9221

+ {

9222

+ __TM_non_transactional_store((uint64_t *)&counters.c1, 1);

9223

+ counters.c2 = 2;

9224

+ rc = __TM_end();

9225

+ if (rc != 0)

9226

+ {

9227

+ return 100 * rc + 5;

9228

+ }

9229

+ if (counters.c1 != 1)

9230

+ {

9231

+ return 100 * counters.c1 + 2;

9232

+ }

9233

+ if (counters.c2 != 2)

9234

+ {

9235

+ return 100 * counters.c2 + 3;

9236

+ }

9237

+ }

9238

+ else

9239

+ {

9240

+ return 100 * rc + 4;

9241

+ }

9242

+

9243

+ return 0;

9244

+}

9245

+

9246

+static int test_tbegin_ntstg_tabort(void)

9247

+{

9248

+ register float f;

9249

+

9250

+ counters.c1 = 0;

9251

+ counters.c2 = 0;

9252

+ f = 0;

9253

+ if (__TM_simple_begin() == 0)

9254

+ {

9255

+ __TM_non_transactional_store((uint64_t *)&counters.c1, 1);

9256

+ counters.c2 = 2;

9257

+ f = 1;

9258

+ __TM_named_abort(0);

9259

+ return 1;

9260

+ }

9261

+ if (counters.c1 != 1)

9262

+ {

9263

+ return 100 * counters.c1 + 2;

9264

+ }

9265

+ if (counters.c2 != 0)

9266

+ {

9267

+ return 100 * counters.c2 + 3;

9268

+ }

9269

+ if (f != 0)

9270

+ {

9271

+ return 100 * f + 4;

9272

+ }

9273

+

9274

+ return 0;

9275

+}

9276

+

9277

+static int test_tbegin_aborts(void)

9278

+{

9279

+ float f;

9280

+ long rc;

9281

+

9282

+ f = 77;

9283

+ if ((rc = __TM_simple_begin()) == 0)

9284

+ {

9285

+ f = 88;

9286

+ __TM_abort();

9287

+ return 2;

9288

+ }

9289

+ else if (rc != 2)

9290

+ {

9291

+ return 3;

9292

+ }

9293

+ if (f != 77)

9294

+ {

9295

+ return 4;

9296

+ }

9297

+ f = 66;

9298

+ if ((rc = __TM_simple_begin()) == 0)

9299

+ {

9300

+ f = 99;

9301

+ __TM_named_abort(3);

9302

+ return 5;

9303

+ }

9304

+ else if (rc != 3)

9305

+ {

9306

+ return 100 * rc + 6;

9307

+ }

9308

+ if (f != 66)

9309

+ {

9310

+ return 100 * f + 7;

9311

+ }

9312

+ if ((rc = __TM_simple_begin()) == 0)

9313

+ {

9314

+ global_float_3 = global_float_1 + global_float_2;

9315

+ rc = __TM_end();

9316

+ if (rc != 0)

9317

+ {

9318

+ return 100 * rc + 8;

9319

+ }

9320

+ }

9321

+ else

9322

+ {

9323

+ return 100 * rc + 9;

9324

+ }

9325

+ if (global_float_3 != global_float_1 + global_float_2)

9326

+ {

9327

+ return 100 * rc + 10;

9328

+ }

9329

+

9330

+ return 0;

9331

+}

9332

+

9333

+static int test_tbegin_tdb(void)

9334

+{

9335

+ long rc;

9336

+

9337

+ local_tdb.format = 0;

9338

+ if ((rc = __TM_begin(&local_tdb)) == 0)

9339

+ {

9340

+ rc = __TM_end();

9341

+ if (rc != 0)

9342

+ {

9343

+ return 100 * rc + 1;

9344

+ }

9345

+ if (local_tdb.format != 0)

9346

+ {

9347

+ dump_tdb(&local_tdb);

9348

+ return 100 * local_tdb.format + 2;

9349

+ }

9350

+ }

9351

+ else

9352

+ {

9353

+ return 100 * rc + 3;

9354

+ }

9355

+ local_tdb.format = 0;

9356

+ if ((rc = __TM_begin(&local_tdb)) == 0)

9357

+ {

9358

+ __TM_named_abort(1);

9359

+ return 4;

9360

+ }

9361

+ else

9362

+ {

9363

+ if (rc != 3)

9364

+ {

9365

+ return 100 * rc + 5;

9366

+ }

9367

+ if (local_tdb.format != 1)

9368

+ {

9369

+ dump_tdb(&local_tdb);

9370

+ return 100 * local_tdb.format + 6;

9371

+ }

9372

+ }

9373

+ local_tdb256.format = 0;

9374

+ if ((rc = __TM_begin(&local_tdb256)) == 0)

9375

+ {

9376

+ rc = __TM_end();

9377

+ if (rc != 0)

9378

+ {

9379

+ return 1100 * rc + 1;

9380

+ }

9381

+ if (local_tdb256.format != 0)

9382

+ {

9383

+ dump_tdb(&local_tdb256);

9384

+ return 1100 * local_tdb256.format + 2;

9385

+ }

9386

+ }

9387

+ else

9388

+ {

9389

+ return 1100 * rc + 3;

9390

+ }

9391

+#if 1 /*!!!does not work*/

9392

+ local_tdb256.format = 0;

9393

+ if ((rc = __TM_begin(&local_tdb256)) == 0)

9394

+ {

9395

+ __TM_named_abort(1);

9396

+ return 2004;

9397

+ }

9398

+ else

9399

+ {

9400

+ if (rc != 3)

9401

+ {

9402

+ return 2100 * rc + 5;

9403

+ }

9404

+ if (local_tdb256.format != 1)

9405

+ {

9406

+ dump_tdb(&local_tdb256);

9407

+ return 2100 * local_tdb256.format + 6;

9408

+ }

9409

+ }

9410

+#endif

9411

+

9412

+ return 0;

9413

+}

9414

+

9415

+static int test_etnd(void)

9416

+{

9417

+ long rc;

9418

+

9419

+ {

9420

+ long nd;

9421

+

9422

+ make_fake_tdb(&local_tdb);

9423

+ local_tdb.nesting_depth = 0;

9424

+ nd = __TM_nesting_depth(&local_tdb);

9425

+ if (nd != 0)

9426

+ {

9427

+ return 1;

9428

+ }

9429

+ local_tdb.nesting_depth = 7;

9430

+ nd = __TM_nesting_depth(&local_tdb);

9431

+ if (nd != 7)

9432

+ {

9433

+ return 7;

9434

+ }

9435

+ local_tdb.format = 0;

9436

+ nd = __TM_nesting_depth(&local_tdb);

9437

+ if (nd != 0)

9438

+ {

9439

+ return 2;

9440

+ }

9441

+ }

9442

+ counters.c1 = 0;

9443

+ counters.c1 = 0;

9444

+ counters.c2 = 0;

9445

+ counters.c3 = 0;

9446

+ if ((rc = __TM_simple_begin()) == 0)

9447

+ {

9448

+ counters.c1 = __TM_nesting_depth(0);

9449

+ if (__TM_simple_begin() == 0)

9450

+ {

9451

+ counters.c2 = __TM_nesting_depth(0);

9452

+ if (__TM_simple_begin() == 0)

9453

+ {

9454

+ counters.c3 = __TM_nesting_depth(0);

9455

+ __TM_end();

9456

+ }

9457

+ __TM_end();

9458

+ }

9459

+ __TM_end();

9460

+ }

9461

+ else

9462

+ {

9463

+ return 100 * rc + 1;

9464

+ }

9465

+ if (counters.c1 != 1)

9466

+ {

9467

+ return 100 * counters.c1 + 2;

9468

+ }

9469

+ if (counters.c2 != 2)

9470

+ {

9471

+ return 100 * counters.c2 + 3;

9472

+ }

9473

+ if (counters.c3 != 3)

9474

+ {

9475

+ return 100 * counters.c3 + 4;

9476

+ }

9477

+

9478

+ return 0;

9479

+}

9480

+

9481

+/* ---------------------------- local testing framework functions ---------- */

9482

+

9483

+static int run_one_test(const test_table_entry_t *test_entry)

9484

+{

9485

+ int do_print_passes;

9486

+ int succeeded;

9487

+ int rc;

9488

+ int i;

9489

+

9490

+ do_print_passes = (

9491

+ test_entry->required_quorum != 1 ||

9492

+ test_entry->max_repetitions != 1);

9493

+ printf("RRR RUN %s\n", test_entry->name);

9494

+ if (do_print_passes == 1)

9495

+ {

9496

+ printf(

9497

+ " (requires %d successful out of %d runs)\n",

9498

+ test_entry->required_quorum,

9499

+ test_entry->max_repetitions);

9500

+ }

9501

+ succeeded = 0;

9502

+ rc = 0;

9503

+ for (rc = 0, i = 0; i < test_entry->max_repetitions; i++)

9504

+ {

9505

+ if (do_print_passes == 1)

9506

+ {

9507

+ if (i == 0)

9508

+ {

9509

+ printf(" ");

9510

+ }

9511

+ else

9512

+ {

9513

+ printf(",");

9514

+ }

9515

+ }

9516

+ rc = test_entry->test_func();

9517

+ if (rc == 0)

9518

+ {

9519

+ if (do_print_passes == 1)

9520

+ {

9521

+ printf(" success");

9522

+ }

9523

+ succeeded++;

9524

+ if (succeeded >= test_entry->required_quorum)

9525

+ {

9526

+ break;

9527

+ }

9528

+ }

9529

+ else

9530

+ {

9531

+ printf(" failed (rc = %d)", rc);

9532

+ }

9533

+ }

9534

+ if (do_print_passes == 1 || rc != 0)

9535

+ {

9536

+ printf("\n");

9537

+ }

9538

+ if (succeeded >= test_entry->required_quorum)

9539

+ {

9540

+ printf("+++ OK %s\n", test_entry->name);

9541

+

9542

+ return 0;

9543

+ }

9544

+ else

9545

+ {

9546

+ printf("--- FAIL %s\n", test_entry->name);

9547

+

9548

+ return (rc != 0) ? rc : -1;

9549

+ }

9550

+}

9551

+

9552

+static int run_all_tests(const test_table_entry_t *test_table)

9553

+{

9554

+ const test_table_entry_t *test;

9555

+ int rc;

9556

+

9557

+ for (

9558

+ rc = 0, test = &test_table[0];

9559

+ test->test_func != NULL && rc == 0; test++)

9560

+ {

9561

+ rc = run_one_test(test);

9562

+ }

9563

+

9564

+ return rc;

9565

+}

9566

+

9567

+/* ---------------------------- interface functions ------------------------ */

9568

+

9569

+int main(void)

9570

+{

9571

+ const test_table_entry_t test_table[] = {

9572

+ TEST_NO_REP(init_cache),

9573

+ TEST_NO_REP(test_abort_classification),

9574

+ TEST_NO_REP(test_cc_classification),

9575

+ TEST_DF_REP(test_tbegin_ntstg_tend),

9576

+ TEST_DF_REP(test_tbegin_ntstg_tabort),

9577

+ TEST_DF_REP(test_tbegin_aborts),

9578

+ TEST_DF_REP(test_tbegin_tdb),

9579

+ TEST_DF_REP(test_etnd),

9580

+ { (void *)0, 0, 0 }

9581

+ };

9582

+

9583

+ {

9584

+ int rc;

9585

+

9586

+ rc = run_all_tests(test_table);

9587

+

9588

+ return rc;

9589

+ }

9590

+}

9591

Index: gcc/testsuite/gcc.target/s390/hotpatch-8.c

9592

===================================================================

9593

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-8.c (.../tags/gcc_4_8_2_release)

9594

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-8.c (.../branches/gcc-4_8-branch)

9595

@@ -0,0 +1,28 @@

9596

+/* Functional tests for the function hotpatching feature. */

9597

+

9598

+/* { dg-do run } */

9599

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

9600

+

9601

+#include <stdio.h>

9602

+

9603

+__attribute__ ((hotpatch))

9604

+inline void hp1(void)

9605

+{

9606

+ printf("hello, world!\n");

9607

+}

9608

+

9609

+__attribute__ ((hotpatch))

9610

+__attribute__ ((always_inline))

9611

+void hp2(void) /* { dg-warning "always_inline function might not be inlinable" } */

9612

+{

9613

+ printf("hello, world!\n");

9614

+} /* { dg-warning "function 'hp2' with the 'always_inline' attribute is not hotpatchable" } */

9615

+

9616

+int main (void)

9617

+{

9618

+ return 0;

9619

+}

9620

+

9621

+/* Check number of occurences of certain instructions. */

9622

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

9623

+/* { dg-final { scan-assembler-not "nop\t0" } } */

9624

Index: gcc/testsuite/gcc.target/s390/hotpatch-9.c

9625

===================================================================

9626

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-9.c (.../tags/gcc_4_8_2_release)

9627

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-9.c (.../branches/gcc-4_8-branch)

9628

@@ -0,0 +1,21 @@

9629

+/* Functional tests for the function hotpatching feature. */

9630

+

9631

+/* { dg-do run } */

9632

+/* { dg-options "-O3 -mzarch -mhotpatch=1 --save-temps" } */

9633

+

9634

+#include <stdio.h>

9635

+

9636

+__attribute__ ((hotpatch(2)))

9637

+void hp1(void)

9638

+{

9639

+ printf("hello, world!\n");

9640

+}

9641

+

9642

+int main (void)

9643

+{

9644

+ return 0;

9645

+}

9646

+

9647

+/* Check number of occurences of certain instructions. */

9648

+/* { dg-final { scan-assembler-times "nopr\t%r7" 2 } } */

9649

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

9650

Index: gcc/testsuite/gcc.target/s390/hotpatch-10.c

9651

===================================================================

9652

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-10.c (.../tags/gcc_4_8_2_release)

9653

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-10.c (.../branches/gcc-4_8-branch)

9654

@@ -0,0 +1,21 @@

9655

+/* Functional tests for the function hotpatching feature. */

9656

+

9657

+/* { dg-do run } */

9658

+/* { dg-options "-O3 -mzarch -mno-hotpatch --save-temps" } */

9659

+

9660

+#include <stdio.h>

9661

+

9662

+__attribute__ ((hotpatch(2)))

9663

+void hp1(void)

9664

+{

9665

+ printf("hello, world!\n");

9666

+}

9667

+

9668

+int main (void)

9669

+{

9670

+ return 0;

9671

+}

9672

+

9673

+/* Check number of occurences of certain instructions. */

9674

+/* { dg-final { scan-assembler-times "nopr\t%r7" 2 } } */

9675

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

9676

Index: gcc/testsuite/gcc.target/s390/hotpatch-11.c

9677

===================================================================

9678

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-11.c (.../tags/gcc_4_8_2_release)

9679

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-11.c (.../branches/gcc-4_8-branch)

9680

@@ -0,0 +1,20 @@

9681

+/* Functional tests for the function hotpatching feature. */

9682

+

9683

+/* { dg-do run } */

9684

+/* { dg-options "-O3 -mzarch -mhotpatch -mno-hotpatch --save-temps" } */

9685

+

9686

+#include <stdio.h>

9687

+

9688

+void hp1(void)

9689

+{

9690

+ printf("hello, world!\n");

9691

+}

9692

+

9693

+int main (void)

9694

+{

9695

+ return 0;

9696

+}

9697

+

9698

+/* Check number of occurences of certain instructions. */

9699

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

9700

+/* { dg-final { scan-assembler-not "nop\t0" } } */

9701

Index: gcc/testsuite/gcc.target/s390/hotpatch-12.c

9702

===================================================================

9703

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-12.c (.../tags/gcc_4_8_2_release)

9704

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-12.c (.../branches/gcc-4_8-branch)

9705

@@ -0,0 +1,20 @@

9706

+/* Functional tests for the function hotpatching feature. */

9707

+

9708

+/* { dg-do run } */

9709

+/* { dg-options "-O3 -mzarch -mno-hotpatch -mhotpatch=1 --save-temps" } */

9710

+

9711

+#include <stdio.h>

9712

+

9713

+void hp1(void)

9714

+{

9715

+ printf("hello, world!\n");

9716

+}

9717

+

9718

+int main (void)

9719

+{

9720

+ return 0;

9721

+}

9722

+

9723

+/* Check number of occurences of certain instructions. */

9724

+/* { dg-final { scan-assembler-times "nopr\t%r7" 1 } } */

9725

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

9726

Index: gcc/testsuite/gcc.target/mips/bswap-1.c

9727

===================================================================

9728

--- a/src/gcc/testsuite/gcc.target/mips/bswap-1.c (.../tags/gcc_4_8_2_release)

9729

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-1.c (.../branches/gcc-4_8-branch)

9730

@@ -0,0 +1,10 @@

9731

+/* { dg-options "isa_rev>=2" } */

9732

+/* { dg-skip-if "bswap recognition needs expensive optimizations" { *-*-* } { "-O0" "-O1" } { "" } } */

9733

+

9734

+NOMIPS16 unsigned short

9735

+foo (unsigned short x)

9736

+{

9737

+ return ((x << 8) & 0xff00) | ((x >> 8) & 0xff);

9738

+}

9739

+

9740

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9741

Index: gcc/testsuite/gcc.target/mips/bswap-2.c

9742

===================================================================

9743

--- a/src/gcc/testsuite/gcc.target/mips/bswap-2.c (.../tags/gcc_4_8_2_release)

9744

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-2.c (.../branches/gcc-4_8-branch)

9745

@@ -0,0 +1,9 @@

9746

+/* { dg-options "isa_rev>=2" } */

9747

+

9748

+NOMIPS16 unsigned short

9749

+foo (unsigned short x)

9750

+{

9751

+ return __builtin_bswap16 (x);

9752

+}

9753

+

9754

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9755

Index: gcc/testsuite/gcc.target/mips/pr59137.c

9756

===================================================================

9757

--- a/src/gcc/testsuite/gcc.target/mips/pr59137.c (.../tags/gcc_4_8_2_release)

9758

+++ b/src/gcc/testsuite/gcc.target/mips/pr59137.c (.../branches/gcc-4_8-branch)

9759

@@ -0,0 +1,34 @@

9760

+/* { dg-do run } */

9761

+/* { dg-options "-mno-plt" } */

9762

+

9763

+extern void abort (void);

9764

+

9765

+struct lispstruct

9766

+{

9767

+ int e;

9768

+ int t;

9769

+};

9770

+

9771

+struct lispstruct Cnil_body;

9772

+struct lispstruct Ct_body;

9773

+int nvalues;

9774

+

9775

+struct lispstruct * __attribute__ ((noinline))

9776

+fLlistp (struct lispstruct *x0)

9777

+{

9778

+ if (x0 == &Cnil_body

9779

+ || (((unsigned long) x0 >= 0x80000000) ? 0

9780

+ : (!x0->e ? (x0 != &Cnil_body) : x0->t)))

9781

+ x0 = &Ct_body;

9782

+ else

9783

+ x0 = &Cnil_body;

9784

+ nvalues = 1;

9785

+ return x0;

9786

+}

9787

+

9788

+int main ()

9789

+{

9790

+ if (fLlistp ((struct lispstruct *) 0xa0000001) != &Cnil_body)

9791

+ abort ();

9792

+ return 0;

9793

+}

9794

Index: gcc/testsuite/gcc.target/mips/bswap-3.c

9795

===================================================================

9796

--- a/src/gcc/testsuite/gcc.target/mips/bswap-3.c (.../tags/gcc_4_8_2_release)

9797

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-3.c (.../branches/gcc-4_8-branch)

9798

@@ -0,0 +1,14 @@

9799

+/* { dg-options "isa_rev>=2" } */

9800

+/* { dg-skip-if "bswap recognition needs expensive optimizations" { *-*-* } { "-O0" "-O1" } { "" } } */

9801

+

9802

+NOMIPS16 unsigned int

9803

+foo (unsigned int x)

9804

+{

9805

+ return (((x << 24) & 0xff000000)

9806

+ | ((x << 8) & 0xff0000)

9807

+ | ((x >> 8) & 0xff00)

9808

+ | ((x >> 24) & 0xff));

9809

+}

9810

+

9811

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9812

+/* { dg-final { scan-assembler "\tror\t" } } */

9813

Index: gcc/testsuite/gcc.target/mips/bswap-4.c

9814

===================================================================

9815

--- a/src/gcc/testsuite/gcc.target/mips/bswap-4.c (.../tags/gcc_4_8_2_release)

9816

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-4.c (.../branches/gcc-4_8-branch)

9817

@@ -0,0 +1,10 @@

9818

+/* { dg-options "isa_rev>=2" } */

9819

+

9820

+NOMIPS16 unsigned int

9821

+foo (unsigned int x)

9822

+{

9823

+ return __builtin_bswap32 (x);

9824

+}

9825

+

9826

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9827

+/* { dg-final { scan-assembler "\tror\t" } } */

9828

Index: gcc/testsuite/gcc.target/mips/bswap-5.c

9829

===================================================================

9830

--- a/src/gcc/testsuite/gcc.target/mips/bswap-5.c (.../tags/gcc_4_8_2_release)

9831

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-5.c (.../branches/gcc-4_8-branch)

9832

@@ -0,0 +1,20 @@

9833

+/* { dg-options "isa_rev>=2 -mgp64" } */

9834

+/* { dg-skip-if "bswap recognition needs expensive optimizations" { *-*-* } { "-O0" "-O1" } { "" } } */

9835

+

9836

+typedef unsigned long long uint64_t;

9837

+

9838

+NOMIPS16 uint64_t

9839

+foo (uint64_t x)

9840

+{

9841

+ return (((x << 56) & 0xff00000000000000ull)

9842

+ | ((x << 40) & 0xff000000000000ull)

9843

+ | ((x << 24) & 0xff0000000000ull)

9844

+ | ((x << 8) & 0xff00000000ull)

9845

+ | ((x >> 8) & 0xff000000)

9846

+ | ((x >> 24) & 0xff0000)

9847

+ | ((x >> 40) & 0xff00)

9848

+ | ((x >> 56) & 0xff));

9849

+}

9850

+

9851

+/* { dg-final { scan-assembler "\tdsbh\t" } } */

9852

+/* { dg-final { scan-assembler "\tdshd\t" } } */

9853

Index: gcc/testsuite/gcc.target/mips/bswap-6.c

9854

===================================================================

9855

--- a/src/gcc/testsuite/gcc.target/mips/bswap-6.c (.../tags/gcc_4_8_2_release)

9856

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-6.c (.../branches/gcc-4_8-branch)

9857

@@ -0,0 +1,12 @@

9858

+/* { dg-options "isa_rev>=2 -mgp64" } */

9859

+

9860

+typedef unsigned long long uint64_t;

9861

+

9862

+NOMIPS16 uint64_t

9863

+foo (uint64_t x)

9864

+{

9865

+ return __builtin_bswap64 (x);

9866

+}

9867

+

9868

+/* { dg-final { scan-assembler "\tdsbh\t" } } */

9869

+/* { dg-final { scan-assembler "\tdshd\t" } } */

9870

Index: gcc/testsuite/gcc.target/sh/pr51244-19.c

9871

===================================================================

9872

--- a/src/gcc/testsuite/gcc.target/sh/pr51244-19.c (.../tags/gcc_4_8_2_release)

9873

+++ b/src/gcc/testsuite/gcc.target/sh/pr51244-19.c (.../branches/gcc-4_8-branch)

9874

@@ -22,11 +22,16 @@

9875

unwanted sequences. Thus, if we see any movt insns, something is not

9876

working as expected. This test requires -O2 because the T bit stores

9877

in question will be eliminated in additional insn split passes after

9878

- reload. */

9879

+ reload.

9880

+

9881

+ Notice: When this test case was initially added, the T bit optimization

9882

+ was buggy and this test case resulted in wrong code. The movt

9883

+ instructions actually have to be present in this case to get

9884

+ correct code. */

9885

/* { dg-do compile { target "sh*-*-*" } } */

9886

/* { dg-options "-O2" } */

9887

/* { dg-skip-if "" { "sh*-*-*" } { "-m5*" } { "" } } */

9888

-/* { dg-final { scan-assembler-not "movt" } } */

9889

+/* { dg-final { scan-assembler "movt" } } */

9890

9891

struct request

9892

{

9893

Index: gcc/testsuite/gcc.target/sh/pr54089-3.c

9894

===================================================================

9895

--- a/src/gcc/testsuite/gcc.target/sh/pr54089-3.c (.../tags/gcc_4_8_2_release)

9896

+++ b/src/gcc/testsuite/gcc.target/sh/pr54089-3.c (.../branches/gcc-4_8-branch)

9897

@@ -5,7 +5,7 @@

9898

/* { dg-options "-O1" } */

9899

/* { dg-skip-if "" { "sh*-*-*" } { "*" } { "-m1*" "-m2" "-m2e*" } } */

9900

/* { dg-final { scan-assembler-not "and" } } */

9901

-/* { dg-final { scan-assembler-not "31" } } */

9902

+/* { dg-final { scan-assembler-not "#31" } } */

9903

9904

int

9905

test00 (unsigned int a, int* b, int c, int* d, unsigned int e)

9906

Index: gcc/testsuite/gfortran.dg/gomp/pr59467.f90

9907

===================================================================

9908

--- a/src/gcc/testsuite/gfortran.dg/gomp/pr59467.f90 (.../tags/gcc_4_8_2_release)

9909

+++ b/src/gcc/testsuite/gfortran.dg/gomp/pr59467.f90 (.../branches/gcc-4_8-branch)

9910

@@ -0,0 +1,24 @@

9911

+! PR libgomp/59467

9912

+! { dg-do compile }

9913

+! { dg-options "-fopenmp" }

9914

+ FUNCTION t()

9915

+ INTEGER :: a, b, t

9916

+ a = 0

9917

+ b = 0

9918

+ !$OMP PARALLEL REDUCTION(+:b)

9919

+ !$OMP SINGLE ! { dg-error "is not threadprivate or private in outer context" }

9920

+ !$OMP ATOMIC WRITE

9921

+ a = 6

9922

+ !$OMP END SINGLE COPYPRIVATE (a)

9923

+ b = a

9924

+ !$OMP END PARALLEL

9925

+ t = b

9926

+ b = 0

9927

+ !$OMP PARALLEL REDUCTION(+:b)

9928

+ !$OMP SINGLE

9929

+ !$OMP ATOMIC WRITE

9930

+ b = 6

9931

+ !$OMP END SINGLE COPYPRIVATE (b)

9932

+ !$OMP END PARALLEL

9933

+ t = t + b

9934

+ END FUNCTION

9935

Index: gcc/testsuite/gfortran.dg/reshape_6.f90

9936

===================================================================

9937

--- a/src/gcc/testsuite/gfortran.dg/reshape_6.f90 (.../tags/gcc_4_8_2_release)

9938

+++ b/src/gcc/testsuite/gfortran.dg/reshape_6.f90 (.../branches/gcc-4_8-branch)

9939

@@ -0,0 +1,19 @@

9940

+! { dg-do compile }

9941

+! PR fortran/58989

9942

+!

9943

+program test

9944

+

9945

+ real(8), dimension(4,4) :: fluxes

9946

+ real(8), dimension(2,2,2,2) :: f

9947

+ integer, dimension(3) :: dmmy

9948

+ integer, parameter :: indx(4)=(/2,2,2,2/)

9949

+

9950

+ fluxes = 1

9951

+

9952

+ dmmy = (/2,2,2/)

9953

+

9954

+ f = reshape(fluxes,(/dmmy,2/)) ! Caused an ICE

9955

+ f = reshape(fluxes,(/2,2,2,2/)) ! Works as expected

9956

+ f = reshape(fluxes,indx) ! Works as expected

9957

+

9958

+end program test

9959

Index: gcc/testsuite/gfortran.dg/derived_external_function_1.f90

9960

===================================================================

9961

--- a/src/gcc/testsuite/gfortran.dg/derived_external_function_1.f90 (.../tags/gcc_4_8_2_release)

9962

+++ b/src/gcc/testsuite/gfortran.dg/derived_external_function_1.f90 (.../branches/gcc-4_8-branch)

9963

@@ -0,0 +1,27 @@

9964

+! { dg-do run }

9965

+!

9966

+! PR fortran/58771

9967

+!

9968

+! Contributed by Vittorio Secca <zeccav@gmail.com>

9969

+!

9970

+! ICEd on the write statement with f() because the derived type backend

9971

+! declaration not built.

9972

+!

9973

+module m

9974

+ type t

9975

+ integer(4) g

9976

+ end type

9977

+end

9978

+

9979

+type(t) function f() result(ff)

9980

+ use m

9981

+ ff%g = 42

9982

+end

9983

+

9984

+ use m

9985

+ character (20) :: line1, line2

9986

+ type(t) f

9987

+ write (line1, *) f()

9988

+ write (line2, *) 42_4

9989

+ if (line1 .ne. line2) call abort

9990

+end

9991

Index: gcc/testsuite/gfortran.dg/constructor_9.f90

9992

===================================================================

9993

--- a/src/gcc/testsuite/gfortran.dg/constructor_9.f90 (.../tags/gcc_4_8_2_release)

9994

+++ b/src/gcc/testsuite/gfortran.dg/constructor_9.f90 (.../branches/gcc-4_8-branch)

9995

@@ -0,0 +1,22 @@

9996

+! { dg-do compile }

9997

+! { dg-options "-Wall" }

9998

+!

9999

+! PR 58471: [4.8/4.9 Regression] ICE on invalid with missing type constructor and -Wall

10000

+!

10001

+! Contributed by Andrew Benson <abensonca@gmail.com>

10002

+

10003

+module cf

10004

+ implicit none

10005

+ type :: cfmde

10006

+ end type

10007

+ interface cfmde

10008

+ module procedure mdedc ! { dg-error "is neither function nor subroutine" }

10009

+ end interface

10010

+contains

10011

+ subroutine cfi()

10012

+ type(cfmde), pointer :: cfd

10013

+ cfd=cfmde() ! { dg-error "Can't convert" }

10014

+ end subroutine

10015

+end module

10016

+

10017

+! { dg-final { cleanup-modules "cf" } }

10018

Index: gcc/testsuite/gfortran.dg/generic_28.f90

10019

===================================================================

10020

--- a/src/gcc/testsuite/gfortran.dg/generic_28.f90 (.../tags/gcc_4_8_2_release)

10021

+++ b/src/gcc/testsuite/gfortran.dg/generic_28.f90 (.../branches/gcc-4_8-branch)

10022

@@ -0,0 +1,18 @@

10023

+! { dg-do compile }

10024

+!

10025

+! PR 58998: [4.8/4.9 Regression] Generic interface problem with gfortran

10026

+!

10027

+! Contributed by Paul van Delst

10028

+

10029

+ interface iargc

10030

+ procedure iargc_8

10031

+ end interface

10032

+

10033

+contains

10034

+

10035

+ integer(8) function iargc_8()

10036

+ integer(4) iargc

10037

+ iargc_8 = iargc()

10038

+ end function

10039

+

10040

+end

10041

Index: gcc/testsuite/gfortran.dg/proc_ptr_43.f90

10042

===================================================================

10043

--- a/src/gcc/testsuite/gfortran.dg/proc_ptr_43.f90 (.../tags/gcc_4_8_2_release)

10044

+++ b/src/gcc/testsuite/gfortran.dg/proc_ptr_43.f90 (.../branches/gcc-4_8-branch)

10045

@@ -0,0 +1,19 @@

10046

+! { dg-do compile }

10047

+!

10048

+! PR 58099: [4.8/4.9 Regression] [F03] over-zealous procedure-pointer error checking

10049

+!

10050

+! Contributed by Daniel Price <daniel.price@monash.edu>

10051

+

10052

+ implicit none

10053

+ procedure(real), pointer :: wfunc

10054

+

10055

+ wfunc => w_cubic

10056

+

10057

+contains

10058

+

10059

+ pure real function w_cubic(q2)

10060

+ real, intent(in) :: q2

10061

+ w_cubic = 0.

10062

+ end function

10063

+

10064

+end

10065

Index: gcc/testsuite/gfortran.dg/extends_15.f90

10066

===================================================================

10067

--- a/src/gcc/testsuite/gfortran.dg/extends_15.f90 (.../tags/gcc_4_8_2_release)

10068

+++ b/src/gcc/testsuite/gfortran.dg/extends_15.f90 (.../branches/gcc-4_8-branch)

10069

@@ -0,0 +1,16 @@

10070

+! { dg-do compile }

10071

+!

10072

+! PR 58355: [4.7/4.8/4.9 Regression] [F03] ICE with TYPE, EXTENDS before parent TYPE defined

10073

+!

10074

+! Contributed by Andrew Benson <abensonca@gmail.com>

10075

+

10076

+module ct

10077

+ public :: t1

10078

+

10079

+ type, extends(t1) :: t2 ! { dg-error "has not been previously defined" }

10080

+

10081

+ type :: t1

10082

+ end type

10083

+end

10084

+

10085

+! { dg-final { cleanup-modules "ct" } }

10086

Index: gcc/testsuite/gfortran.dg/optional_class_1.f90

10087

===================================================================

10088

--- a/src/gcc/testsuite/gfortran.dg/optional_class_1.f90 (.../tags/gcc_4_8_2_release)

10089

+++ b/src/gcc/testsuite/gfortran.dg/optional_class_1.f90 (.../branches/gcc-4_8-branch)

10090

@@ -0,0 +1,45 @@

10091

+! { dg-do run }

10092

+!

10093

+! PR fortran/57445

10094

+!

10095

+! Contributed by Tobias Burnus <burnus@gcc.gnu.org>

10096

+!

10097

+! Spurious assert was added at revision 192495

10098

+!

10099

+module m

10100

+ implicit none

10101

+ type t

10102

+ integer :: i

10103

+ end type t

10104

+contains

10105

+ subroutine opt(xa, xc, xaa, xca)

10106

+ type(t), allocatable, intent(out), optional :: xa

10107

+ class(t), allocatable, intent(out), optional :: xc

10108

+ type(t), allocatable, intent(out), optional :: xaa(:)

10109

+ class(t), allocatable, intent(out), optional :: xca(:)

10110

+ if (present (xca)) call foo_opt(xca=xca)

10111

+ end subroutine opt

10112

+ subroutine foo_opt(xa, xc, xaa, xca)

10113

+ type(t), allocatable, intent(out), optional :: xa

10114

+ class(t), allocatable, intent(out), optional :: xc

10115

+ type(t), allocatable, intent(out), optional :: xaa(:)

10116

+ class(t), allocatable, intent(out), optional :: xca(:)

10117

+ if (present (xca)) then

10118

+ if (allocated (xca)) deallocate (xca)

10119

+ allocate (xca(3), source = [t(9),t(99),t(999)])

10120

+ end if

10121

+ end subroutine foo_opt

10122

+end module m

10123

+ use m

10124

+ class(t), allocatable :: xca(:)

10125

+ allocate (xca(1), source = t(42))

10126

+ select type (xca)

10127

+ type is (t)

10128

+ if (any (xca%i .ne. [42])) call abort

10129

+ end select

10130

+ call opt (xca = xca)

10131

+ select type (xca)

10132

+ type is (t)

10133

+ if (any (xca%i .ne. [9,99,999])) call abort

10134

+ end select

10135

+end

10136

Index: gcc/testsuite/gfortran.dg/dynamic_dispatch_12.f90

10137

===================================================================

10138

--- a/src/gcc/testsuite/gfortran.dg/dynamic_dispatch_12.f90 (.../tags/gcc_4_8_2_release)

10139

+++ b/src/gcc/testsuite/gfortran.dg/dynamic_dispatch_12.f90 (.../branches/gcc-4_8-branch)

10140

@@ -0,0 +1,74 @@

10141

+! { dg-do run }

10142

+!

10143

+! PR 59654: [4.8/4.9 Regression] [OOP] Broken function table with complex OO use case

10144

+!

10145

+! Contributed by Thomas Clune <Thomas.L.Clune@nasa.gov>

10146

+

10147

+module TestResult_mod

10148

+ implicit none

10149

+

10150

+ type TestResult

10151

+ integer :: numRun = 0

10152

+ contains

10153

+ procedure :: run

10154

+ procedure, nopass :: getNumRun

10155

+ end type

10156

+

10157

+contains

10158

+

10159

+ subroutine run (this)

10160

+ class (TestResult) :: this

10161

+ this%numRun = this%numRun + 1

10162

+ end subroutine

10163

+

10164

+ subroutine getNumRun()

10165

+ end subroutine

10166

+

10167

+end module

10168

+

10169

+

10170

+module BaseTestRunner_mod

10171

+ implicit none

10172

+

10173

+ type :: BaseTestRunner

10174

+ contains

10175

+ procedure, nopass :: norun

10176

+ end type

10177

+

10178

+contains

10179

+

10180

+ function norun () result(result)

10181

+ use TestResult_mod, only: TestResult

10182

+ type (TestResult) :: result

10183

+ end function

10184

+

10185

+end module

10186

+

10187

+

10188

+module TestRunner_mod

10189

+ use BaseTestRunner_mod, only: BaseTestRunner

10190

+ implicit none

10191

+end module

10192

+

10193

+

10194

+program main

10195

+ use TestRunner_mod, only: BaseTestRunner

10196

+ use TestResult_mod, only: TestResult

10197

+ implicit none

10198

+

10199

+ type (TestResult) :: result

10200

+

10201

+ call runtest (result)

10202

+

10203

+contains

10204

+

10205

+ subroutine runtest (result)

10206

+ use TestResult_mod, only: TestResult

10207

+ class (TestResult) :: result

10208

+ call result%run()

10209

+ if (result%numRun /= 1) call abort()

10210

+ end subroutine

10211

+

10212

+end

10213

+

10214

+! { dg-final { cleanup-modules "TestResult_mod BaseTestRunner_mod TestRunner_mod" } }

10215

Index: gcc/testsuite/gfortran.dg/unlimited_polymorphic_15.f90

10216

===================================================================

10217

--- a/src/gcc/testsuite/gfortran.dg/unlimited_polymorphic_15.f90 (.../tags/gcc_4_8_2_release)

10218

+++ b/src/gcc/testsuite/gfortran.dg/unlimited_polymorphic_15.f90 (.../branches/gcc-4_8-branch)

10219

@@ -0,0 +1,17 @@

10220

+! { dg-do compile }

10221

+!

10222

+! PR 59493: [OOP] ICE: Segfault on Class(*) pointer association

10223

+!

10224

+! Contributed by Hossein Talebi <talebi.hossein@gmail.com>

10225

+

10226

+ implicit none

10227

+

10228

+ type ty_mytype1

10229

+ end type

10230

+

10231

+ class(ty_mytype1), allocatable, target:: cla1

10232

+ class(*), pointer :: ptr

10233

+

10234

+ ptr => cla1

10235

+

10236

+end

10237

Index: gcc/testsuite/gcc.c-torture/execute/pr58984.c

10238

===================================================================

10239

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58984.c (.../tags/gcc_4_8_2_release)

10240

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58984.c (.../branches/gcc-4_8-branch)

10241

@@ -0,0 +1,57 @@

10242

+/* PR tree-optimization/58984 */

10243

+

10244

+struct S { int f0 : 8; int : 6; int f1 : 5; };

10245

+struct T { char f0; int : 6; int f1 : 5; };

10246

+

10247

+int a, *c = &a, e, n, b, m;

10248

+

10249

+static int

10250

+foo (struct S p)

10251

+{

10252

+ const unsigned short *f[36];

10253

+ for (; e < 2; e++)

10254

+ {

10255

+ const unsigned short **i = &f[0];

10256

+ *c ^= 1;

10257

+ if (p.f1)

10258

+ {

10259

+ *i = 0;

10260

+ return b;

10261

+ }

10262

+ }

10263

+ return 0;

10264

+}

10265

+

10266

+static int

10267

+bar (struct T p)

10268

+{

10269

+ const unsigned short *f[36];

10270

+ for (; e < 2; e++)

10271

+ {

10272

+ const unsigned short **i = &f[0];

10273

+ *c ^= 1;

10274

+ if (p.f1)

10275

+ {

10276

+ *i = 0;

10277

+ return b;

10278

+ }

10279

+ }

10280

+ return 0;

10281

+}

10282

+

10283

+int

10284

+main ()

10285

+{

10286

+ struct S o = { 1, 1 };

10287

+ foo (o);

10288

+ m = n || o.f0;

10289

+ if (a != 1)

10290

+ __builtin_abort ();

10291

+ e = 0;

10292

+ struct T p = { 1, 1 };

10293

+ bar (p);

10294

+ m |= n || p.f0;

10295

+ if (a != 0)

10296

+ __builtin_abort ();

10297

+ return 0;

10298

+}

10299

Index: gcc/testsuite/gcc.c-torture/execute/20131127-1.c

10300

===================================================================

10301

--- a/src/gcc/testsuite/gcc.c-torture/execute/20131127-1.c (.../tags/gcc_4_8_2_release)

10302

+++ b/src/gcc/testsuite/gcc.c-torture/execute/20131127-1.c (.../branches/gcc-4_8-branch)

10303

@@ -0,0 +1,34 @@

10304

+/* PR middle-end/59138 */

10305

+/* Testcase by John Regehr <regehr@cs.utah.edu> */

10306

+

10307

+extern void abort (void);

10308

+

10309

+#pragma pack(1)

10310

+

10311

+struct S0 {

10312

+ int f0;

10313

+ int f1;

10314

+ int f2;

10315

+ short f3;

10316

+};

10317

+

10318

+short a = 1;

10319

+

10320

+struct S0 b = { 1 }, c, d, e;

10321

+

10322

+struct S0 fn1() { return c; }

10323

+

10324

+void fn2 (void)

10325

+{

10326

+ b = fn1 ();

10327

+ a = 0;

10328

+ d = e;

10329

+}

10330

+

10331

+int main (void)

10332

+{

10333

+ fn2 ();

10334

+ if (a != 0)

10335

+ abort ();

10336

+ return 0;

10337

+}

10338

Index: gcc/testsuite/gcc.c-torture/execute/pr59358.c

10339

===================================================================

10340

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59358.c (.../tags/gcc_4_8_2_release)

10341

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59358.c (.../branches/gcc-4_8-branch)

10342

@@ -0,0 +1,44 @@

10343

+/* PR tree-optimization/59358 */

10344

+

10345

+__attribute__((noinline, noclone)) int

10346

+foo (int *x, int y)

10347

+{

10348

+ int z = *x;

10349

+ if (y > z && y <= 16)

10350

+ while (y > z)

10351

+ z *= 2;

10352

+ return z;

10353

+}

10354

+

10355

+int

10356

+main ()

10357

+{

10358

+ int i;

10359

+ for (i = 1; i < 17; i++)

10360

+ {

10361

+ int j = foo (&i, 16);

10362

+ int k;

10363

+ if (i >= 8 && i <= 15)

10364

+ k = 16 + (i - 8) * 2;

10365

+ else if (i >= 4 && i <= 7)

10366

+ k = 16 + (i - 4) * 4;

10367

+ else if (i == 3)

10368

+ k = 24;

10369

+ else

10370

+ k = 16;

10371

+ if (j != k)

10372

+ __builtin_abort ();

10373

+ j = foo (&i, 7);

10374

+ if (i >= 7)

10375

+ k = i;

10376

+ else if (i >= 4)

10377

+ k = 8 + (i - 4) * 2;

10378

+ else if (i == 3)

10379

+ k = 12;

10380

+ else

10381

+ k = 8;

10382

+ if (j != k)

10383

+ __builtin_abort ();

10384

+ }

10385

+ return 0;

10386

+}

10387

Index: gcc/testsuite/gcc.c-torture/execute/pr59014-2.c

10388

===================================================================

10389

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59014-2.c (.../tags/gcc_4_8_2_release)

10390

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59014-2.c (.../branches/gcc-4_8-branch)

10391

@@ -0,0 +1,23 @@

10392

+/* PR tree-optimization/59014 */

10393

+

10394

+__attribute__((noinline, noclone)) long long int

10395

+foo (long long int x, long long int y)

10396

+{

10397

+ if (((int) x | (int) y) != 0)

10398

+ return 6;

10399

+ return x + y;

10400

+}

10401

+

10402

+int

10403

+main ()

10404

+{

10405

+ if (sizeof (long long) == sizeof (int))

10406

+ return 0;

10407

+ int shift_half = sizeof (int) * __CHAR_BIT__ / 2;

10408

+ long long int x = (3LL << shift_half) << shift_half;

10409

+ long long int y = (5LL << shift_half) << shift_half;

10410

+ long long int z = foo (x, y);

10411

+ if (z != ((8LL << shift_half) << shift_half))

10412

+ __builtin_abort ();

10413

+ return 0;

10414

+}

10415

Index: gcc/testsuite/gcc.c-torture/execute/pr59101.c

10416

===================================================================

10417

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59101.c (.../tags/gcc_4_8_2_release)

10418

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59101.c (.../branches/gcc-4_8-branch)

10419

@@ -0,0 +1,15 @@

10420

+/* PR target/59101 */

10421

+

10422

+__attribute__((noinline, noclone)) int

10423

+foo (int a)

10424

+{

10425

+ return (~a & 4102790424LL) > 0 | 6;

10426

+}

10427

+

10428

+int

10429

+main ()

10430

+{

10431

+ if (foo (0) != 7)

10432

+ __builtin_abort ();

10433

+ return 0;

10434

+}

10435

Index: gcc/testsuite/gcc.c-torture/execute/pr58831.c

10436

===================================================================

10437

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58831.c (.../tags/gcc_4_8_2_release)

10438

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58831.c (.../branches/gcc-4_8-branch)

10439

@@ -0,0 +1,40 @@

10440

+#include <assert.h>

10441

+

10442

+int a, *b, c, d, f, **i, p, q, *r;

10443

+short o, j;

10444

+

10445

+static int __attribute__((noinline, noclone))

10446

+fn1 (int *p1, int **p2)

10447

+{

10448

+ int **e = &b;

10449

+ for (; p; p++)

10450

+ *p1 = 1;

10451

+ *e = *p2 = &d;

10452

+

10453

+ assert (r);

10454

+

10455

+ return c;

10456

+}

10457

+

10458

+static int ** __attribute__((noinline, noclone))

10459

+fn2 (void)

10460

+{

10461

+ for (f = 0; f != 42; f++)

10462

+ {

10463

+ int *g[3] = {0, 0, 0};

10464

+ for (o = 0; o; o--)

10465

+ for (; a > 1;)

10466

+ {

10467

+ int **h[1] = { &g[2] };

10468

+ }

10469

+ }

10470

+ return &r;

10471

+}

10472

+

10473

+int

10474

+main (void)

10475

+{

10476

+ i = fn2 ();

10477

+ fn1 (b, i);

10478

+ return 0;

10479

+}

10480

Index: gcc/testsuite/gcc.c-torture/execute/pr58726.c

10481

===================================================================

10482

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58726.c (.../tags/gcc_4_8_2_release)

10483

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58726.c (.../branches/gcc-4_8-branch)

10484

@@ -0,0 +1,26 @@

10485

+/* PR rtl-optimization/58726 */

10486

+

10487

+int a, c;

10488

+union { int f1; int f2 : 1; } b;

10489

+

10490

+short

10491

+foo (short p)

10492

+{

10493

+ return p < 0 ? p : a;

10494

+}

10495

+

10496

+int

10497

+main ()

10498

+{

10499

+ if (sizeof (short) * __CHAR_BIT__ != 16

10500

+ || sizeof (int) * __CHAR_BIT__ != 32)

10501

+ return 0;

10502

+ b.f1 = 56374;

10503

+ unsigned short d;

10504

+ int e = b.f2;

10505

+ d = e == 0 ? b.f1 : 0;

10506

+ c = foo (d);

10507

+ if (c != (short) 56374)

10508

+ __builtin_abort ();

10509

+ return 0;

10510

+}

10511

Index: gcc/testsuite/gcc.c-torture/execute/pr59014.c

10512

===================================================================

10513

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59014.c (.../tags/gcc_4_8_2_release)

10514

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59014.c (.../branches/gcc-4_8-branch)

10515

@@ -0,0 +1,25 @@

10516

+/* PR tree-optimization/59014 */

10517

+

10518

+int a = 2, b, c, d;

10519

+

10520

+int

10521

+foo ()

10522

+{

10523

+ for (;; c++)

10524

+ if ((b > 0) | (a & 1))

10525

+ ;

10526

+ else

10527

+ {

10528

+ d = a;

10529

+ return 0;

10530

+ }

10531

+}

10532

+

10533

+int

10534

+main ()

10535

+{

10536

+ foo ();

10537

+ if (d != 2)

10538

+ __builtin_abort ();

10539

+ return 0;

10540

+}

10541

Index: gcc/testsuite/gcc.c-torture/execute/pr59388.c

10542

===================================================================

10543

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59388.c (.../tags/gcc_4_8_2_release)

10544

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59388.c (.../branches/gcc-4_8-branch)

10545

@@ -0,0 +1,11 @@

10546

+/* PR tree-optimization/59388 */

10547

+

10548

+int a;

10549

+struct S { unsigned int f:1; } b;

10550

+

10551

+int

10552

+main ()

10553

+{

10554

+ a = (0 < b.f) | b.f;

10555

+ return a;

10556

+}

10557

Index: gcc/testsuite/gcc.c-torture/compile/pr58970-1.c

10558

===================================================================

10559

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58970-1.c (.../tags/gcc_4_8_2_release)

10560

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58970-1.c (.../branches/gcc-4_8-branch)

10561

@@ -0,0 +1,11 @@

10562

+/* PR middle-end/58970 */

10563

+

10564

+struct T { int b : 1; };

10565

+struct S { struct T t[1]; };

10566

+

10567

+void

10568

+foo (int x, struct S *s)

10569

+{

10570

+ if (x == -1)

10571

+ s->t[x].b = 0;

10572

+}

10573

Index: gcc/testsuite/gcc.c-torture/compile/pr58997.c

10574

===================================================================

10575

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58997.c (.../tags/gcc_4_8_2_release)

10576

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58997.c (.../branches/gcc-4_8-branch)

10577

@@ -0,0 +1,19 @@

10578

+/* PR rtl-optimization/58997 */

10579

+

10580

+int a, b, c, e;

10581

+short d;

10582

+char h;

10583

+

10584

+void

10585

+foo ()

10586

+{

10587

+ while (b)

10588

+ {

10589

+ d = a ? c : 1 % a;

10590

+ c = d;

10591

+ h = d;

10592

+ if (!h)

10593

+ while (e)

10594

+ ;

10595

+ }

10596

+}

10597

Index: gcc/testsuite/gcc.c-torture/compile/pr58970-2.c

10598

===================================================================

10599

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58970-2.c (.../tags/gcc_4_8_2_release)

10600

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58970-2.c (.../branches/gcc-4_8-branch)

10601

@@ -0,0 +1,11 @@

10602

+/* PR middle-end/58970 */

10603

+

10604

+struct T { char a : 8; char b : 1; };

10605

+struct S { char x; struct T t[1]; };

10606

+

10607

+void

10608

+foo (int x, struct S *s)

10609

+{

10610

+ if (x == -1)

10611

+ s->t[x].b = 0;

10612

+}

10613

Index: gcc/testsuite/gcc.c-torture/compile/pr59362.c

10614

===================================================================

10615

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr59362.c (.../tags/gcc_4_8_2_release)

10616

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr59362.c (.../branches/gcc-4_8-branch)

10617

@@ -0,0 +1,21 @@

10618

+/* PR tree-optimization/59362 */

10619

+

10620

+char *

10621

+foo (char *r, int s)

10622

+{

10623

+ r = __builtin___stpcpy_chk (r, "abc", __builtin_object_size (r, 1));

10624

+ if (s)

10625

+ r = __builtin___stpcpy_chk (r, "d", __builtin_object_size (r, 1));

10626

+ return r;

10627

+}

10628

+

10629

+char *a;

10630

+long int b;

10631

+

10632

+void

10633

+bar (void)

10634

+{

10635

+ b = __builtin_object_size (0, 0);

10636

+ a = __builtin___stpcpy_chk (0, "", b);

10637

+ b = __builtin_object_size (a, 0);

10638

+}

10639

Index: gcc/testsuite/gcc.dg/pr58668.c

10640

===================================================================

10641

--- a/src/gcc/testsuite/gcc.dg/pr58668.c (.../tags/gcc_4_8_2_release)

10642

+++ b/src/gcc/testsuite/gcc.dg/pr58668.c (.../branches/gcc-4_8-branch)

10643

@@ -0,0 +1,25 @@

10644

+/* PR rtl-optimization/58668 */

10645

+/* { dg-do compile } */

10646

+/* { dg-options "-O2" } */

10647

+/* { dg-additional-options "-mthumb" { target { { arm*-*-* } && arm_thumb2_ok } } } */

10648

+

10649

+void *fn1 (void *);

10650

+void *fn2 (void *, const char *);

10651

+void fn3 (void *);

10652

+void fn4 (void *, int);

10653

+

10654

+void *

10655

+test (void *x)

10656

+{

10657

+ void *a, *b;

10658

+ if (!(a = fn1 (x)))

10659

+ return (void *) 0;

10660

+ if (!(b = fn2 (a, "w")))

10661

+ {

10662

+ fn3 (a);

10663

+ return (void *) 0;

10664

+ }

10665

+ fn3 (a);

10666

+ fn4 (b, 1);

10667

+ return b;

10668

+}

10669

Index: gcc/testsuite/gcc.dg/pr57518.c

10670

===================================================================

10671

--- a/src/gcc/testsuite/gcc.dg/pr57518.c (.../tags/gcc_4_8_2_release)

10672

+++ b/src/gcc/testsuite/gcc.dg/pr57518.c (.../branches/gcc-4_8-branch)

10673

@@ -1,8 +1,8 @@

10674

-/* PR rtl-optimization/57130 */

10675

+/* PR rtl-optimization/57518 */

10676

10677

/* { dg-do compile } */

10678

/* { dg-options "-O2 -fdump-rtl-ira" } */

10679

-/* { dg-final { scan-rtl-dump-not "REG_EQUIV.*mem.*\"ip\"" "ira" } } */

10680

+/* { dg-final { scan-rtl-dump-not "REG_EQUIV\[^\n\]*mem\[^\n\]*\"ip\".*subreg" "ira" } } */

10681

10682

char ip[10];

10683

int total;

10684

Index: gcc/testsuite/gcc.dg/builtin-object-size-14.c

10685

===================================================================

10686

--- a/src/gcc/testsuite/gcc.dg/builtin-object-size-14.c (.../tags/gcc_4_8_2_release)

10687

+++ b/src/gcc/testsuite/gcc.dg/builtin-object-size-14.c (.../branches/gcc-4_8-branch)

10688

@@ -0,0 +1,28 @@

10689

+/* { dg-do run } */

10690

+/* { dg-options "-O2" } */

10691

+

10692

+extern void abort (void);

10693

+extern char *strncpy(char *, const char *, __SIZE_TYPE__);

10694

+

10695

+union u {

10696

+ struct {

10697

+ char vi[8];

10698

+ char pi[16];

10699

+ };

10700

+ char all[8+16+4];

10701

+};

10702

+

10703

+void __attribute__((noinline,noclone))

10704

+f(union u *u)

10705

+{

10706

+ char vi[8+1];

10707

+ __builtin_strncpy(vi, u->vi, sizeof(u->vi));

10708

+ if (__builtin_object_size (u->all, 1) != -1)

10709

+ abort ();

10710

+}

10711

+int main()

10712

+{

10713

+ union u u;

10714

+ f (&u);

10715

+ return 0;

10716

+}

10717

Index: gcc/testsuite/gcc.dg/20050922-1.c

10718

===================================================================

10719

--- a/src/gcc/testsuite/gcc.dg/20050922-1.c (.../tags/gcc_4_8_2_release)

10720

+++ b/src/gcc/testsuite/gcc.dg/20050922-1.c (.../branches/gcc-4_8-branch)

10721

@@ -4,7 +4,7 @@

10722

/* { dg-do run } */

10723

/* { dg-options "-O1 -std=c99" } */

10724

10725

-#include <stdlib.h>

10726

+extern void abort (void);

10727

10728

#if __INT_MAX__ == 2147483647

10729

typedef unsigned int uint32_t;

10730

Index: gcc/testsuite/gcc.dg/pr46309.c

10731

===================================================================

10732

--- a/src/gcc/testsuite/gcc.dg/pr46309.c (.../tags/gcc_4_8_2_release)

10733

+++ b/src/gcc/testsuite/gcc.dg/pr46309.c (.../branches/gcc-4_8-branch)

10734

@@ -1,5 +1,5 @@

10735

/* PR tree-optimization/46309 */

10736

-/* { dg-do compile } */

10737

+/* { dg-do compile { target { ! { cris*-*-* } } } } */

10738

/* { dg-options "-O2 -fdump-tree-reassoc-details" } */

10739

/* The transformation depends on BRANCH_COST being greater than 1

10740

(see the notes in the PR), so try to force that. */

10741

Index: gcc/testsuite/gcc.dg/atomic-store-6.c

10742

===================================================================

10743

--- a/src/gcc/testsuite/gcc.dg/atomic-store-6.c (.../tags/gcc_4_8_2_release)

10744

+++ b/src/gcc/testsuite/gcc.dg/atomic-store-6.c (.../branches/gcc-4_8-branch)

10745

@@ -0,0 +1,13 @@

10746

+/* { dg-do run } */

10747

+/* { dg-require-effective-target sync_int_128_runtime } */

10748

+/* { dg-options "-mcx16" { target { i?86-*-* x86_64-*-* } } } */

10749

+

10750

+__int128_t i;

10751

+

10752

+int main()

10753

+{

10754

+ __atomic_store_16(&i, -1, 0);

10755

+ if (i != -1)

10756

+ __builtin_abort();

10757

+ return 0;

10758

+}

10759

Index: gcc/testsuite/gcc.dg/strlenopt-4gf.c

10760

===================================================================

10761

--- a/src/gcc/testsuite/gcc.dg/strlenopt-4gf.c (.../tags/gcc_4_8_2_release)

10762

+++ b/src/gcc/testsuite/gcc.dg/strlenopt-4gf.c (.../branches/gcc-4_8-branch)

10763

@@ -7,13 +7,13 @@

10764

#include "strlenopt-4.c"

10765

10766

/* { dg-final { scan-tree-dump-times "strlen \\(" 1 "strlen" } } */

10767

-/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 4 "strlen" } } */

10768

-/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 1 "strlen" } } */

10769

+/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 0 "strlen" } } */

10770

+/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 0 "strlen" } } */

10771

/* { dg-final { scan-tree-dump-times "__strcat_chk \\(" 0 "strlen" } } */

10772

/* { dg-final { scan-tree-dump-times "strchr \\(" 0 "strlen" } } */

10773

-/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 5 "strlen" } } */

10774

-/* { dg-final { scan-tree-dump-times "memcpy \\(" 0 "strlen" } } */

10775

-/* { dg-final { scan-tree-dump-times "strcpy \\(" 0 "strlen" } } */

10776

+/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 0 "strlen" } } */

10777

+/* { dg-final { scan-tree-dump-times "memcpy \\(" 4 "strlen" } } */

10778

+/* { dg-final { scan-tree-dump-times "strcpy \\(" 1 "strlen" } } */

10779

/* { dg-final { scan-tree-dump-times "strcat \\(" 0 "strlen" } } */

10780

-/* { dg-final { scan-tree-dump-times "stpcpy \\(" 0 "strlen" } } */

10781

+/* { dg-final { scan-tree-dump-times "stpcpy \\(" 5 "strlen" } } */

10782

/* { dg-final { cleanup-tree-dump "strlen" } } */

10783

Index: gcc/testsuite/gcc.dg/pr59351.c

10784

===================================================================

10785

--- a/src/gcc/testsuite/gcc.dg/pr59351.c (.../tags/gcc_4_8_2_release)

10786

+++ b/src/gcc/testsuite/gcc.dg/pr59351.c (.../branches/gcc-4_8-branch)

10787

@@ -0,0 +1,8 @@

10788

+/* { dg-do compile } */

10789

+/* { dg-options "-std=c99 -Wpedantic" } */

10790

+

10791

+unsigned int

10792

+foo (void)

10793

+{

10794

+ return sizeof ((int[]) {}); /* { dg-warning "ISO C forbids empty initializer braces" } */

10795

+}

10796

Index: gcc/testsuite/gcc.dg/builtin-object-size-8.c

10797

===================================================================

10798

--- a/src/gcc/testsuite/gcc.dg/builtin-object-size-8.c (.../tags/gcc_4_8_2_release)

10799

+++ b/src/gcc/testsuite/gcc.dg/builtin-object-size-8.c (.../branches/gcc-4_8-branch)

10800

@@ -1,4 +1,4 @@

10801

-/* { dg-do run { xfail *-*-* } } */

10802

+/* { dg-do run } */

10803

/* { dg-options "-O2" } */

10804

10805

typedef __SIZE_TYPE__ size_t;

10806

Index: gcc/testsuite/gcc.dg/20050922-2.c

10807

===================================================================

10808

--- a/src/gcc/testsuite/gcc.dg/20050922-2.c (.../tags/gcc_4_8_2_release)

10809

+++ b/src/gcc/testsuite/gcc.dg/20050922-2.c (.../branches/gcc-4_8-branch)

10810

@@ -4,7 +4,8 @@

10811

/* { dg-do run } */

10812

/* { dg-options "-O1 -std=c99" } */

10813

10814

-#include <stdlib.h>

10815

+extern void abort (void);

10816

+extern void exit (int);

10817

10818

#if __INT_MAX__ == 2147483647

10819

typedef unsigned int uint32_t;

10820

Index: gcc/testsuite/gcc.dg/pr59011.c

10821

===================================================================

10822

--- a/src/gcc/testsuite/gcc.dg/pr59011.c (.../tags/gcc_4_8_2_release)

10823

+++ b/src/gcc/testsuite/gcc.dg/pr59011.c (.../branches/gcc-4_8-branch)

10824

@@ -0,0 +1,22 @@

10825

+/* PR middle-end/59011 */

10826

+/* { dg-do compile } */

10827

+/* { dg-options "-std=gnu99" } */

10828

+

10829

+void

10830

+foo (int m)

10831

+{

10832

+ int a[m];

10833

+ void

10834

+ bar (void)

10835

+ {

10836

+ {

10837

+ int

10838

+ baz (void)

10839

+ {

10840

+ return a[0];

10841

+ }

10842

+ }

10843

+ a[0] = 42;

10844

+ }

10845

+ bar ();

10846

+}

10847

Index: gcc/testsuite/gcc.dg/pr58805.c

10848

===================================================================

10849

--- a/src/gcc/testsuite/gcc.dg/pr58805.c (.../tags/gcc_4_8_2_release)

10850

+++ b/src/gcc/testsuite/gcc.dg/pr58805.c (.../branches/gcc-4_8-branch)

10851

@@ -0,0 +1,24 @@

10852

+/* { dg-do compile } */

10853

+/* { dg-options "-O2 -ftree-tail-merge -fdump-tree-pre" } */

10854

+

10855

+/* Type that matches the 'p' constraint. */

10856

+#define TYPE void *

10857

+

10858

+static inline

10859

+void bar (TYPE *r)

10860

+{

10861

+ TYPE t;

10862

+ __asm__ ("" : "=&p" (t), "=p" (*r));

10863

+}

10864

+

10865

+void

10866

+foo (int n, TYPE *x, TYPE *y)

10867

+{

10868

+ if (n == 0)

10869

+ bar (x);

10870

+ else

10871

+ bar (y);

10872

+}

10873

+

10874

+/* { dg-final { scan-tree-dump-times "__asm__" 2 "pre"} } */

10875

+/* { dg-final { cleanup-tree-dump "pre" } } */

10876

Index: gcc/testsuite/gcc.dg/strlenopt-14gf.c

10877

===================================================================

10878

--- a/src/gcc/testsuite/gcc.dg/strlenopt-14gf.c (.../tags/gcc_4_8_2_release)

10879

+++ b/src/gcc/testsuite/gcc.dg/strlenopt-14gf.c (.../branches/gcc-4_8-branch)

10880

@@ -11,14 +11,14 @@

10881

memcpy. */

10882

/* { dg-final { scan-tree-dump-times "strlen \\(" 4 "strlen" } } */

10883

/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 0 "strlen" } } */

10884

-/* { dg-final { scan-tree-dump-times "__mempcpy_chk \\(" 2 "strlen" } } */

10885

+/* { dg-final { scan-tree-dump-times "__mempcpy_chk \\(" 0 "strlen" } } */

10886

/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 0 "strlen" } } */

10887

/* { dg-final { scan-tree-dump-times "__strcat_chk \\(" 0 "strlen" } } */

10888

/* { dg-final { scan-tree-dump-times "strchr \\(" 0 "strlen" } } */

10889

-/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 3 "strlen" } } */

10890

-/* { dg-final { scan-tree-dump-times "memcpy \\(" 0 "strlen" } } */

10891

-/* { dg-final { scan-tree-dump-times "mempcpy \\(" 0 "strlen" } } */

10892

+/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 0 "strlen" } } */

10893

+/* { dg-final { scan-tree-dump-times "memcpy \\(" 1 "strlen" } } */

10894

+/* { dg-final { scan-tree-dump-times "mempcpy \\(" 2 "strlen" } } */

10895

/* { dg-final { scan-tree-dump-times "strcpy \\(" 0 "strlen" } } */

10896

/* { dg-final { scan-tree-dump-times "strcat \\(" 0 "strlen" } } */

10897

-/* { dg-final { scan-tree-dump-times "stpcpy \\(" 0 "strlen" } } */

10898

+/* { dg-final { scan-tree-dump-times "stpcpy \\(" 2 "strlen" } } */

10899

/* { dg-final { cleanup-tree-dump "strlen" } } */

10900

Index: gcc/testsuite/gcc.dg/torture/pr59047.c

10901

===================================================================

10902

--- a/src/gcc/testsuite/gcc.dg/torture/pr59047.c (.../tags/gcc_4_8_2_release)

10903

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59047.c (.../branches/gcc-4_8-branch)

10904

@@ -0,0 +1,39 @@

10905

+/* { dg-do run } */

10906

+

10907

+extern void abort (void);

10908

+

10909

+struct

10910

+{

10911

+ int f0;

10912

+ int f1:1;

10913

+ int f2:2;

10914

+} a = {0, 0, 1};

10915

+

10916

+int b, c, *d, e, f;

10917

+

10918

+int

10919

+fn1 ()

10920

+{

10921

+ for (; b < 1; ++b)

10922

+ {

10923

+ for (e = 0; e < 1; e = 1)

10924

+ {

10925

+ int **g = &d;

10926

+ *g = &c;

10927

+ }

10928

+ *d = 0;

10929

+ f = a.f1;

10930

+ if (f)

10931

+ return 0;

10932

+ }

10933

+ return 0;

10934

+}

10935

+

10936

+int

10937

+main ()

10938

+{

10939

+ fn1 ();

10940

+ if (b != 1)

10941

+ abort ();

10942

+ return 0;

10943

+}

10944

Index: gcc/testsuite/gcc.dg/torture/pr58956.c

10945

===================================================================

10946

--- a/src/gcc/testsuite/gcc.dg/torture/pr58956.c (.../tags/gcc_4_8_2_release)

10947

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58956.c (.../branches/gcc-4_8-branch)

10948

@@ -0,0 +1,30 @@

10949

+/* { dg-do run } */

10950

+

10951

+extern void abort (void);

10952

+

10953

+struct S

10954

+{

10955

+ int f0;

10956

+} a = {1}, b, g, *c = &b, **f = &c;

10957

+

10958

+int *d, **e = &d, h;

10959

+

10960

+struct S

10961

+foo ()

10962

+{

10963

+ *e = &h;

10964

+ if (!d)

10965

+ __builtin_unreachable ();

10966

+ *f = &g;

10967

+ return a;

10968

+}

10969

+

10970

+int

10971

+main ()

10972

+{

10973

+ struct S *i = c;

10974

+ *i = foo ();

10975

+ if (b.f0 != 1)

10976

+ abort ();

10977

+ return 0;

10978

+}

10979

Index: gcc/testsuite/gcc.dg/torture/pr57517.c

10980

===================================================================

10981

--- a/src/gcc/testsuite/gcc.dg/torture/pr57517.c (.../tags/gcc_4_8_2_release)

10982

+++ b/src/gcc/testsuite/gcc.dg/torture/pr57517.c (.../branches/gcc-4_8-branch)

10983

@@ -0,0 +1,16 @@

10984

+/* { dg-do compile } */

10985

+

10986

+int x[1024], y[1024], z[1024], w[1024];

10987

+void foo (void)

10988

+{

10989

+ int i;

10990

+ for (i = 1; i < 1024; ++i)

10991

+ {

10992

+ int a = x[i];

10993

+ int b = y[i];

10994

+ int c = x[i-1];

10995

+ int d = y[i-1];

10996

+ if (w[i])

10997

+ z[i] = (a + b) + (c + d);

10998

+ }

10999

+}

11000

Index: gcc/testsuite/gcc.dg/torture/pr59164.c

11001

===================================================================

11002

--- a/src/gcc/testsuite/gcc.dg/torture/pr59164.c (.../tags/gcc_4_8_2_release)

11003

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59164.c (.../branches/gcc-4_8-branch)

11004

@@ -0,0 +1,21 @@

11005

+/* { dg-do compile } */

11006

+

11007

+int a, d, e;

11008

+long b[10];

11009

+int c[10][8];

11010

+

11011

+int fn1(p1)

11012

+{

11013

+ return 1 >> p1;

11014

+}

11015

+

11016

+void fn2(void)

11017

+{

11018

+ int f;

11019

+ for (a=1; a <= 4; a++)

11020

+ {

11021

+ f = fn1(0 < c[a][0]);

11022

+ if (f || d)

11023

+ e = b[a] = 1;

11024

+ }

11025

+}

11026

Index: gcc/testsuite/gcc.dg/torture/pr58779.c

11027

===================================================================

11028

--- a/src/gcc/testsuite/gcc.dg/torture/pr58779.c (.../tags/gcc_4_8_2_release)

11029

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58779.c (.../branches/gcc-4_8-branch)

11030

@@ -0,0 +1,12 @@

11031

+/* { dg-do run } */

11032

+

11033

+int a, c;

11034

+

11035

+int main ()

11036

+{

11037

+ int e = -1;

11038

+ short d = (c <= 0) ^ e;

11039

+ if ((unsigned int) a - (a || d) <= (unsigned int) a)

11040

+ __builtin_abort ();

11041

+ return 0;

11042

+}

11043

Index: gcc/testsuite/gcc.dg/torture/pr59139.c

11044

===================================================================

11045

--- a/src/gcc/testsuite/gcc.dg/torture/pr59139.c (.../tags/gcc_4_8_2_release)

11046

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59139.c (.../branches/gcc-4_8-branch)

11047

@@ -0,0 +1,20 @@

11048

+/* { dg-do compile } */

11049

+

11050

+int a, b, c, d, e;

11051

+int fn1(p1, p2) { return p2 == 0 ? p1 : 1 % p2; }

11052

+

11053

+void fn2()

11054

+{

11055

+ c = 0;

11056

+ for (;; c = (unsigned short)c)

11057

+ {

11058

+ b = 2;

11059

+ for (; b; b = a)

11060

+ {

11061

+ e = fn1(2, c && 1);

11062

+ d = c == 0 ? e : c;

11063

+ if (d)

11064

+ return;

11065

+ }

11066

+ }

11067

+}

11068

Index: gcc/testsuite/gcc.dg/torture/pr58079.c

11069

===================================================================

11070

--- a/src/gcc/testsuite/gcc.dg/torture/pr58079.c (.../tags/gcc_4_8_2_release)

11071

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58079.c (.../branches/gcc-4_8-branch)

11072

@@ -0,0 +1,107 @@

11073

+/* { dg-options "-mlong-calls" { target mips*-*-* } } */

11074

+

11075

+typedef unsigned char u8;

11076

+typedef unsigned short u16;

11077

+typedef unsigned int __kernel_size_t;

11078

+typedef __kernel_size_t size_t;

11079

+struct list_head {

11080

+ struct list_head *next;

11081

+};

11082

+

11083

+struct dmx_ts_feed {

11084

+ int is_filtering;

11085

+};

11086

+struct dmx_section_feed {

11087

+ u16 secbufp;

11088

+ u16 seclen;

11089

+ u16 tsfeedp;

11090

+};

11091

+

11092

+typedef int (*dmx_ts_cb) (

11093

+ const u8 * buffer1,

11094

+ size_t buffer1_length,

11095

+ const u8 * buffer2,

11096

+ size_t buffer2_length

11097

+);

11098

+

11099

+struct dvb_demux_feed {

11100

+ union {

11101

+ struct dmx_ts_feed ts;

11102

+ struct dmx_section_feed sec;

11103

+ } feed;

11104

+ union {

11105

+ dmx_ts_cb ts;

11106

+ } cb;

11107

+ int type;

11108

+ u16 pid;

11109

+ int ts_type;

11110

+ struct list_head list_head;

11111

+};

11112

+

11113

+struct dvb_demux {

11114

+ int (*stop_feed)(struct dvb_demux_feed *feed);

11115

+ struct list_head feed_list;

11116

+};

11117

+

11118

+

11119

+static

11120

+inline

11121

+__attribute__((always_inline))

11122

+u8

11123

+payload(const u8 *tsp)

11124

+{

11125

+ if (tsp[3] & 0x20) {

11126

+ return 184 - 1 - tsp[4];

11127

+ }

11128

+ return 184;

11129

+}

11130

+

11131

+static

11132

+inline

11133

+__attribute__((always_inline))

11134

+int

11135

+dvb_dmx_swfilter_payload(struct dvb_demux_feed *feed, const u8 *buf)

11136

+{

11137

+ int count = payload(buf);

11138

+ int p;

11139

+ if (count == 0)

11140

+ return -1;

11141

+ return feed->cb.ts(&buf[p], count, ((void *)0), 0);

11142

+}

11143

+

11144

+static

11145

+inline

11146

+__attribute__((always_inline))

11147

+void

11148

+dvb_dmx_swfilter_packet_type(struct dvb_demux_feed *feed, const u8 *buf)

11149

+{

11150

+ switch (feed->type) {

11151

+ case 0:

11152

+ if (feed->ts_type & 1) {

11153

+ dvb_dmx_swfilter_payload(feed, buf);

11154

+ }

11155

+ if (dvb_dmx_swfilter_section_packet(feed, buf) < 0)

11156

+ feed->feed.sec.seclen = feed->feed.sec.secbufp = 0;

11157

+ }

11158

+}

11159

+

11160

+static

11161

+void

11162

+dvb_dmx_swfilter_packet(struct dvb_demux *demux, const u8 *buf)

11163

+{

11164

+ struct dvb_demux_feed *feed;

11165

+ int dvr_done = 0;

11166

+

11167

+ 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) );})) {

11168

+ if (((((feed)->type == 0) && ((feed)->feed.ts.is_filtering) && (((feed)->ts_type & (1 | 8)) == 1))) && (dvr_done++))

11169

+ dvb_dmx_swfilter_packet_type(feed, buf);

11170

+ else if (feed->pid == 0x2000)

11171

+ feed->cb.ts(buf, 188, ((void *)0), 0);

11172

+ }

11173

+}

11174

+void dvb_dmx_swfilter_packets(struct dvb_demux *demux, const u8 *buf, size_t count)

11175

+{

11176

+ while (count--) {

11177

+ dvb_dmx_swfilter_packet(demux, buf);

11178

+ }

11179

+}

11180

Index: gcc/testsuite/gcc.dg/torture/pr58830.c

11181

===================================================================

11182

--- a/src/gcc/testsuite/gcc.dg/torture/pr58830.c (.../tags/gcc_4_8_2_release)

11183

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58830.c (.../branches/gcc-4_8-branch)

11184

@@ -0,0 +1,42 @@

11185

+/* { dg-do run } */

11186

+/* { dg-additional-options "-ftree-pre -ftree-partial-pre" } */

11187

+

11188

+extern void abort (void);

11189

+

11190

+int b, c, d, f, g, h, i, j[6], *l = &b, *m, n, *o, r;

11191

+char k;

11192

+

11193

+static int

11194

+foo ()

11195

+{

11196

+ char *p = &k;

11197

+

11198

+ for (; d; d++)

11199

+ if (i)

11200

+ h = 0;

11201

+ else

11202

+ h = c || (r = 0);

11203

+

11204

+ for (f = 0; f < 2; f++)

11205

+ {

11206

+ unsigned int q;

11207

+ *l = 0;

11208

+ if (n)

11209

+ *m = g;

11210

+ if (g)

11211

+ o = 0;

11212

+ for (q = -8; q >= 5; q++)

11213

+ (*p)--;

11214

+ }

11215

+

11216

+ return 0;

11217

+}

11218

+

11219

+int

11220

+main ()

11221

+{

11222

+ foo ();

11223

+ 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)

11224

+ abort ();

11225

+ return 0;

11226

+}

11227

Index: gcc/testsuite/gcc.dg/torture/pr59715.c

11228

===================================================================

11229

--- a/src/gcc/testsuite/gcc.dg/torture/pr59715.c (.../tags/gcc_4_8_2_release)

11230

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59715.c (.../branches/gcc-4_8-branch)

11231

@@ -0,0 +1,21 @@

11232

+/* { dg-do run } */

11233

+

11234

+extern void abort (void);

11235

+

11236

+int a = 2, b;

11237

+

11238

+int

11239

+main ()

11240

+{

11241

+ int c;

11242

+ if (!b)

11243

+ {

11244

+ b = a;

11245

+ c = a == 0 ? 1 : 1 % a;

11246

+ if (c)

11247

+ b = 0;

11248

+ }

11249

+ if (b != 0)

11250

+ abort ();

11251

+ return 0;

11252

+}

11253

Index: gcc/testsuite/gcc.dg/torture/pr58143-1.c

11254

===================================================================

11255

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-1.c (.../tags/gcc_4_8_2_release)

11256

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-1.c (.../branches/gcc-4_8-branch)

11257

@@ -0,0 +1,51 @@

11258

+/* { dg-do run } */

11259

+/* { dg-additional-options "-fstrict-overflow" } */

11260

+

11261

+extern void abort (void);

11262

+

11263

+int a, b, c, d, e, f, g, h = 1, i;

11264

+

11265

+int foo (int p)

11266

+{

11267

+ return p < 0 && a < - __INT_MAX__ - 1 - p ? 0 : 1;

11268

+}

11269

+

11270

+int *bar ()

11271

+{

11272

+ int j;

11273

+ i = h ? 0 : 1 % h;

11274

+ for (j = 0; j < 1; j++)

11275

+ for (d = 0; d; d++)

11276

+ for (e = 1; e;)

11277

+ return 0;

11278

+ return 0;

11279

+}

11280

+

11281

+int baz ()

11282

+{

11283

+ for (; b >= 0; b--)

11284

+ for (c = 1; c >= 0; c--)

11285

+ {

11286

+ int *k = &c;

11287

+ for (;;)

11288

+ {

11289

+ for (f = 0; f < 1; f++)

11290

+ {

11291

+ g = foo (*k);

11292

+ bar ();

11293

+ }

11294

+ if (*k)

11295

+ break;

11296

+ return 0;

11297

+ }

11298

+ }

11299

+ return 0;

11300

+}

11301

+

11302

+int main ()

11303

+{

11304

+ baz ();

11305

+ if (b != 0)

11306

+ abort ();

11307

+ return 0;

11308

+}

11309

Index: gcc/testsuite/gcc.dg/torture/pr58143-2.c

11310

===================================================================

11311

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-2.c (.../tags/gcc_4_8_2_release)

11312

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-2.c (.../branches/gcc-4_8-branch)

11313

@@ -0,0 +1,34 @@

11314

+/* { dg-do run } */

11315

+/* { dg-additional-options "-fstrict-overflow" } */

11316

+

11317

+int a, b, d, e, f, *g, h, i;

11318

+volatile int c;

11319

+

11320

+char foo (unsigned char p)

11321

+{

11322

+ return p + 1;

11323

+}

11324

+

11325

+int bar ()

11326

+{

11327

+ for (h = 0; h < 3; h = foo (h))

11328

+ {

11329

+ c;

11330

+ for (f = 0; f < 1; f++)

11331

+ {

11332

+ i = a && 0 < -__INT_MAX__ - h ? 0 : 1;

11333

+ if (e)

11334

+ for (; d;)

11335

+ b = 0;

11336

+ else

11337

+ g = 0;

11338

+ }

11339

+ }

11340

+ return 0;

11341

+}

11342

+

11343

+int main ()

11344

+{

11345

+ bar ();

11346

+ return 0;

11347

+}

11348

Index: gcc/testsuite/gcc.dg/torture/pr58941.c

11349

===================================================================

11350

--- a/src/gcc/testsuite/gcc.dg/torture/pr58941.c (.../tags/gcc_4_8_2_release)

11351

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58941.c (.../branches/gcc-4_8-branch)

11352

@@ -0,0 +1,33 @@

11353

+/* { dg-do run } */

11354

+

11355

+extern void abort (void);

11356

+

11357

+typedef struct {

11358

+ int msgLength;

11359

+ unsigned char data[1000];

11360

+} SMsg;

11361

+

11362

+typedef struct {

11363

+ int dummy;

11364

+ int d[0];

11365

+} SData;

11366

+

11367

+int condition = 3;

11368

+

11369

+int main()

11370

+{

11371

+ SMsg msg;

11372

+ SData *pData = (SData*)(msg.data);

11373

+ unsigned int i = 0;

11374

+ for (i = 0; i < 1; i++)

11375

+ {

11376

+ pData->d[i] = 0;

11377

+ if(condition & 1)

11378

+ pData->d[i] |= 0x55;

11379

+ if(condition & 2)

11380

+ pData->d[i] |= 0xaa;

11381

+ }

11382

+ if (pData->d[0] != 0xff)

11383

+ abort ();

11384

+ return 0;

11385

+}

11386

Index: gcc/testsuite/gcc.dg/torture/pr57488.c

11387

===================================================================

11388

--- a/src/gcc/testsuite/gcc.dg/torture/pr57488.c (.../tags/gcc_4_8_2_release)

11389

+++ b/src/gcc/testsuite/gcc.dg/torture/pr57488.c (.../branches/gcc-4_8-branch)

11390

@@ -0,0 +1,58 @@

11391

+/* { dg-do run } */

11392

+

11393

+extern void abort (void);

11394

+

11395

+int i, j, *pj = &j, **ppj = &pj;

11396

+int x, *px = &x;

11397

+

11398

+short s, *ps = &s, k;

11399

+

11400

+unsigned short u, *pu = &u, **ppu = &pu;

11401

+

11402

+char c, *pc = &c;

11403

+

11404

+unsigned char v = 48;

11405

+

11406

+static int

11407

+bar (int p)

11408

+{

11409

+ p = k;

11410

+ *px = **ppu = i;

11411

+ *ppj = &p;

11412

+ if (**ppj)

11413

+ *pj = p;

11414

+ return p;

11415

+}

11416

+

11417

+void __attribute__((noinline))

11418

+foo ()

11419

+{

11420

+ for (; i <= 3; i++)

11421

+ for (; j; j--);

11422

+

11423

+ u ^= bar (*pj);

11424

+

11425

+ for (k = 1; k >= 0; k--)

11426

+ {

11427

+ int l;

11428

+ bar (0);

11429

+ for (l = 1; l < 5; l++)

11430

+ {

11431

+ int m;

11432

+ for (m = 6; m; m--)

11433

+ {

11434

+ v--;

11435

+ *ps = *pc;

11436

+ }

11437

+ }

11438

+ }

11439

+}

11440

+

11441

+int

11442

+main ()

11443

+{

11444

+ foo ();

11445

+ if (v != 0)

11446

+ abort ();

11447

+ return 0;

11448

+}

11449

Index: gcc/testsuite/gcc.dg/torture/pr58143-3.c

11450

===================================================================

11451

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-3.c (.../tags/gcc_4_8_2_release)

11452

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-3.c (.../branches/gcc-4_8-branch)

11453

@@ -0,0 +1,18 @@

11454

+/* { dg-do run } */

11455

+/* { dg-additional-options "-fstrict-overflow" } */

11456

+

11457

+int a, b, c, d, e;

11458

+

11459

+int

11460

+main ()

11461

+{

11462

+ for (b = 4; b > -30; b--)

11463

+ for (; c;)

11464

+ for (;;)

11465

+ {

11466

+ e = a > __INT_MAX__ - b;

11467

+ if (d)

11468

+ break;

11469

+ }

11470

+ return 0;

11471

+}

11472

Index: gcc/testsuite/gcc.dg/torture/pr59288.c

11473

===================================================================

11474

--- a/src/gcc/testsuite/gcc.dg/torture/pr59288.c (.../tags/gcc_4_8_2_release)

11475

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59288.c (.../branches/gcc-4_8-branch)

11476

@@ -0,0 +1,9 @@

11477

+/* { dg-do compile } */

11478

+

11479

+void

11480

+baz (int *d)

11481

+{

11482

+ long int i, j, k;

11483

+ for (i = 0, j = 0, k = 0; i < 512; i = (int) i + 1, j = (int) j + 1, k = (int) k + 3)

11484

+ d[i] = j ^ (i * 3) ^ (2 * k + 2);

11485

+}

11486

Index: gcc/testsuite/gcc.dg/torture/pr59330.c

11487

===================================================================

11488

--- a/src/gcc/testsuite/gcc.dg/torture/pr59330.c (.../tags/gcc_4_8_2_release)

11489

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59330.c (.../branches/gcc-4_8-branch)

11490

@@ -0,0 +1,17 @@

11491

+/* { dg-do run } */

11492

+

11493

+void free(void *ptr)

11494

+{

11495

+}

11496

+

11497

+void *foo(void)

11498

+{

11499

+ return 0;

11500

+}

11501

+

11502

+int main(void)

11503

+{

11504

+ void *p = foo();

11505

+ free(p);

11506

+ return 0;

11507

+}

11508

Index: gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c

11509

===================================================================

11510

--- a/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c (.../tags/gcc_4_8_2_release)

11511

+++ b/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c (.../branches/gcc-4_8-branch)

11512

@@ -0,0 +1,14 @@

11513

+/* { dg-do run } */

11514

+/* { dg-options "-O3" } */

11515

+

11516

+int a, c, e[5][2];

11517

+unsigned int d;

11518

+

11519

+int

11520

+main ()

11521

+{

11522

+ for (d = 0; d < 2; d++)

11523

+ if (a ? 0 : e[c + 3][d] & e[c + 4][d])

11524

+ break;

11525

+ return 0;

11526

+}

11527

Index: gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c

11528

===================================================================

11529

--- a/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c (.../tags/gcc_4_8_2_release)

11530

+++ b/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c (.../branches/gcc-4_8-branch)

11531

@@ -0,0 +1,18 @@

11532

+/* { dg-do run } */

11533

+/* { dg-options "-O3 -fdump-tree-pcom-details" } */

11534

+

11535

+int b, f, d[5][2];

11536

+unsigned int c;

11537

+

11538

+int

11539

+main ()

11540

+{

11541

+ for (c = 0; c < 2; c++)

11542

+ if (d[b + 3][c] & d[b + 4][c])

11543

+ if (f)

11544

+ break;

11545

+ return 0;

11546

+}

11547

+

11548

+/* { dg-final { scan-tree-dump "Executing predictive commoning" "pcom" } } */

11549

+/* { dg-final { cleanup-tree-dump "pcom" } } */

11550

Index: gcc/testsuite/gcc.dg/ipa/pr59610.c

11551

===================================================================

11552

--- a/src/gcc/testsuite/gcc.dg/ipa/pr59610.c (.../tags/gcc_4_8_2_release)

11553

+++ b/src/gcc/testsuite/gcc.dg/ipa/pr59610.c (.../branches/gcc-4_8-branch)

11554

@@ -0,0 +1,11 @@

11555

+/* { dg-do compile } */

11556

+/* { dg-options "-O2" } */

11557

+

11558

+struct A { int a; };

11559

+extern void *y;

11560

+

11561

+__attribute__((optimize (0))) void

11562

+foo (void *p, struct A x)

11563

+{

11564

+ foo (y, x);

11565

+}

11566

Index: gcc/testsuite/gcc.dg/strlenopt-1f.c

11567

===================================================================

11568

--- a/src/gcc/testsuite/gcc.dg/strlenopt-1f.c (.../tags/gcc_4_8_2_release)

11569

+++ b/src/gcc/testsuite/gcc.dg/strlenopt-1f.c (.../branches/gcc-4_8-branch)

11570

@@ -6,13 +6,13 @@

11571

#include "strlenopt-1.c"

11572

11573

/* { dg-final { scan-tree-dump-times "strlen \\(" 2 "strlen" } } */

11574

-/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 3 "strlen" } } */

11575

-/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 1 "strlen" } } */

11576

+/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 0 "strlen" } } */

11577

+/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 0 "strlen" } } */

11578

/* { dg-final { scan-tree-dump-times "__strcat_chk \\(" 0 "strlen" } } */

11579

/* { dg-final { scan-tree-dump-times "strchr \\(" 0 "strlen" } } */

11580

/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 0 "strlen" } } */

11581

-/* { dg-final { scan-tree-dump-times "memcpy \\(" 0 "strlen" } } */

11582

-/* { dg-final { scan-tree-dump-times "strcpy \\(" 0 "strlen" } } */

11583

+/* { dg-final { scan-tree-dump-times "memcpy \\(" 3 "strlen" } } */

11584

+/* { dg-final { scan-tree-dump-times "strcpy \\(" 1 "strlen" } } */

11585

/* { dg-final { scan-tree-dump-times "strcat \\(" 0 "strlen" } } */

11586

/* { dg-final { scan-tree-dump-times "stpcpy \\(" 0 "strlen" } } */

11587

/* { dg-final { cleanup-tree-dump "strlen" } } */

11588

Index: gcc/testsuite/ChangeLog

11589

===================================================================

11590

--- a/src/gcc/testsuite/ChangeLog (.../tags/gcc_4_8_2_release)

11591

+++ b/src/gcc/testsuite/ChangeLog (.../branches/gcc-4_8-branch)

11592

@@ -1,3 +1,607 @@

11593

+2014-01-10 Hans-Peter Nilsson <hp@axis.com>

11594

+

11595

+ * gcc.dg/pr46309.c: Disable for cris*-*-*.

11596

+

11597

+2014-01-10 Paolo Carlini <paolo.carlini@oracle.com>

11598

+

11599

+ PR c++/56060

11600

+ PR c++/59730

11601

+ * g++.dg/cpp0x/variadic144.C: New.

11602

+ * g++.dg/cpp0x/variadic145.C: Likewise.

11603

+

11604

+2014-01-10 Richard Biener <rguenther@suse.de>

11605

+

11606

+ PR tree-optimization/59715

11607

+ * gcc.dg/torture/pr59715.c: New testcase.

11608

+

11609

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

11610

+

11611

+ * gcc.target/mips/bswap-1.c, gcc.target/mips/bswap-2.c,

11612

+ gcc.target/mips/bswap-3.c, gcc.target/mips/bswap-4.c,

11613

+ gcc.target/mips/bswap-5.c, gcc.target/mips/bswap-6.c: New tests.

11614

+

11615

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

11616

+

11617

+ PR rtl-optimization/59137

11618

+ * gcc.target/mips/pr59137.c: New test.

11619

+

11620

+2014-01-09 Richard Biener <rguenther@suse.de>

11621

+

11622

+ Backport from mainline

11623

+ 2013-11-18 Richard Biener <rguenther@suse.de>

11624

+

11625

+ PR tree-optimization/59125

11626

+ PR tree-optimization/54570

11627

+ * gcc.dg/builtin-object-size-8.c: Un-xfail.

11628

+ * gcc.dg/builtin-object-size-14.c: New testcase.

11629

+ * gcc.dg/strlenopt-14gf.c: Adjust.

11630

+ * gcc.dg/strlenopt-1f.c: Likewise.

11631

+ * gcc.dg/strlenopt-4gf.c: Likewise.

11632

+

11633

+ 2013-12-03 Jakub Jelinek <jakub@redhat.com>

11634

+

11635

+ PR tree-optimization/59362

11636

+ * gcc.c-torture/compile/pr59362.c: New test.

11637

+

11638

+2014-01-09 Richard Earnshaw <rearnsha@arm.com>

11639

+

11640

+ PR rtl-optimization/54300

11641

+ * gcc.target/arm/pr54300.C: New test.

11642

+

11643

+2014-01-08 Martin Jambor <mjambor@suse.cz>

11644

+

11645

+ PR ipa/59610

11646

+ * gcc.dg/ipa/pr59610.c: New test.

11647

+

11648

+2014-01-07 Jakub Jelinek <jakub@redhat.com>

11649

+

11650

+ PR rtl-optimization/58668

11651

+ * gcc.dg/pr58668.c: New test.

11652

+

11653

+ Backported from mainline

11654

+ 2013-12-16 Jakub Jelinek <jakub@redhat.com>

11655

+

11656

+ PR middle-end/58956

11657

+ PR middle-end/59470

11658

+ * gcc.target/i386/pr59470.c: New test.

11659

+

11660

+2014-01-04 Janus Weil <janus@gcc.gnu.org>

11661

+

11662

+ Backport from mainline

11663

+ 2014-01-02 Janus Weil <janus@gcc.gnu.org>

11664

+

11665

+ PR fortran/59654

11666

+ * gfortran.dg/dynamic_dispatch_12.f90: New.

11667

+

11668

+2014-01-03 Joseph Myers <joseph@codesourcery.com>

11669

+

11670

+ * gcc.target/powerpc/rs6000-ldouble-3.c: New test.

11671

+

11672

+2014-01-03 Jakub Jelinek <jakub@redhat.com>

11673

+

11674

+ PR target/59625

11675

+ * gcc.target/i386/pr59625.c: New test.

11676

+

11677

+2014-01-01 Jakub Jelinek <jakub@redhat.com>

11678

+

11679

+ PR rtl-optimization/59647

11680

+ * g++.dg/opt/pr59647.C: New test.

11681

+

11682

+2013-12-31 Janus Weil <janus@gcc.gnu.org>

11683

+

11684

+ Backport from mainline

11685

+ 2013-12-30 Janus Weil <janus@gcc.gnu.org>

11686

+

11687

+ PR fortran/58998

11688

+ * gfortran.dg/generic_28.f90: New.

11689

+

11690

+2013-12-20 Jakub Jelinek <jakub@redhat.com>

11691

+

11692

+ PR c++/59255

11693

+ * g++.dg/tree-prof/pr59255.C: New test.

11694

+

11695

+2013-12-19 James Greenhalgh <james.greenhalgh@arm.com>

11696

+

11697

+ Backport from Mainline

11698

+ 2013-05-01 James Greenhalgh <james.greenhalgh@arm.com>

11699

+

11700

+ * gcc.target/aarch64/scalar_intrinsics.c (force_simd): New.

11701

+ (test_vceqd_s64): Force arguments to SIMD registers.

11702

+ (test_vceqzd_s64): Likewise.

11703

+ (test_vcged_s64): Likewise.

11704

+ (test_vcled_s64): Likewise.

11705

+ (test_vcgezd_s64): Likewise.

11706

+ (test_vcged_u64): Likewise.

11707

+ (test_vcgtd_s64): Likewise.

11708

+ (test_vcltd_s64): Likewise.

11709

+ (test_vcgtzd_s64): Likewise.

11710

+ (test_vcgtd_u64): Likewise.

11711

+ (test_vclezd_s64): Likewise.

11712

+ (test_vcltzd_s64): Likewise.

11713

+ (test_vtst_s64): Likewise.

11714

+ (test_vtst_u64): Likewise.

11715

+

11716

+2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

11717

+ Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

11718

+

11719

+ Backport from mainline

11720

+ 2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

11721

+ * gcc/testsuite/gcc.target/s390/hotpatch-1.c: New test

11722

+ * gcc/testsuite/gcc.target/s390/hotpatch-2.c: New test

11723

+ * gcc/testsuite/gcc.target/s390/hotpatch-3.c: New test

11724

+ * gcc/testsuite/gcc.target/s390/hotpatch-4.c: New test

11725

+ * gcc/testsuite/gcc.target/s390/hotpatch-5.c: New test

11726

+ * gcc/testsuite/gcc.target/s390/hotpatch-6.c: New test

11727

+ * gcc/testsuite/gcc.target/s390/hotpatch-7.c: New test

11728

+ * gcc/testsuite/gcc.target/s390/hotpatch-8.c: New test

11729

+ * gcc/testsuite/gcc.target/s390/hotpatch-9.c: New test

11730

+ * gcc/testsuite/gcc.target/s390/hotpatch-10.c: New test

11731

+ * gcc/testsuite/gcc.target/s390/hotpatch-11.c: New test

11732

+ * gcc/testsuite/gcc.target/s390/hotpatch-12.c: New test

11733

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c: New test

11734

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c: New test

11735

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c: New test

11736

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c: New test

11737

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c: New test

11738

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c: New test

11739

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c: New test

11740

+

11741

+2013-12-18 Janus Weil <janus@gcc.gnu.org>

11742

+

11743

+ Backport from mainline

11744

+ 2013-12-15 Janus Weil <janus@gcc.gnu.org>

11745

+

11746

+ PR fortran/59493

11747

+ * gfortran.dg/unlimited_polymorphic_15.f90: New.

11748

+

11749

+2013-12-15 Uros Bizjak <ubizjak@gmail.com>

11750

+

11751

+ PR testsuite/58630

11752

+ * gcc.target/i386/pr43662.c (dg-options):

11753

+ Add -maccumulate-outgoing-args.

11754

+ * gcc.target/i386/pr43869.c (dg-options): Ditto.

11755

+ * gcc.target/i386/pr57003.c (dg-options): Ditto.

11756

+ * gcc.target/i386/avx-vzeroupper-16.c (dg-options):

11757

+ Remove -mtune=generic and add -maccumulate-outgoing-args instead.

11758

+ * gcc.target/i386/avx-vzeroupper-17.c (dg-options): Ditto.

11759

+ * gcc.target/i386/avx-vzeroupper-18.c (dg-options): Ditto.

11760

+ * gcc.target/x86_64/abi/callabi/func-1.c (dg-options):

11761

+ Add -maccumulate-outgoing-args.

11762

+ * gcc.target/x86_64/abi/callabi/func-2a.c (dg-options): Ditto.

11763

+ * gcc.target/x86_64/abi/callabi/func-2b.c (dg-options): Ditto.

11764

+ * gcc.target/x86_64/abi/callabi/func-indirect.c (dg-options): Ditto.

11765

+ * gcc.target/x86_64/abi/callabi/func-indirect-2a.c (dg-options): Ditto.

11766

+ * gcc.target/x86_64/abi/callabi/func-indirect-2b.c (dg-options): Ditto.

11767

+ * gcc.target/x86_64/abi/callabi/leaf-1.c (dg-options): Ditto.

11768

+ * gcc.target/x86_64/abi/callabi/leaf-2.c (dg-options): Ditto.

11769

+ * gcc.target/x86_64/abi/callabi/pr38891.c (dg-options): Ditto.

11770

+ * gcc.target/x86_64/abi/callabi/vaarg-1.c (dg-options): Ditto.

11771

+ * gcc.target/x86_64/abi/callabi/vaarg-2.c (dg-options): Ditto.

11772

+ * gcc.target/x86_64/abi/callabi/vaarg-3.c (dg-options): Ditto.

11773

+ * gcc.target/x86_64/abi/callabi/vaarg-4a.c (dg-options): Ditto.

11774

+ * gcc.target/x86_64/abi/callabi/vaarg-4b.c (dg-options): Ditto.

11775

+ * gcc.target/x86_64/abi/callabi/vaarg-5a.c (dg-options): Ditto.

11776

+ * gcc.target/x86_64/abi/callabi/vaarg-5b.c (dg-options): Ditto.

11777

+

11778

+2013-12-12 Jakub Jelinek <jakub@redhat.com>

11779

+

11780

+ PR middle-end/59470

11781

+ * g++.dg/opt/pr59470.C: New test.

11782

+

11783

+ PR libgomp/59467

11784

+ * gfortran.dg/gomp/pr59467.f90: New test.

11785

+ * c-c++-common/gomp/pr59467.c: New test.

11786

+

11787

+2013-12-12 Uros Bizjak <ubizjak@gmail.com>

11788

+

11789

+ Backport from mainline

11790

+ 2013-12-12 Ryan Mansfield <rmansfield@qnx.com>

11791

+

11792

+ PR testsuite/59442

11793

+ * gcc.target/i386/sse2-movapd-1.c: Fix alignment attributes.

11794

+ * gcc.target/i386/sse2-movapd-2.c: Likewise.

11795

+ * gcc.target/i386/avx-vmovapd-256-1.c: Likewise.

11796

+ * gcc.target/i386/avx-vmovapd-256-2.c: Likewise.

11797

+

11798

+2013-12-08 Uros Bizjak <ubizjak@gmail.com>

11799

+

11800

+ Backport from mainline

11801

+ 2013-12-06 Uros Bizjak <ubizjak@gmail.com>

11802

+

11803

+ PR target/59405

11804

+ * gcc.target/i386/pr59405.c: New test.

11805

+

11806

+2013-12-06 Jakub Jelinek <jakub@redhat.com>

11807

+

11808

+ PR tree-optimization/59388

11809

+ * gcc.c-torture/execute/pr59388.c: New test.

11810

+

11811

+2013-12-06 Richard Biener <rguenther@suse.de>

11812

+

11813

+ Backport from mainline

11814

+ 2013-11-28 Richard Biener <rguenther@suse.de>

11815

+

11816

+ PR tree-optimization/59330

11817

+ * gcc.dg/torture/pr59330.c: New testcase.

11818

+

11819

+2013-12-06 Richard Biener <rguenther@suse.de>

11820

+

11821

+ Backport from mainline

11822

+ 2013-11-27 Richard Biener <rguenther@suse.de>

11823

+

11824

+ PR tree-optimization/59288

11825

+ * gcc.dg/torture/pr59288.c: New testcase.

11826

+

11827

+ 2013-11-19 Richard Biener <rguenther@suse.de>

11828

+

11829

+ PR tree-optimization/59164

11830

+ * gcc.dg/torture/pr59164.c: New testcase.

11831

+

11832

+ 2013-09-05 Richard Biener <rguenther@suse.de>

11833

+

11834

+ PR tree-optimization/58137

11835

+ * gcc.target/i386/pr58137.c: New testcase.

11836

+

11837

+2013-12-06 Oleg Endo <olegendo@gcc.gnu.org>

11838

+

11839

+ PR target/51244

11840

+ PR target/59343

11841

+ * gcc.target/sh/pr51244-19.c: Adjust test case.

11842

+

11843

+2013-12-05 Richard Biener <rguenther@suse.de>

11844

+

11845

+ Backport from mainline

11846

+ 2013-11-19 Richard Biener <rguenther@suse.de>

11847

+

11848

+ PR middle-end/58956

11849

+ * gcc.dg/torture/pr58956.c: New testcase.

11850

+

11851

+2013-12-04 Jakub Jelinek <jakub@redhat.com>

11852

+

11853

+ PR c++/59268

11854

+ * g++.dg/cpp0x/constexpr-template6.C: New test.

11855

+

11856

+ PR rtl-optimization/58726

11857

+ * gcc.c-torture/execute/pr58726.c: New test.

11858

+

11859

+ PR target/59163

11860

+ * g++.dg/torture/pr59163.C: New test.

11861

+

11862

+2013-12-03 Marek Polacek <polacek@redhat.com>

11863

+

11864

+ Backport from mainline

11865

+ 2013-12-03 Marek Polacek <polacek@redhat.com>

11866

+

11867

+ PR c/59351

11868

+ * gcc.dg/pr59351.c: New test.

11869

+

11870

+2013-12-03 Jakub Jelinek <jakub@redhat.com>

11871

+

11872

+ PR middle-end/59011

11873

+ * gcc.dg/pr59011.c: New test.

11874

+

11875

+ PR target/58864

11876

+ * g++.dg/opt/pr58864.C: New test.

11877

+

11878

+2013-12-02 Jakub Jelinek <jakub@redhat.com>

11879

+

11880

+ PR tree-optimization/59358

11881

+ * gcc.c-torture/execute/pr59358.c: New test.

11882

+

11883

+2013-12-02 Richard Biener <rguenther@suse.de>

11884

+

11885

+ PR tree-optimization/59139

11886

+ * gcc.dg/torture/pr59139.c: New testcase.

11887

+

11888

+2013-11-27 Tom de Vries <tom@codesourcery.com>

11889

+ Marc Glisse <marc.glisse@inria.fr>

11890

+

11891

+ PR c++/59032

11892

+ * c-c++-common/pr59032.c: New testcase.

11893

+

11894

+2013-11-27 Tom de Vries <tom@codesourcery.com>

11895

+ Marc Glisse <marc.glisse@inria.fr>

11896

+

11897

+ PR middle-end/59037

11898

+ * c-c++-common/pr59037.c: New testcase.

11899

+

11900

+2013-11-30 Paul Thomas <pault@gcc.gnu.org>

11901

+

11902

+ Backport from mainline

11903

+ 2013-11-04 Paul Thomas <pault@gcc.gnu.org>

11904

+

11905

+ PR fortran/57445

11906

+ * gfortran.dg/optional_class_1.f90 : New test

11907

+

11908

+2013-11-29 Jakub Jelinek <jakub@redhat.com>

11909

+

11910

+ PR c/59280

11911

+ * c-c++-common/pr59280.c: New test.

11912

+

11913

+2013-11-28 Jakub Jelinek <jakub@redhat.com>

11914

+

11915

+ PR c++/59297

11916

+ * g++.dg/gomp/pr59297.C: New test.

11917

+

11918

+2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

11919

+

11920

+ Backport from mainline

11921

+ 2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

11922

+

11923

+ * gcc.target/arm/vrinta-ce.c: New testcase.

11924

+

11925

+2013-11-28 Uros Bizjak <ubizjak@gmail.com>

11926

+

11927

+ Backport from mainline

11928

+ 2013-11-23 Uros Bizjak <ubizjak@gmail.com>

11929

+

11930

+ PR target/56788

11931

+ * config/i386/i386.c (bdesc_multi_arg) <IX86_BUILTIN_VFRCZSS>:

11932

+ Declare as MULTI_ARG_1_SF instruction.

11933

+ <IX86_BUILTIN_VFRCZSD>: Decleare as MULTI_ARG_1_DF instruction.

11934

+ * config/i386/sse.md (*xop_vmfrcz<mode>2): Rename

11935

+ from *xop_vmfrcz_<mode>.

11936

+ * config/i386/xopintrin.h (_mm_frcz_ss): Use __builtin_ia32_movss

11937

+ to merge scalar result with __A.

11938

+ (_mm_frcz_sd): Use __builtin_ia32_movsd to merge scalar

11939

+ result with __A.

11940

+

11941

+2013-11-28 Terry Guo <terry.guo@arm.com>

11942

+

11943

+ Backport mainline r205391

11944

+ 2013-11-26 Terry Guo <terry.guo@arm.com>

11945

+

11946

+ * gcc.target/arm/thumb1-pic-high-reg.c: New case.

11947

+ * gcc.target/arm/thumb1-pic-single-base.c: New case.

11948

+

11949

+2013-11-27 Jakub Jelinek <jakub@redhat.com>

11950

+

11951

+ Backported from mainline

11952

+ 2013-11-27 Jakub Jelinek <jakub@redhat.com>

11953

+

11954

+ PR tree-optimization/59014

11955

+ * gcc.c-torture/execute/pr59014-2.c: New test.

11956

+

11957

+ 2013-11-26 Jakub Jelinek <jakub@redhat.com>

11958

+

11959

+ PR tree-optimization/59014

11960

+ * gcc.c-torture/execute/pr59014.c: New test.

11961

+

11962

+2013-11-27 Eric Botcazou <ebotcazou@adacore.com>

11963

+

11964

+ * gcc.c-torture/execute/20131127-1.c: New test.

11965

+

11966

+2013-11-25 Vidya Praveen <vidyapraveen@arm.com>

11967

+

11968

+ Backport from mainline

11969

+ 2013-10-21 Vidya Praveen <vidyapraveen@arm.com>

11970

+

11971

+ * gcc.dg/20050922-1.c: Remove stdlib.h and declare abort().

11972

+ * gcc.dg/20050922-1.c: Remove stdlib.h and declare abort() and exit().

11973

+

11974

+2013-11-20 Dominik Vogt <vogt@linux.vnet.ibm.com>

11975

+

11976

+ Backport from mainline

11977

+ * gcc.target/s390/htm-1.c: Rename to ...

11978

+ * gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c: ... this

11979

+ one.

11980

+ * gcc.target/s390/htm-xl-intrin-1.c: Rename to ...

11981

+ * gcc.target/s390/htm-builtins-compile-3.c: ... this one.

11982

+ * gcc.target/s390/htm-builtins-compile-2.c: New testcase.

11983

+ * gcc.target/s390/htm-builtins-1.c: New testcase.

11984

+ * gcc.target/s390/htm-builtins-2.c: New testcase.

11985

+ * gcc.target/s390/s390.exp: Add check for htm machine.

11986

+

11987

+2013-11-19 Richard Biener <rguenther@suse.de>

11988

+

11989

+ PR tree-optimization/57517

11990

+ * gfortran.fortran-torture/compile/pr57517.f90: New testcase.

11991

+ * gcc.dg/torture/pr57517.c: Likewise.

11992

+

11993

+2013-11-19 Richard Biener <rguenther@suse.de>

11994

+

11995

+ Backport from mainline

11996

+ 2013-11-05 Richard Biener <rguenther@suse.de>

11997

+

11998

+ PR middle-end/58941

11999

+ * gcc.dg/torture/pr58941.c: New testcase.

12000

+

12001

+2013-11-18 Richard Biener <rguenther@suse.de>

12002

+

12003

+ Backport from mainline

12004

+ 2013-10-21 Richard Biener <rguenther@suse.de>

12005

+

12006

+ PR tree-optimization/58794

12007

+ * c-c++-common/torture/pr58794-1.c: New testcase.

12008

+ * c-c++-common/torture/pr58794-2.c: Likewise.

12009

+

12010

+ 2013-10-21 Richard Biener <rguenther@suse.de>

12011

+

12012

+ PR middle-end/58742

12013

+ * c-c++-common/fold-divmul-1.c: New testcase.

12014

+

12015

+ 2013-11-06 Richard Biener <rguenther@suse.de>

12016

+

12017

+ PR tree-optimization/58653

12018

+ * gcc.dg/tree-ssa/predcom-6.c: New testcase.

12019

+ * gcc.dg/tree-ssa/predcom-7.c: Likewise.

12020

+

12021

+ PR tree-optimization/59047

12022

+ * gcc.dg/torture/pr59047.c: New testcase.

12023

+

12024

+ 2013-10-15 Richard Biener <rguenther@suse.de>

12025

+

12026

+ PR tree-optimization/58143

12027

+ * gcc.dg/torture/pr58143-1.c: New testcase.

12028

+ * gcc.dg/torture/pr58143-2.c: Likewise.

12029

+ * gcc.dg/torture/pr58143-3.c: Likewise.

12030

+

12031

+2013-11-17 Janus Weil <janus@gcc.gnu.org>

12032

+

12033

+ Backport from mainline

12034

+ 2013-11-07 Janus Weil <janus@gcc.gnu.org>

12035

+

12036

+ PR fortran/58471

12037

+ * gfortran.dg/constructor_9.f90: New.

12038

+

12039

+2013-11-16 Janus Weil <janus@gcc.gnu.org>

12040

+

12041

+ Backport from mainline

12042

+ 2013-09-20 Janus Weil <janus@gcc.gnu.org>

12043

+

12044

+ PR fortran/58099

12045

+ * gfortran.dg/proc_ptr_43.f90: New.

12046

+

12047

+2013-11-16 Paul Thomas <pault@gcc.gnu.org>

12048

+

12049

+ PR fortran/58771

12050

+ * gfortran.dg/derived_external_function_1.f90 : New test

12051

+

12052

+2013-11-14 Uros Bizjak <ubizjak@gmail.com>

12053

+

12054

+ Backport from mainline

12055

+ 2013-11-06 Uros Bizjak <ubizjak@gmail.com>

12056

+

12057

+ PR target/59021

12058

+ * gcc.target/i386/pr59021.c: New test.

12059

+

12060

+2013-11-14 Jakub Jelinek <jakub@redhat.com>

12061

+

12062

+ PR target/59101

12063

+ * gcc.c-torture/execute/pr59101.c: New test.

12064

+

12065

+2013-11-11 Jakub Jelinek <jakub@redhat.com>

12066

+

12067

+ Backported from mainline

12068

+ 2013-11-06 Jakub Jelinek <jakub@redhat.com>

12069

+

12070

+ PR middle-end/58970

12071

+ * gcc.c-torture/compile/pr58970-1.c: New test.

12072

+ * gcc.c-torture/compile/pr58970-2.c: New test.

12073

+

12074

+ 2013-11-05 Jakub Jelinek <jakub@redhat.com>

12075

+

12076

+ PR rtl-optimization/58997

12077

+ * gcc.c-torture/compile/pr58997.c: New test.

12078

+

12079

+2013-11-10 Wei Mi <wmi@google.com>

12080

+

12081

+ * gcc.dg/pr57518.c: Backport regex fix from r200720.

12082

+

12083

+2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

12084

+

12085

+ Backport from mainline

12086

+ 2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

12087

+

12088

+ PR target/59034

12089

+ * gcc.target/i386/pr59034-1.c: New test.

12090

+ * gcc.target/i386/pr59034-2.c: Likewise.

12091

+

12092

+2013-11-06 Wei Mi <wmi@google.com>

12093

+

12094

+ PR regression/58985

12095

+ * gcc.dg/pr57518.c: Add subreg in regexp pattern.

12096

+

12097

+2013-11-05 Steven G. Kargl <kargl@gcc.gnu.org>

12098

+

12099

+ PR fortran/58989

12100

+ * gfortran.dg/reshape_6.f90: New test.

12101

+

12102

+2013-11-05 Jakub Jelinek <jakub@redhat.com>

12103

+

12104

+ PR tree-optimization/58984

12105

+ * gcc.c-torture/execute/pr58984.c: New test.

12106

+

12107

+2013-11-04 Marek Polacek <polacek@redhat.com>

12108

+

12109

+ Backport from mainline

12110

+ 2013-11-04 Marek Polacek <polacek@redhat.com>

12111

+

12112

+ PR c++/58979

12113

+ * g++.dg/diagnostic/pr58979.C: New test.

12114

+

12115

+2013-11-03 H.J. Lu <hongjiu.lu@intel.com>

12116

+

12117

+ Backport from mainline

12118

+ 2013-10-12 H.J. Lu <hongjiu.lu@intel.com>

12119

+

12120

+ PR target/58690

12121

+ * gcc.target/i386/pr58690.c: New test

12122

+

12123

+2013-11-02 Janus Weil <janus@gcc.gnu.org>

12124

+

12125

+ Backport from mainline

12126

+ 2013-09-23 Janus Weil <janus@gcc.gnu.org>

12127

+

12128

+ PR fortran/58355

12129

+ * gfortran.dg/extends_15.f90: New.

12130

+

12131

+2013-10-29 Uros Bizjak <ubizjak@gmail.com>

12132

+

12133

+ Backport from mainline

12134

+ 2013-08-08 Richard Sandiford <rdsandiford@googlemail.com>

12135

+

12136

+ PR rtl-optimization/58079

12137

+ * gcc.dg/torture/pr58079.c: New test.

12138

+

12139

+2013-10-28 Tom de Vries <tom@codesourcery.com>

12140

+

12141

+ * gcc.target/arm/require-pic-register-loc.c: New test.

12142

+

12143

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

12144

+

12145

+ Backport from mainline

12146

+ 2013-10-22 Uros Bizjak <ubizjak@gmail.com>

12147

+

12148

+ PR target/58779

12149

+ * gcc.target/i386/pr30315.c: Remove MINUSCC, DECCC, MINUSCCONLY

12150

+ and MINUSCCZEXT defines. Update scan-assembler dg directive.

12151

+ * gcc.dg/torture/pr58779.c: New test.

12152

+

12153

+2013-10-25 Richard Henderson <rth@redhat.com>

12154

+

12155

+ PR rtl/58542

12156

+ * gcc.dg/atomic-store-6.c: New.

12157

+

12158

+2013-10-25 Tom de Vries <tom@codesourcery.com>

12159

+

12160

+ PR c++/58282

12161

+ * g++.dg/tm/noexcept-6.C: New test.

12162

+

12163

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

12164

+

12165

+ * gcc.c-torture/execute/pr58831.c: New test.

12166

+

12167

+2013-10-23 Tom de Vries <tom@codesourcery.com>

12168

+

12169

+ PR tree-optimization/58805

12170

+ * gcc.dg/pr58805.c: New test.

12171

+

12172

+2013-10-23 Richard Biener <rguenther@suse.de>

12173

+

12174

+ * gcc.dg/torture/pr58830.c: New testcase.

12175

+

12176

+ Backport from mainline

12177

+ 2013-06-24 Richard Biener <rguenther@suse.de>

12178

+

12179

+ PR tree-optimization/57488

12180

+ * gcc.dg/torture/pr57488.c: New testcase.

12181

+

12182

+2013-10-19 Oleg Endo <olegendo@gcc.gnu.org>

12183

+

12184

+ * gcc.target/sh/pr54089-3.c: Fix test for load of constant 31.

12185

+

12186

+2013-10-17 Paolo Carlini <paolo.carlini@oracle.com>

12187

+

12188

+ PR c++/58596

12189

+ * g++.dg/cpp0x/lambda/lambda-nsdmi5.C: New

12190

+

12191

+2013-10-16 Paolo Carlini <paolo.carlini@oracle.com>

12192

+

12193

+ PR c++/58633

12194

+ * g++.dg/cpp0x/decltype57.C: New.

12195

+ * g++.dg/cpp0x/enum18.C: Revert r174385 changes.

12196

+

12197

2013-10-16 Release Manager

12198

12199

* GCC 4.8.2 released.

12200

@@ -39,9 +643,9 @@

12201

Backport from mainline

12202

2013-06-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

12203

12204

- * gcc.target/s390/htm-1.c: New file.

12205

- * gcc.target/s390/htm-nofloat-1.c: New file.

12206

- * gcc.target/s390/htm-xl-intrin-1.c: New file.

12207

+ * gcc.target/s390/htm-1.c: New file.

12208

+ * gcc.target/s390/htm-nofloat-1.c: New file.

12209

+ * gcc.target/s390/htm-xl-intrin-1.c: New file.

12210

12211

2013-10-04 Tobias Burnus <burnus@net-b.de>

12212

12213

@@ -307,8 +911,8 @@

12214

Backport from mainline

12215

2013-08-12 Perez Read <netfirewall@gmail.com>

12216

12217

- PR target/58132

12218

- * gcc.target/i386/movabs-1.c: New test.

12219

+ PR target/58132

12220

+ * gcc.target/i386/movabs-1.c: New test.

12221

12222

2013-08-11 Janus Weil <janus@gcc.gnu.org>

12223

12224

@@ -494,7 +1098,7 @@

12225

2013-06-19 Wei Mi <wmi@google.com>

12226

12227

PR rtl-optimization/57518

12228

- * testsuite/gcc.dg/pr57518.c: New test.

12229

+ * gcc.dg/pr57518.c: New test.

12230

12231

2013-06-11 Tobias Burnus <burnus@net-b.de>

12232

12233

@@ -623,8 +1227,8 @@

12234

12235

2013-05-09 Martin Jambor <mjambor@suse.cz>

12236

12237

- PR middle-end/56988

12238

- * gcc.dg/ipa/pr56988.c: New test.

12239

+ PR middle-end/56988

12240

+ * gcc.dg/ipa/pr56988.c: New test.

12241

12242

2013-05-08 Marc Glisse <marc.glisse@inria.fr>

12243

12244

@@ -701,7 +1305,7 @@

12245

2013-04-25 Marek Polacek <polacek@redhat.com>

12246

12247

PR tree-optimization/57066

12248

- * gcc.dg/torture/builtin-logb-1.c: Adjust testcase.

12249

+ * gcc.dg/torture/builtin-logb-1.c: Adjust testcase.

12250

12251

2013-05-02 Jakub Jelinek <jakub@redhat.com>

12252

12253

@@ -727,32 +1331,32 @@

12254

Backport from mainline

12255

2013-04-24 Vladimir Makarov <vmakarov@redhat.com>

12256

12257

- PR rtl-optimizations/57046

12258

- * gcc.target/i386/pr57046.c: New test.

12259

+ PR rtl-optimizations/57046

12260

+ * gcc.target/i386/pr57046.c: New test.

12261

12262

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

12263

12264

Backport from mainline

12265

2013-04-22 Vladimir Makarov <vmakarov@redhat.com>

12266

12267

- PR target/57018

12268

- * gcc.target/i386/pr57018.c: New test.

12269

+ PR target/57018

12270

+ * gcc.target/i386/pr57018.c: New test.

12271

12272

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

12273

12274

Backport from mainline

12275

2013-04-18 Jakub Jelinek <jakub@redhat.com>

12276

12277

- PR rtl-optimization/56999

12278

- * g++.dg/opt/pr56999.C: New test.

12279

+ PR rtl-optimization/56999

12280

+ * g++.dg/opt/pr56999.C: New test.

12281

12282

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

12283

12284

Backport from mainline

12285

2013-04-19 Vladimir Makarov <vmakarov@redhat.com>

12286

12287

- PR rtl-optimization/56847

12288

- * gcc.dg/pr56847.c: New test.

12289

+ PR rtl-optimization/56847

12290

+ * gcc.dg/pr56847.c: New test.

12291

12292

2013-05-02 Ian Bolton <ian.bolton@arm.com>

12293

12294

@@ -1102,7 +1706,7 @@

12295

2013-03-29 Tobias Burnus <burnus@net-b.de>

12296

12297

PR fortran/56737

12298

- * testsuite/gfortran.dg/fmt_cache_3.f90: New.

12299

+ * gfortran.dg/fmt_cache_3.f90: New.

12300

12301

2013-04-02 Richard Biener <rguenther@suse.de>

12302

12303

@@ -1636,7 +2240,7 @@

12304

2013-02-20 Jan Hubicka <jh@suse.cz>

12305

12306

PR tree-optimization/56265

12307

- * testsuite/g++.dg/ipa/devirt-11.C: New testcase.

12308

+ * g++.dg/ipa/devirt-11.C: New testcase.

12309

12310

2013-02-20 Richard Biener <rguenther@suse.de>

12311

12312

@@ -1823,11 +2427,9 @@

12313

12314

Avoid instrumenting duplicated memory access in the same basic block

12315

* c-c++-common/asan/no-redundant-instrumentation-1.c: New test.

12316

- * testsuite/c-c++-common/asan/no-redundant-instrumentation-2.c:

12317

- Likewise.

12318

- * testsuite/c-c++-common/asan/no-redundant-instrumentation-3.c:

12319

- Likewise.

12320

- * testsuite/c-c++-common/asan/inc.c: Likewise.

12321

+ * c-c++-common/asan/no-redundant-instrumentation-2.c: Likewise.

12322

+ * c-c++-common/asan/no-redundant-instrumentation-3.c: Likewise.

12323

+ * c-c++-common/asan/inc.c: Likewise.

12324

12325

2013-02-12 Vladimir Makarov <vmakarov@redhat.com>

12326

12327

Index: gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90

12328

===================================================================

12329

--- a/src/gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90 (.../tags/gcc_4_8_2_release)

12330

+++ b/src/gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90 (.../branches/gcc-4_8-branch)

12331

@@ -0,0 +1,13 @@

12332

+SUBROUTINE cal_helicity (uh, ph, phb, wavg, ims, ime, its, ite)

12333

+ INTEGER, INTENT( IN ) :: ims, ime, its, ite

12334

+ REAL, DIMENSION( ims:ime), INTENT( IN ) :: ph, phb, wavg

12335

+ REAL, DIMENSION( ims:ime), INTENT( INOUT ) :: uh

12336

+ INTEGER :: i

12337

+ REAL :: zu

12338

+ DO i = its, ite

12339

+ zu = (ph(i ) + phb(i)) + (ph(i-1) + phb(i-1))

12340

+ IF (wavg(i) .GT. 0) THEN

12341

+ uh(i) = uh(i) + zu

12342

+ ENDIF

12343

+ END DO

12344

+END SUBROUTINE cal_helicity

12345

Index: gcc/testsuite/g++.dg/opt/pr59647.C

12346

===================================================================

12347

--- a/src/gcc/testsuite/g++.dg/opt/pr59647.C (.../tags/gcc_4_8_2_release)

12348

+++ b/src/gcc/testsuite/g++.dg/opt/pr59647.C (.../branches/gcc-4_8-branch)

12349

@@ -0,0 +1,32 @@

12350

+// PR rtl-optimization/59647

12351

+// { dg-do compile }

12352

+// { dg-options "-O2 -fno-tree-vrp" }

12353

+// { dg-additional-options "-msse2 -mfpmath=sse" { target { { i?86-*-* x86_64-*-* } && ia32 } } }

12354

+

12355

+void f1 (int);

12356

+void f2 ();

12357

+double f3 (int);

12358

+

12359

+struct A

12360

+{

12361

+ int f4 () const

12362

+ {

12363

+ if (a == 0)

12364

+ return 1;

12365

+ return 0;

12366

+ }

12367

+ unsigned f5 ()

12368

+ {

12369

+ if (!f4 ())

12370

+ f2 ();

12371

+ return a;

12372

+ }

12373

+ int a;

12374

+};

12375

+

12376

+void

12377

+f6 (A *x)

12378

+{

12379

+ unsigned b = x->f5 ();

12380

+ f1 (b - 1 - f3 (x->f5 () - 1U));

12381

+}

12382

Index: gcc/testsuite/g++.dg/opt/pr59470.C

12383

===================================================================

12384

--- a/src/gcc/testsuite/g++.dg/opt/pr59470.C (.../tags/gcc_4_8_2_release)

12385

+++ b/src/gcc/testsuite/g++.dg/opt/pr59470.C (.../branches/gcc-4_8-branch)

12386

@@ -0,0 +1,188 @@

12387

+// PR middle-end/59470

12388

+// { dg-do run }

12389

+// { dg-options "-O2 -fstack-protector" }

12390

+// { dg-additional-options "-fPIC" { target fpic } }

12391

+// { dg-require-effective-target fstack_protector }

12392

+

12393

+struct A

12394

+{

12395

+ int a1;

12396

+ A () throw () : a1 (0) {}

12397

+};

12398

+

12399

+struct B

12400

+{

12401

+ unsigned int b1 () throw ();

12402

+};

12403

+

12404

+__attribute__((noinline, noclone)) unsigned int

12405

+B::b1 () throw ()

12406

+{

12407

+ asm volatile ("" : : : "memory");

12408

+ return 0;

12409

+}

12410

+

12411

+struct C

12412

+{

12413

+ const A **c1;

12414

+ void c2 (const A *, unsigned int);

12415

+};

12416

+

12417

+__attribute__((noinline, noclone)) void

12418

+C::c2 (const A *, unsigned int)

12419

+{

12420

+ asm volatile ("" : : : "memory");

12421

+}

12422

+

12423

+struct D

12424

+{

12425

+ C *d1;

12426

+};

12427

+

12428

+struct E

12429

+{

12430

+ int e1;

12431

+ int e2;

12432

+ D e3;

12433

+};

12434

+

12435

+struct F

12436

+{

12437

+ virtual int f1 (const char * s, int n);

12438

+};

12439

+

12440

+struct G

12441

+{

12442

+ F *g1;

12443

+ bool g2;

12444

+ G & g3 (const char * ws, int len)

12445

+ {

12446

+ if (__builtin_expect (!g2, true)

12447

+ && __builtin_expect (this->g1->f1 (ws, len) != len, false))

12448

+ g2 = true;

12449

+ return *this;

12450

+ }

12451

+};

12452

+

12453

+struct H : public A

12454

+{

12455

+ const char *h1;

12456

+ unsigned int h2;

12457

+ bool h3;

12458

+ const char *h4;

12459

+ char h5;

12460

+ char h6;

12461

+ char h7[31];

12462

+ bool h8;

12463

+ H () : h1 (0), h2 (0), h4 (0), h5 (0), h6 (0), h8 (false) {}

12464

+ void h9 (const D &) __attribute__((noinline, noclone));

12465

+};

12466

+

12467

+void

12468

+H::h9 (const D &)

12469

+{

12470

+ h3 = true;

12471

+ __builtin_memset (h7, 0, sizeof (h7));

12472

+ asm volatile ("" : : : "memory");

12473

+};

12474

+

12475

+B b;

12476

+

12477

+inline const H *

12478

+foo (const D &x)

12479

+{

12480

+ const unsigned int i = b.b1 ();

12481

+ const A **j = x.d1->c1;

12482

+ if (!j[i])

12483

+ {

12484

+ H *k = 0;

12485

+ try

12486

+ {

12487

+ k = new H;

12488

+ k->h9 (x);

12489

+ }

12490

+ catch (...)

12491

+ {

12492

+ }

12493

+ x.d1->c2 (k, i);

12494

+ }

12495

+ return static_cast <const H *>(j[i]);

12496

+}

12497

+

12498

+__attribute__((noinline, noclone)) int

12499

+bar (char *x, unsigned long v, const char *y, int z, bool w)

12500

+{

12501

+ asm volatile ("" : : "r" (x), "r" (v), "r" (y) : "memory");

12502

+ asm volatile ("" : : "r" (z), "r" (w) : "memory");

12503

+ return 8;

12504

+}

12505

+

12506

+__attribute__((noinline, noclone)) void

12507

+baz (void *z, const char *g, unsigned int h, char s, E &e, char *n, char *c, int &l)

12508

+{

12509

+ asm volatile ("" : : "r" (z), "r" (g), "r" (h) : "memory");

12510

+ asm volatile ("" : : "r" (s), "r" (&e), "r" (n) : "memory");

12511

+ asm volatile ("" : : "r" (c), "r" (&l) : "memory");

12512

+ if (n == c)

12513

+ __builtin_abort ();

12514

+ int i = 0;

12515

+ asm ("" : "+r" (i));

12516

+ if (i == 0)

12517

+ __builtin_exit (0);

12518

+}

12519

+

12520

+__attribute__((noinline, noclone)) G

12521

+test (void *z, G s, E &x, char, long v)

12522

+{

12523

+ const D &d = x.e3;

12524

+ const H *h = foo (d);

12525

+ const char *q = h->h7;

12526

+ const int f = x.e2;

12527

+ const int i = 5 * sizeof (long);

12528

+ char *c = static_cast <char *>(__builtin_alloca (i));

12529

+ const int b = f & 74;

12530

+ const bool e = (b != 64 && b != 8);

12531

+ const unsigned long u = ((v > 0 || !e) ? (unsigned long) v : -(unsigned long) v);

12532

+ int l = bar (c + i, u, q, f, e);

12533

+ c += i - l;

12534

+ if (h->h3)

12535

+ {

12536

+ char *c2 = static_cast <char *>(__builtin_alloca ((l + 1) * 2));

12537

+ baz (z, h->h1, h->h2, h->h6, x, c2 + 2, c, l);

12538

+ c = c2 + 2;

12539

+ }

12540

+ if (__builtin_expect (e, true))

12541

+ {

12542

+ }

12543

+ else if ((f & 4096) && v)

12544

+ {

12545

+ {

12546

+ const bool m = f & 176;

12547

+ *--c = q[m];

12548

+ *--c = q[1];

12549

+ }

12550

+ }

12551

+ const int w = x.e1;

12552

+ if (w > l)

12553

+ {

12554

+ char * c3 = static_cast <char *>(__builtin_alloca (w));

12555

+ c = c3;

12556

+ }

12557

+ return s.g3 (c, l);

12558

+}

12559

+

12560

+int

12561

+main ()

12562

+{

12563

+ H h;

12564

+ const A *j[1];

12565

+ C c;

12566

+ G g;

12567

+ E e;

12568

+ h.h9 (e.e3);

12569

+ j[0] = &h;

12570

+ c.c1 = j;

12571

+ e.e3.d1 = &c;

12572

+ test (0, g, e, 0, 0);

12573

+ __builtin_abort ();

12574

+}

12575

Index: gcc/testsuite/g++.dg/opt/pr58864.C

12576

===================================================================

12577

--- a/src/gcc/testsuite/g++.dg/opt/pr58864.C (.../tags/gcc_4_8_2_release)

12578

+++ b/src/gcc/testsuite/g++.dg/opt/pr58864.C (.../branches/gcc-4_8-branch)

12579

@@ -0,0 +1,21 @@

12580

+// PR target/58864

12581

+// { dg-do compile }

12582

+// { dg-options "-Os" }

12583

+// { dg-additional-options "-march=i686" { target { { i?86-*-* x86_64-*-* } && ia32 } } }

12584

+

12585

+struct A { A (); ~A (); };

12586

+struct B { B (); };

12587

+

12588

+float d, e;

12589

+

12590

+void

12591

+foo ()

12592

+{

12593

+ A a;

12594

+ float c = d;

12595

+ while (1)

12596

+ {

12597

+ B b;

12598

+ e = c ? -c : 0;

12599

+ }

12600

+}

12601

Index: gcc/testsuite/g++.dg/tree-prof/pr59255.C

12602

===================================================================

12603

--- a/src/gcc/testsuite/g++.dg/tree-prof/pr59255.C (.../tags/gcc_4_8_2_release)

12604

+++ b/src/gcc/testsuite/g++.dg/tree-prof/pr59255.C (.../branches/gcc-4_8-branch)

12605

@@ -0,0 +1,29 @@

12606

+// PR c++/59255

12607

+// { dg-options "-O2 -std=c++11" }

12608

+

12609

+struct S

12610

+{

12611

+ __attribute__((noinline, noclone)) ~S () noexcept (true)

12612

+ {

12613

+ if (fn)

12614

+ fn (1);

12615

+ }

12616

+ void (*fn) (int);

12617

+};

12618

+

12619

+__attribute__((noinline, noclone)) void

12620

+foo (int x)

12621

+{

12622

+ if (x != 1)

12623

+ throw 1;

12624

+}

12625

+

12626

+int

12627

+main ()

12628

+{

12629

+ for (int i = 0; i < 100; i++)

12630

+ {

12631

+ S s;

12632

+ s.fn = foo;

12633

+ }

12634

+}

12635

Index: gcc/testsuite/g++.dg/gomp/pr59297.C

12636

===================================================================

12637

--- a/src/gcc/testsuite/g++.dg/gomp/pr59297.C (.../tags/gcc_4_8_2_release)

12638

+++ b/src/gcc/testsuite/g++.dg/gomp/pr59297.C (.../branches/gcc-4_8-branch)

12639

@@ -0,0 +1,25 @@

12640

+// PR c++/59297

12641

+// { dg-do compile }

12642

+// { dg-options "-fopenmp" }

12643

+

12644

+template <typename T>

12645

+struct A

12646

+{

12647

+ ~A ();

12648

+ const T &operator[] (int) const;

12649

+};

12650

+

12651

+struct B

12652

+{

12653

+ int &operator () (A <int>);

12654

+};

12655

+

12656

+void

12657

+foo (B &x, int &z)

12658

+{

12659

+ A<A<int> > y;

12660

+ #pragma omp atomic

12661

+ x (y[0]) += 1;

12662

+ #pragma omp atomic

12663

+ z += x(y[1]);

12664

+}

12665

Index: gcc/testsuite/g++.dg/diagnostic/pr58979.C

12666

===================================================================

12667

--- a/src/gcc/testsuite/g++.dg/diagnostic/pr58979.C (.../tags/gcc_4_8_2_release)

12668

+++ b/src/gcc/testsuite/g++.dg/diagnostic/pr58979.C (.../branches/gcc-4_8-branch)

12669

@@ -0,0 +1,4 @@

12670

+// PR c++/58979

12671

+// { dg-do compile }

12672

+

12673

+int i = 0->*0; // { dg-error "invalid type argument of" }

12674

Index: gcc/testsuite/g++.dg/tm/noexcept-6.C

12675

===================================================================

12676

--- a/src/gcc/testsuite/g++.dg/tm/noexcept-6.C (.../tags/gcc_4_8_2_release)

12677

+++ b/src/gcc/testsuite/g++.dg/tm/noexcept-6.C (.../branches/gcc-4_8-branch)

12678

@@ -0,0 +1,23 @@

12679

+// { dg-do compile }

12680

+// { dg-options "-fno-exceptions -fgnu-tm -O -std=c++0x -fdump-tree-tmlower" }

12681

+

12682

+struct TrueFalse

12683

+{

12684

+ static constexpr bool v() { return true; }

12685

+};

12686

+

12687

+int global;

12688

+

12689

+template<typename T> int foo()

12690

+{

12691

+ return __transaction_atomic noexcept(T::v()) (global + 1);

12692

+}

12693

+

12694

+int f1()

12695

+{

12696

+ return foo<TrueFalse>();

12697

+}

12698

+

12699

+/* { dg-final { scan-tree-dump-times "eh_must_not_throw" 0 "tmlower" } } */

12700

+/* { dg-final { scan-tree-dump-times "__transaction_atomic" 1 "tmlower" } } */

12701

+/* { dg-final { cleanup-tree-dump "tmlower" } } */

12702

Index: gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C

12703

===================================================================

12704

--- a/src/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C (.../tags/gcc_4_8_2_release)

12705

+++ b/src/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C (.../branches/gcc-4_8-branch)

12706

@@ -0,0 +1,7 @@

12707

+// PR c++/58596

12708

+// { dg-do compile { target c++11 } }

12709

+

12710

+struct A

12711

+{

12712

+ int i = [] { return decltype(i)(); }();

12713

+};

12714

Index: gcc/testsuite/g++.dg/cpp0x/variadic144.C

12715

===================================================================

12716

--- a/src/gcc/testsuite/g++.dg/cpp0x/variadic144.C (.../tags/gcc_4_8_2_release)

12717

+++ b/src/gcc/testsuite/g++.dg/cpp0x/variadic144.C (.../branches/gcc-4_8-branch)

12718

@@ -0,0 +1,15 @@

12719

+// PR c++/56060

12720

+// { dg-do compile { target c++11 } }

12721

+

12722

+template<typename T> struct baz { };

12723

+template<typename T> T bar();

12724

+

12725

+template<typename T, typename ... U>

12726

+baz<decltype(bar<T>()(bar<U> ...))> // { dg-error "cannot be used" }

12727

+foo();

12728

+

12729

+int main()

12730

+{

12731

+ foo<int>(); // { dg-error "no matching" }

12732

+ return 0;

12733

+}

12734

Index: gcc/testsuite/g++.dg/cpp0x/enum18.C

12735

===================================================================

12736

--- a/src/gcc/testsuite/g++.dg/cpp0x/enum18.C (.../tags/gcc_4_8_2_release)

12737

+++ b/src/gcc/testsuite/g++.dg/cpp0x/enum18.C (.../branches/gcc-4_8-branch)

12738

@@ -4,5 +4,5 @@

12739

int main(void) {

12740

enum e {};

12741

e ev;

12742

- ev.e::~e_u(); // { dg-error "e_u. has not been declared" }

12743

+ ev.e::~e_u(); // { dg-error "" }

12744

}

12745

Index: gcc/testsuite/g++.dg/cpp0x/access02.C

12746

===================================================================

12747

--- a/src/gcc/testsuite/g++.dg/cpp0x/access02.C (.../tags/gcc_4_8_2_release)

12748

+++ b/src/gcc/testsuite/g++.dg/cpp0x/access02.C (.../branches/gcc-4_8-branch)

12749

@@ -0,0 +1,39 @@

12750

+// PR c++/58954

12751

+// { dg-require-effective-target c++11 }

12752

+

12753

+template<class T>

12754

+T&& declval();

12755

+

12756

+template<class T>

12757

+struct foo_argument

12758

+{

12759

+ template<class Ret, class C, class Arg>

12760

+ static Arg test(Ret (C::*)(Arg));

12761

+

12762

+ typedef decltype(test(&T::template foo<>)) type;

12763

+};

12764

+

12765

+template<class T, class>

12766

+struct dependent { typedef T type; };

12767

+

12768

+template<class T>

12769

+struct base

12770

+{

12771

+ template<class Ignore = void>

12772

+ auto foo(int i) -> decltype(declval<

12773

+ typename dependent<T&, Ignore>::type

12774

+ >().foo_impl(i));

12775

+};

12776

+

12777

+struct derived : base<derived>

12778

+{

12779

+ friend struct base<derived>;

12780

+private:

12781

+ int foo_impl(int i);

12782

+};

12783

+

12784

+int main()

12785

+{

12786

+ foo_argument<derived>::type var = 0;

12787

+ return var;

12788

+}

12789

Index: gcc/testsuite/g++.dg/cpp0x/constexpr-template6.C

12790

===================================================================

12791

--- a/src/gcc/testsuite/g++.dg/cpp0x/constexpr-template6.C (.../tags/gcc_4_8_2_release)

12792

+++ b/src/gcc/testsuite/g++.dg/cpp0x/constexpr-template6.C (.../branches/gcc-4_8-branch)

12793

@@ -0,0 +1,20 @@

12794

+// PR c++/59268

12795

+// { dg-do compile }

12796

+// { dg-options "-std=c++11" }

12797

+

12798

+template <typename>

12799

+struct A

12800

+{

12801

+ constexpr A (int) {}

12802

+ virtual void foo ()

12803

+ {

12804

+ constexpr A<void> a (0);

12805

+ }

12806

+};

12807

+

12808

+void

12809

+bar ()

12810

+{

12811

+ A<int> a (3);

12812

+ a.foo ();

12813

+}

12814

Index: gcc/testsuite/g++.dg/cpp0x/nsdmi9.C

12815

===================================================================

12816

--- a/src/gcc/testsuite/g++.dg/cpp0x/nsdmi9.C (.../tags/gcc_4_8_2_release)

12817

+++ b/src/gcc/testsuite/g++.dg/cpp0x/nsdmi9.C (.../branches/gcc-4_8-branch)

12818

@@ -0,0 +1,13 @@

12819

+// PR c++/58162

12820

+// { dg-require-effective-target c++11 }

12821

+

12822

+struct A {

12823

+ A();

12824

+ A(A&&);

12825

+};

12826

+

12827

+struct B {

12828

+ A const a = A();

12829

+};

12830

+

12831

+B b;

12832

Index: gcc/testsuite/g++.dg/cpp0x/variadic145.C

12833

===================================================================

12834

--- a/src/gcc/testsuite/g++.dg/cpp0x/variadic145.C (.../tags/gcc_4_8_2_release)

12835

+++ b/src/gcc/testsuite/g++.dg/cpp0x/variadic145.C (.../branches/gcc-4_8-branch)

12836

@@ -0,0 +1,13 @@

12837

+// PR c++/59730

12838

+// { dg-do compile { target c++11 } }

12839

+

12840

+template <typename> void declval();

12841

+template <typename> void forward();

12842

+template <typename> class D;

12843

+template <typename _Functor, typename... _Bound_args>

12844

+class D <_Functor(_Bound_args...)> {

12845

+ template <typename... _Args, decltype(declval<_Functor>)>

12846

+ void operator()(...) {

12847

+ 0(forward<_Args>...);

12848

+ }

12849

+};

12850

Index: gcc/testsuite/g++.dg/cpp0x/decltype57.C

12851

===================================================================

12852

--- a/src/gcc/testsuite/g++.dg/cpp0x/decltype57.C (.../tags/gcc_4_8_2_release)

12853

+++ b/src/gcc/testsuite/g++.dg/cpp0x/decltype57.C (.../branches/gcc-4_8-branch)

12854

@@ -0,0 +1,8 @@

12855

+// PR c++/58633

12856

+// { dg-do compile { target c++11 } }

12857

+

12858

+void foo(int i)

12859

+{

12860

+ typedef int I;

12861

+ decltype(i.I::~I())* p;

12862

+}

12863

Index: gcc/testsuite/g++.dg/inherit/virtual11.C

12864

===================================================================

12865

--- a/src/gcc/testsuite/g++.dg/inherit/virtual11.C (.../tags/gcc_4_8_2_release)

12866

+++ b/src/gcc/testsuite/g++.dg/inherit/virtual11.C (.../branches/gcc-4_8-branch)

12867

@@ -0,0 +1,17 @@

12868

+// PR c++/59031

12869

+// { dg-do compile }

12870

+// { dg-options "-fdump-tree-gimple " }

12871

+class B {

12872

+ public:

12873

+ virtual int add (int a, int b) {return a+ b;}

12874

+};

12875

+

12876

+class D : public B {

12877

+};

12878

+

12879

+int foo (int a, int b) {

12880

+ D d;

12881

+ return d.add(a, b);

12882

+}

12883

+// { dg-final { scan-tree-dump-not "OBJ_TYPE_REF" "gimple" } }

12884

+// { dg-final { cleanup-tree-dump "gimple" } }

12885

Index: gcc/testsuite/g++.dg/torture/pr59163.C

12886

===================================================================

12887

--- a/src/gcc/testsuite/g++.dg/torture/pr59163.C (.../tags/gcc_4_8_2_release)

12888

+++ b/src/gcc/testsuite/g++.dg/torture/pr59163.C (.../branches/gcc-4_8-branch)

12889

@@ -0,0 +1,30 @@

12890

+// PR target/59163

12891

+// { dg-do run }

12892

+

12893

+struct A { float a[4]; };

12894

+struct B { int b; A a; };

12895

+

12896

+__attribute__((noinline, noclone)) void

12897

+bar (A &a)

12898

+{

12899

+ if (a.a[0] != 36.0f || a.a[1] != 42.0f || a.a[2] != 48.0f || a.a[3] != 54.0f)

12900

+ __builtin_abort ();

12901

+}

12902

+

12903

+__attribute__((noinline, noclone)) void

12904

+foo (A &a)

12905

+{

12906

+ int i;

12907

+ A c = a;

12908

+ for (i = 0; i < 4; i++)

12909

+ c.a[i] *= 6.0f;

12910

+ a = c;

12911

+ bar (a);

12912

+}

12913

+

12914

+int

12915

+main ()

12916

+{

12917

+ B b = { 5, { 6, 7, 8, 9 } };

12918

+ foo (b.a);

12919

+}

12920

Index: gcc/testsuite/g++.dg/template/partial14.C

12921

===================================================================

12922

--- a/src/gcc/testsuite/g++.dg/template/partial14.C (.../tags/gcc_4_8_2_release)

12923

+++ b/src/gcc/testsuite/g++.dg/template/partial14.C (.../branches/gcc-4_8-branch)

12924

@@ -0,0 +1,16 @@

12925

+// PR c++/59044

12926

+

12927

+template <class T>

12928

+class C {

12929

+private:

12930

+ template <T a, T b>

12931

+ struct Implementation {};

12932

+public:

12933

+ typedef typename Implementation<0, 0>::Typedef Type;

12934

+};

12935

+

12936

+template <class T>

12937

+template <T b>

12938

+struct C<T>::Implementation<0, b> { typedef void Typedef; };

12939

+

12940

+template class C<unsigned>;

12941

Index: gcc/testsuite/c-c++-common/pr59037.c

12942

===================================================================

12943

--- a/src/gcc/testsuite/c-c++-common/pr59037.c (.../tags/gcc_4_8_2_release)

12944

+++ b/src/gcc/testsuite/c-c++-common/pr59037.c (.../branches/gcc-4_8-branch)

12945

@@ -0,0 +1,12 @@

12946

+/* { dg-do compile } */

12947

+/* { dg-options "-O3" } */

12948

+

12949

+typedef int v4si __attribute__ ((vector_size (16)));

12950

+

12951

+int

12952

+main (int argc, char** argv)

12953

+{

12954

+ v4si x = {0,1,2,3};

12955

+ x = (v4si) {(x)[3], (x)[2], (x)[1], (x)[0]};

12956

+ return x[4];

12957

+}

12958

Index: gcc/testsuite/c-c++-common/pr59280.c

12959

===================================================================

12960

--- a/src/gcc/testsuite/c-c++-common/pr59280.c (.../tags/gcc_4_8_2_release)

12961

+++ b/src/gcc/testsuite/c-c++-common/pr59280.c (.../branches/gcc-4_8-branch)

12962

@@ -0,0 +1,4 @@

12963

+/* PR c/59280 */

12964

+/* { dg-do compile } */

12965

+

12966

+void bar (char *) __attribute__((constructor(foo))); /* { dg-error "constructor priorities must be integers|was not declared|constructor priorities are not supported" } */

12967

Index: gcc/testsuite/c-c++-common/fold-divmul-1.c

12968

===================================================================

12969

--- a/src/gcc/testsuite/c-c++-common/fold-divmul-1.c (.../tags/gcc_4_8_2_release)

12970

+++ b/src/gcc/testsuite/c-c++-common/fold-divmul-1.c (.../branches/gcc-4_8-branch)

12971

@@ -0,0 +1,11 @@

12972

+/* { dg-do compile } */

12973

+/* { dg-options "-fdump-tree-original" } */

12974

+

12975

+int *

12976

+fx (int *b, int *e)

12977

+{

12978

+ return b + (e - b);

12979

+}

12980

+

12981

+/* { dg-final { scan-tree-dump-not "/\\\[ex\\\]" "original" } } */

12982

+/* { dg-final { cleanup-tree-dump "original" } } */

12983

Index: gcc/testsuite/c-c++-common/torture/pr58794-1.c

12984

===================================================================

12985

--- a/src/gcc/testsuite/c-c++-common/torture/pr58794-1.c (.../tags/gcc_4_8_2_release)

12986

+++ b/src/gcc/testsuite/c-c++-common/torture/pr58794-1.c (.../branches/gcc-4_8-branch)

12987

@@ -0,0 +1,29 @@

12988

+/* { dg-do compile } */

12989

+

12990

+struct S0

12991

+{

12992

+ int f;

12993

+};

12994

+

12995

+struct S1

12996

+{

12997

+ struct S0 f1;

12998

+ volatile int f2;

12999

+};

13000

+

13001

+struct S2

13002

+{

13003

+ struct S1 g;

13004

+} a, b;

13005

+

13006

+static int *c[1][2] = {{0, (int *)&a.g.f2}};

13007

+static int d;

13008

+

13009

+int

13010

+main ()

13011

+{

13012

+ for (d = 0; d < 1; d++)

13013

+ for (b.g.f1.f = 0; b.g.f1.f < 1; b.g.f1.f++)

13014

+ *c[b.g.f1.f][d + 1] = 0;

13015

+ return 0;

13016

+}

13017

Index: gcc/testsuite/c-c++-common/torture/pr58794-2.c

13018

===================================================================

13019

--- a/src/gcc/testsuite/c-c++-common/torture/pr58794-2.c (.../tags/gcc_4_8_2_release)

13020

+++ b/src/gcc/testsuite/c-c++-common/torture/pr58794-2.c (.../branches/gcc-4_8-branch)

13021

@@ -0,0 +1,21 @@

13022

+/* { dg-do compile } */

13023

+

13024

+struct S

13025

+{

13026

+ volatile int f;

13027

+} a;

13028

+

13029

+unsigned int b;

13030

+

13031

+static int *c[1][2] = {{0, (int *)&a.f}};

13032

+static unsigned int d;

13033

+

13034

+int

13035

+main ()

13036

+{

13037

+ for (; d < 1; d++)

13038

+ for (; b < 1; b++)

13039

+ *c[b][d + 1] = 0;

13040

+

13041

+ return 0;

13042

+}

13043

Index: gcc/testsuite/c-c++-common/gomp/pr59467.c

13044

===================================================================

13045

--- a/src/gcc/testsuite/c-c++-common/gomp/pr59467.c (.../tags/gcc_4_8_2_release)

13046

+++ b/src/gcc/testsuite/c-c++-common/gomp/pr59467.c (.../branches/gcc-4_8-branch)

13047

@@ -0,0 +1,68 @@

13048

+/* PR libgomp/59467 */

13049

+

13050

+int v;

13051

+

13052

+void

13053

+foo (void)

13054

+{

13055

+ int x = 0, y = 0;

13056

+ #pragma omp parallel

13057

+ {

13058

+ int z;

13059

+ #pragma omp single copyprivate (x) /* { dg-error "is not threadprivate or private in outer context" } */

13060

+ {

13061

+ #pragma omp atomic write

13062

+ x = 6;

13063

+ }

13064

+ #pragma omp atomic read

13065

+ z = x;

13066

+ #pragma omp atomic

13067

+ y += z;

13068

+ }

13069

+ #pragma omp parallel

13070

+ {

13071

+ int z;

13072

+ #pragma omp single copyprivate (v) /* { dg-error "is not threadprivate or private in outer context" } */

13073

+ {

13074

+ #pragma omp atomic write

13075

+ v = 6;

13076

+ }

13077

+ #pragma omp atomic read

13078

+ z = v;

13079

+ #pragma omp atomic

13080

+ y += z;

13081

+ }

13082

+ #pragma omp parallel private (x)

13083

+ {

13084

+ int z;

13085

+ #pragma omp single copyprivate (x)

13086

+ {

13087

+ #pragma omp atomic write

13088

+ x = 6;

13089

+ }

13090

+ #pragma omp atomic read

13091

+ z = x;

13092

+ #pragma omp atomic

13093

+ y += z;

13094

+ }

13095

+ x = 0;

13096

+ #pragma omp parallel reduction (+:x)

13097

+ {

13098

+ #pragma omp single copyprivate (x)

13099

+ {

13100

+ #pragma omp atomic write

13101

+ x = 6;

13102

+ }

13103

+ #pragma omp atomic

13104

+ y += x;

13105

+ }

13106

+ #pragma omp single copyprivate (x)

13107

+ {

13108

+ x = 7;

13109

+ }

13110

+ #pragma omp single copyprivate (v) /* { dg-error "is not threadprivate or private in outer context" } */

13111

+ {

13112

+ #pragma omp atomic write

13113

+ v = 6;

13114

+ }

13115

+}

13116

Index: gcc/testsuite/c-c++-common/pr59032.c

13117

===================================================================

13118

--- a/src/gcc/testsuite/c-c++-common/pr59032.c (.../tags/gcc_4_8_2_release)

13119

+++ b/src/gcc/testsuite/c-c++-common/pr59032.c (.../branches/gcc-4_8-branch)

13120

@@ -0,0 +1,30 @@

13121

+/* { dg-do compile } */

13122

+/* { dg-options "-O2" } */

13123

+

13124

+void

13125

+foo()

13126

+{

13127

+ float v __attribute__((vector_size(8)));

13128

+ v++;

13129

+}

13130

+

13131

+void

13132

+foo2 ()

13133

+{

13134

+ float v __attribute__((vector_size(8)));

13135

+ ++v;

13136

+}

13137

+

13138

+void

13139

+foo3 ()

13140

+{

13141

+ float v __attribute__((vector_size(8)));

13142

+ v--;

13143

+}

13144

+

13145

+void

13146

+foo4 ()

13147

+{

13148

+ float v __attribute__((vector_size(8)));

13149

+ --v;

13150

+}

13151

Index: gcc/cp/typeck.c

13152

===================================================================

13153

--- a/src/gcc/cp/typeck.c (.../tags/gcc_4_8_2_release)

13154

+++ b/src/gcc/cp/typeck.c (.../branches/gcc-4_8-branch)

13155

@@ -5588,7 +5588,9 @@

13156

inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));

13157

}

13158

else

13159

- inc = integer_one_node;

13160

+ inc = (TREE_CODE (argtype) == VECTOR_TYPE

13161

+ ? build_one_cst (argtype)

13162

+ : integer_one_node);

13163

13164

inc = cp_convert (argtype, inc, complain);

13165

13166

@@ -7611,7 +7613,7 @@

13167

/* Handle null pointer to member function conversions. */

13168

if (null_ptr_cst_p (pfn))

13169

{

13170

- pfn = build_c_cast (input_location, type, pfn);

13171

+ pfn = cp_build_c_cast (type, pfn, complain);

13172

return build_ptrmemfunc1 (to_type,

13173

integer_zero_node,

13174

pfn);

13175

Index: gcc/cp/except.c

13176

===================================================================

13177

--- a/src/gcc/cp/except.c (.../tags/gcc_4_8_2_release)

13178

+++ b/src/gcc/cp/except.c (.../branches/gcc-4_8-branch)

13179

@@ -380,6 +380,9 @@

13180

{

13181

tree type = body ? TREE_TYPE (body) : void_type_node;

13182

13183

+ if (!flag_exceptions)

13184

+ return body;

13185

+

13186

if (cond && !value_dependent_expression_p (cond))

13187

{

13188

cond = cxx_constant_value (cond);

13189

Index: gcc/cp/ChangeLog

13190

===================================================================

13191

--- a/src/gcc/cp/ChangeLog (.../tags/gcc_4_8_2_release)

13192

+++ b/src/gcc/cp/ChangeLog (.../branches/gcc-4_8-branch)

13193

@@ -1,3 +1,89 @@

13194

+2014-01-10 Paolo Carlini <paolo.carlini@oracle.com>

13195

+

13196

+ PR c++/56060

13197

+ PR c++/59730

13198

+ * pt.c (type_dependent_expression_p): Handle EXPR_PACK_EXPANSION.

13199

+

13200

+2013-12-12 Jason Merrill <jason@redhat.com>

13201

+

13202

+ PR c++/58954

13203

+ * pt.c (resolve_overloaded_unification): Discard access checks.

13204

+

13205

+2013-12-05 Jason Merrill <jason@redhat.com>

13206

+

13207

+ PR c++/59044

13208

+ PR c++/59052

13209

+ * pt.c (most_specialized_class): Use the partially instantiated

13210

+ template for deduction. Drop the TMPL parameter.

13211

+

13212

+2013-12-04 Jakub Jelinek <jakub@redhat.com>

13213

+

13214

+ PR c++/59268

13215

+ * pt.c (tsubst_copy_and_build): Handle POINTER_PLUS_EXPR.

13216

+

13217

+2013-11-27 Tom de Vries <tom@codesourcery.com>

13218

+ Marc Glisse <marc.glisse@inria.fr>

13219

+

13220

+ PR c++/59032

13221

+ * typeck.c (cp_build_unary_op): Allow vector increment and decrement.

13222

+

13223

+2013-11-27 Tom de Vries <tom@codesourcery.com>

13224

+ Marc Glisse <marc.glisse@inria.fr>

13225

+

13226

+ PR middle-end/59037

13227

+ * semantics.c (cxx_fold_indirect_ref): Don't create out-of-bounds

13228

+ BIT_FIELD_REF.

13229

+

13230

+2013-11-28 Jakub Jelinek <jakub@redhat.com>

13231

+

13232

+ PR c++/59297

13233

+ * semantics.c (finish_omp_atomic): Call finish_expr_stmt

13234

+ rather than add_stmt.

13235

+

13236

+2013-11-23 Easwaran Raman <eraman@google.com>

13237

+

13238

+ PR c++/59031

13239

+ * call.c (build_new_method_call_1): Comnpare function context

13240

+ with BASELINK_BINFO type rather than instance type before

13241

+ marking the call with LOOKUP_NONVIRTUAL.

13242

+

13243

+2013-10-31 Jason Merrill <jason@redhat.com>

13244

+

13245

+ PR c++/58162

13246

+ * parser.c (cp_parser_late_parse_one_default_arg): Set

13247

+ TARGET_EXPR_DIRECT_INIT_P.

13248

+

13249

+2013-11-11 Paolo Carlini <paolo.carlini@oracle.com>

13250

+

13251

+ * cvt.c (cp_convert_to_pointer): Call build_ptrmemfunc before

13252

+ maybe_warn_zero_as_null_pointer_constant to avoid duplicate

13253

+ -Wzero-as-null-pointer-constant diagnostics.

13254

+

13255

+ * typeck.c (build_ptrmemfunc): Use cp_build_c_cast.

13256

+

13257

+2013-10-25 Tom de Vries <tom@codesourcery.com>

13258

+

13259

+ PR c++/58282

13260

+ * except.c (build_must_not_throw_expr): Handle

13261

+ flag_exceptions.

13262

+

13263

+2013-10-17 Paolo Carlini <paolo.carlini@oracle.com>

13264

+

13265

+ PR c++/58596

13266

+ * semantics.c (lambda_expr_this_capture): Handle NSDMIs in the

13267

+ cp_unevaluated_operand case.

13268

+

13269

+2013-10-16 Paolo Carlini <paolo.carlini@oracle.com>

13270

+

13271

+ PR c++/58633

13272

+ * parser.c (cp_parser_pseudo_destructor_name): Revert r174385 changes.

13273

+

13274

+2013-10-16 Jason Merrill <jason@redhat.com>

13275

+

13276

+ PR c++/57850

13277

+ * decl2.c (dump_tu): Split out from...

13278

+ (cp_write_global_declarations): ...here. Call it in PCH mode.

13279

+

13280

2013-10-16 Release Manager

13281

13282

* GCC 4.8.2 released.

13283

Index: gcc/cp/pt.c

13284

===================================================================

13285

--- a/src/gcc/cp/pt.c (.../tags/gcc_4_8_2_release)

13286

+++ b/src/gcc/cp/pt.c (.../branches/gcc-4_8-branch)

13287

@@ -170,7 +170,7 @@

13288

static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);

13289

static tree tsubst_template_parms (tree, tree, tsubst_flags_t);

13290

static void regenerate_decl_from_template (tree, tree);

13291

-static tree most_specialized_class (tree, tree, tsubst_flags_t);

13292

+static tree most_specialized_class (tree, tsubst_flags_t);

13293

static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);

13294

static tree tsubst_arg_types (tree, tree, tree, tsubst_flags_t, tree);

13295

static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);

13296

@@ -4261,7 +4261,7 @@

13297

if (COMPLETE_TYPE_P (inst_type)

13298

&& CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type))

13299

{

13300

- tree spec = most_specialized_class (inst_type, maintmpl, tf_none);

13301

+ tree spec = most_specialized_class (inst_type, tf_none);

13302

if (spec && TREE_TYPE (spec) == type)

13303

permerror (input_location,

13304

"partial specialization of %qT after instantiation "

13305

@@ -8572,7 +8572,7 @@

13306

13307

/* Determine what specialization of the original template to

13308

instantiate. */

13309

- t = most_specialized_class (type, templ, tf_warning_or_error);

13310

+ t = most_specialized_class (type, tf_warning_or_error);

13311

if (t == error_mark_node)

13312

{

13313

TYPE_BEING_DEFINED (type) = 1;

13314

@@ -13710,6 +13710,10 @@

13315

RETURN (r);

13316

}

13317

13318

+ case POINTER_PLUS_EXPR:

13319

+ return fold_build_pointer_plus (RECUR (TREE_OPERAND (t, 0)),

13320

+ RECUR (TREE_OPERAND (t, 1)));

13321

+

13322

case SCOPE_REF:

13323

RETURN (tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,

13324

/*address_p=*/false));

13325

@@ -15749,7 +15753,7 @@

13326

if (subargs != error_mark_node

13327

&& !any_dependent_template_arguments_p (subargs))

13328

{

13329

- elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);

13330

+ elem = TREE_TYPE (instantiate_template (fn, subargs, tf_none));

13331

if (try_one_overload (tparms, targs, tempargs, parm,

13332

elem, strict, sub_strict, addr_p, explain_p)

13333

&& (!goodfn || !same_type_p (goodfn, elem)))

13334

@@ -17553,7 +17557,7 @@

13335

return -1;

13336

}

13337

13338

-/* Determine which of two partial specializations of MAIN_TMPL is more

13339

+/* Determine which of two partial specializations of TMPL is more

13340

specialized.

13341

13342

PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding

13343

@@ -17569,7 +17573,7 @@

13344

two templates is more specialized. */

13345

13346

static int

13347

-more_specialized_class (tree main_tmpl, tree pat1, tree pat2)

13348

+more_specialized_class (tree tmpl, tree pat1, tree pat2)

13349

{

13350

tree targs;

13351

tree tmpl1, tmpl2;

13352

@@ -17584,7 +17588,7 @@

13353

types in the arguments, and we need our dependency check functions

13354

to behave correctly. */

13355

++processing_template_decl;

13356

- targs = get_class_bindings (main_tmpl, TREE_VALUE (pat1),

13357

+ targs = get_class_bindings (tmpl, TREE_VALUE (pat1),

13358

CLASSTYPE_TI_ARGS (tmpl1),

13359

CLASSTYPE_TI_ARGS (tmpl2));

13360

if (targs)

13361

@@ -17593,7 +17597,7 @@

13362

any_deductions = true;

13363

}

13364

13365

- targs = get_class_bindings (main_tmpl, TREE_VALUE (pat2),

13366

+ targs = get_class_bindings (tmpl, TREE_VALUE (pat2),

13367

CLASSTYPE_TI_ARGS (tmpl2),

13368

CLASSTYPE_TI_ARGS (tmpl1));

13369

if (targs)

13370

@@ -17673,7 +17677,7 @@

13371

}

13372

13373

/* Return the innermost template arguments that, when applied to a partial

13374

- specialization of MAIN_TMPL whose innermost template parameters are

13375

+ specialization of TMPL whose innermost template parameters are

13376

TPARMS, and whose specialization arguments are SPEC_ARGS, yield the

13377

ARGS.

13378

13379

@@ -17688,7 +17692,7 @@

13380

is bound to `double'. */

13381

13382

static tree

13383

-get_class_bindings (tree main_tmpl, tree tparms, tree spec_args, tree args)

13384

+get_class_bindings (tree tmpl, tree tparms, tree spec_args, tree args)

13385

{

13386

int i, ntparms = TREE_VEC_LENGTH (tparms);

13387

tree deduced_args;

13388

@@ -17728,8 +17732,8 @@

13389

`T' is `A' but unify () does not check whether `typename T::X'

13390

is `int'. */

13391

spec_args = tsubst (spec_args, deduced_args, tf_none, NULL_TREE);

13392

- spec_args = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (main_tmpl),

13393

- spec_args, main_tmpl,

13394

+ spec_args = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),

13395

+ spec_args, tmpl,

13396

tf_none, false, false);

13397

if (spec_args == error_mark_node

13398

/* We only need to check the innermost arguments; the other

13399

@@ -17877,30 +17881,30 @@

13400

}

13401

13402

/* Return the most specialized of the class template partial

13403

- specializations of TMPL which can produce TYPE, a specialization of

13404

- TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is

13405

+ specializations which can produce TYPE, a specialization of some class

13406

+ template. The value returned is actually a TREE_LIST; the TREE_TYPE is

13407

a _TYPE node corresponding to the partial specialization, while the

13408

TREE_PURPOSE is the set of template arguments that must be

13409

substituted into the TREE_TYPE in order to generate TYPE.

13410

13411

If the choice of partial specialization is ambiguous, a diagnostic

13412

is issued, and the error_mark_node is returned. If there are no

13413

- partial specializations of TMPL matching TYPE, then NULL_TREE is

13414

- returned. */

13415

+ partial specializations matching TYPE, then NULL_TREE is

13416

+ returned, indicating that the primary template should be used. */

13417

13418

static tree

13419

-most_specialized_class (tree type, tree tmpl, tsubst_flags_t complain)

13420

+most_specialized_class (tree type, tsubst_flags_t complain)

13421

{

13422

tree list = NULL_TREE;

13423

tree t;

13424

tree champ;

13425

int fate;

13426

bool ambiguous_p;

13427

- tree args;

13428

tree outer_args = NULL_TREE;

13429

13430

- tmpl = most_general_template (tmpl);

13431

- args = CLASSTYPE_TI_ARGS (type);

13432

+ tree tmpl = CLASSTYPE_TI_TEMPLATE (type);

13433

+ tree main_tmpl = most_general_template (tmpl);

13434

+ tree args = CLASSTYPE_TI_ARGS (type);

13435

13436

/* For determining which partial specialization to use, only the

13437

innermost args are interesting. */

13438

@@ -17910,7 +17914,7 @@

13439

args = INNERMOST_TEMPLATE_ARGS (args);

13440

}

13441

13442

- for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))

13443

+ for (t = DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl); t; t = TREE_CHAIN (t))

13444

{

13445

tree partial_spec_args;

13446

tree spec_args;

13447

@@ -17944,8 +17948,7 @@

13448

13449

partial_spec_args =

13450

coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),

13451

- add_to_template_args (outer_args,

13452

- partial_spec_args),

13453

+ partial_spec_args,

13454

tmpl, tf_none,

13455

/*require_all_args=*/true,

13456

/*use_default_args=*/true);

13457

@@ -19955,6 +19958,10 @@

13458

if (TREE_CODE (expression) == SCOPE_REF)

13459

return false;

13460

13461

+ /* Always dependent, on the number of arguments if nothing else. */

13462

+ if (TREE_CODE (expression) == EXPR_PACK_EXPANSION)

13463

+ return true;

13464

+

13465

if (BASELINK_P (expression))

13466

expression = BASELINK_FUNCTIONS (expression);

13467

13468

Index: gcc/cp/semantics.c

13469

===================================================================

13470

--- a/src/gcc/cp/semantics.c (.../tags/gcc_4_8_2_release)

13471

+++ b/src/gcc/cp/semantics.c (.../branches/gcc-4_8-branch)

13472

@@ -5059,7 +5059,7 @@

13473

}

13474

stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);

13475

}

13476

- add_stmt (stmt);

13477

+ finish_expr_stmt (stmt);

13478

}

13479

13480

void

13481

@@ -7543,7 +7543,7 @@

13482

unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;

13483

tree index = bitsize_int (indexi);

13484

13485

- if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))

13486

+ if (offset / part_widthi < TYPE_VECTOR_SUBPARTS (op00type))

13487

return fold_build3_loc (loc,

13488

BIT_FIELD_REF, type, op00,

13489

part_width, index);

13490

@@ -9481,7 +9481,14 @@

13491

/* In unevaluated context this isn't an odr-use, so just return the

13492

nearest 'this'. */

13493

if (cp_unevaluated_operand)

13494

- return lookup_name (this_identifier);

13495

+ {

13496

+ /* In an NSDMI the fake 'this' pointer that we're using for

13497

+ parsing is in scope_chain. */

13498

+ if (LAMBDA_EXPR_EXTRA_SCOPE (lambda)

13499

+ && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (lambda)) == FIELD_DECL)

13500

+ return scope_chain->x_current_class_ptr;

13501

+ return lookup_name (this_identifier);

13502

+ }

13503

13504

/* Try to default capture 'this' if we can. */

13505

if (!this_capture

13506

Index: gcc/cp/decl2.c

13507

===================================================================

13508

--- a/src/gcc/cp/decl2.c (.../tags/gcc_4_8_2_release)

13509

+++ b/src/gcc/cp/decl2.c (.../branches/gcc-4_8-branch)

13510

@@ -3960,6 +3960,22 @@

13511

expand_or_defer_fn (finish_function (0));

13512

}

13513

13514

+/* The entire file is now complete. If requested, dump everything

13515

+ to a file. */

13516

+

13517

+static void

13518

+dump_tu (void)

13519

+{

13520

+ int flags;

13521

+ FILE *stream = dump_begin (TDI_tu, &flags);

13522

+

13523

+ if (stream)

13524

+ {

13525

+ dump_node (global_namespace, flags & ~TDF_SLIM, stream);

13526

+ dump_end (TDI_tu, stream);

13527

+ }

13528

+}

13529

+

13530

/* This routine is called at the end of compilation.

13531

Its job is to create all the code needed to initialize and

13532

destroy the global aggregates. We do the destruction

13533

@@ -3990,6 +4006,7 @@

13534

if (pch_file)

13535

{

13536

c_common_write_pch ();

13537

+ dump_tu ();

13538

return;

13539

}

13540

13541

@@ -4359,17 +4376,8 @@

13542

13543

/* The entire file is now complete. If requested, dump everything

13544

to a file. */

13545

- {

13546

- int flags;

13547

- FILE *stream = dump_begin (TDI_tu, &flags);

13548

+ dump_tu ();

13549

13550

- if (stream)

13551

- {

13552

- dump_node (global_namespace, flags & ~TDF_SLIM, stream);

13553

- dump_end (TDI_tu, stream);

13554

- }

13555

- }

13556

-

13557

if (flag_detailed_statistics)

13558

{

13559

dump_tree_statistics ();

13560

Index: gcc/cp/parser.c

13561

===================================================================

13562

--- a/src/gcc/cp/parser.c (.../tags/gcc_4_8_2_release)

13563

+++ b/src/gcc/cp/parser.c (.../branches/gcc-4_8-branch)

13564

@@ -6421,10 +6421,6 @@

13565

/* Look for the `~'. */

13566

cp_parser_require (parser, CPP_COMPL, RT_COMPL);

13567

13568

- /* Once we see the ~, this has to be a pseudo-destructor. */

13569

- if (!processing_template_decl && !cp_parser_error_occurred (parser))

13570

- cp_parser_commit_to_tentative_parse (parser);

13571

-

13572

/* Look for the type-name again. We are not responsible for

13573

checking that it matches the first type-name. */

13574

*type = cp_parser_nonclass_name (parser);

13575

@@ -22576,6 +22572,9 @@

13576

&& CONSTRUCTOR_IS_DIRECT_INIT (parsed_arg))

13577

flags = LOOKUP_NORMAL;

13578

parsed_arg = digest_init_flags (TREE_TYPE (decl), parsed_arg, flags);

13579

+ if (TREE_CODE (parsed_arg) == TARGET_EXPR)

13580

+ /* This represents the whole initialization. */

13581

+ TARGET_EXPR_DIRECT_INIT_P (parsed_arg) = true;

13582

}

13583

}

13584

13585

Index: gcc/cp/call.c

13586

===================================================================

13587

--- a/src/gcc/cp/call.c (.../tags/gcc_4_8_2_release)

13588

+++ b/src/gcc/cp/call.c (.../branches/gcc-4_8-branch)

13589

@@ -7414,7 +7414,7 @@

13590

struct z_candidate *candidates = 0, *cand;

13591

tree explicit_targs = NULL_TREE;

13592

tree basetype = NULL_TREE;

13593

- tree access_binfo;

13594

+ tree access_binfo, binfo;

13595

tree optype;

13596

tree first_mem_arg = NULL_TREE;

13597

tree instance_ptr;

13598

@@ -7454,6 +7454,7 @@

13599

if (!conversion_path)

13600

conversion_path = BASELINK_BINFO (fns);

13601

access_binfo = BASELINK_ACCESS_BINFO (fns);

13602

+ binfo = BASELINK_BINFO (fns);

13603

optype = BASELINK_OPTYPE (fns);

13604

fns = BASELINK_FUNCTIONS (fns);

13605

if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)

13606

@@ -7697,13 +7698,13 @@

13607

{

13608

/* Optimize away vtable lookup if we know that this

13609

function can't be overridden. We need to check if

13610

- the context and the instance type are the same,

13611

+ the context and the type where we found fn are the same,

13612

actually FN might be defined in a different class

13613

type because of a using-declaration. In this case, we

13614

do not want to perform a non-virtual call. */

13615

if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)

13616

&& same_type_ignoring_top_level_qualifiers_p

13617

- (DECL_CONTEXT (fn), TREE_TYPE (instance))

13618

+ (DECL_CONTEXT (fn), BINFO_TYPE (binfo))

13619

&& resolves_to_fixed_type_p (instance, 0))

13620

flags |= LOOKUP_NONVIRTUAL;

13621

if (explicit_targs)

13622

Index: gcc/cp/cvt.c

13623

===================================================================

13624

--- a/src/gcc/cp/cvt.c (.../tags/gcc_4_8_2_release)

13625

+++ b/src/gcc/cp/cvt.c (.../branches/gcc-4_8-branch)

13626

@@ -203,13 +203,13 @@

13627

13628

if (null_ptr_cst_p (expr))

13629

{

13630

- if (complain & tf_warning)

13631

- maybe_warn_zero_as_null_pointer_constant (expr, loc);

13632

-

13633

if (TYPE_PTRMEMFUNC_P (type))

13634

return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, 0,

13635

/*c_cast_p=*/false, complain);

13636

13637

+ if (complain & tf_warning)

13638

+ maybe_warn_zero_as_null_pointer_constant (expr, loc);

13639

+

13640

/* A NULL pointer-to-data-member is represented by -1, not by

13641

zero. */

13642

tree val = (TYPE_PTRDATAMEM_P (type)

13643

Index: gcc/cp/cp-tree.h

13644

===================================================================

13645

--- a/src/gcc/cp/cp-tree.h (.../tags/gcc_4_8_2_release)

13646

+++ b/src/gcc/cp/cp-tree.h (.../branches/gcc-4_8-branch)

13647

@@ -344,7 +344,8 @@

13648

/* Returns true iff NODE is a BASELINK. */

13649

#define BASELINK_P(NODE) \

13650

(TREE_CODE (NODE) == BASELINK)

13651

-/* The BINFO indicating the base from which the BASELINK_FUNCTIONS came. */

13652

+/* The BINFO indicating the base in which lookup found the

13653

+ BASELINK_FUNCTIONS. */

13654

#define BASELINK_BINFO(NODE) \

13655

(((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)

13656

/* The functions referred to by the BASELINK; either a FUNCTION_DECL,

13657

Index: gcc/mode-switching.c

13658

===================================================================

13659

--- a/src/gcc/mode-switching.c (.../tags/gcc_4_8_2_release)

13660

+++ b/src/gcc/mode-switching.c (.../branches/gcc-4_8-branch)

13661

@@ -568,12 +568,15 @@

13662

13663

info[bb->index].computing = last_mode;

13664

/* Check for blocks without ANY mode requirements.

13665

- N.B. because of MODE_AFTER, last_mode might still be different

13666

- from no_mode. */

13667

+ N.B. because of MODE_AFTER, last_mode might still

13668

+ be different from no_mode, in which case we need to

13669

+ mark the block as nontransparent. */

13670

if (!any_set_required)

13671

{

13672

ptr = new_seginfo (no_mode, BB_END (bb), bb->index, live_now);

13673

add_seginfo (info + bb->index, ptr);

13674

+ if (last_mode != no_mode)

13675

+ bitmap_clear_bit (transp[bb->index], j);

13676

}

13677

}

13678

#if defined (MODE_ENTRY) && defined (MODE_EXIT)

13679

Index: gcc/ipa-pure-const.c

13680

===================================================================

13681

--- a/src/gcc/ipa-pure-const.c (.../tags/gcc_4_8_2_release)

13682

+++ b/src/gcc/ipa-pure-const.c (.../branches/gcc-4_8-branch)

13683

@@ -588,7 +588,7 @@

13684

/* Wrapper around check_decl for loads in local more. */

13685

13686

static bool

13687

-check_load (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13688

+check_load (gimple, tree op, tree, void *data)

13689

{

13690

if (DECL_P (op))

13691

check_decl ((funct_state)data, op, false, false);

13692

@@ -600,7 +600,7 @@

13693

/* Wrapper around check_decl for stores in local more. */

13694

13695

static bool

13696

-check_store (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13697

+check_store (gimple, tree op, tree, void *data)

13698

{

13699

if (DECL_P (op))

13700

check_decl ((funct_state)data, op, true, false);

13701

@@ -612,7 +612,7 @@

13702

/* Wrapper around check_decl for loads in ipa mode. */

13703

13704

static bool

13705

-check_ipa_load (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13706

+check_ipa_load (gimple, tree op, tree, void *data)

13707

{

13708

if (DECL_P (op))

13709

check_decl ((funct_state)data, op, false, true);

13710

@@ -624,7 +624,7 @@

13711

/* Wrapper around check_decl for stores in ipa mode. */

13712

13713

static bool

13714

-check_ipa_store (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13715

+check_ipa_store (gimple, tree op, tree, void *data)

13716

{

13717

if (DECL_P (op))

13718

check_decl ((funct_state)data, op, true, true);

13719

Index: gcc/cse.c

13720

===================================================================

13721

--- a/src/gcc/cse.c (.../tags/gcc_4_8_2_release)

13722

+++ b/src/gcc/cse.c (.../branches/gcc-4_8-branch)

13723

@@ -6082,6 +6082,18 @@

13724

return x;

13725

}

13726

13727

+ case UNSIGNED_FLOAT:

13728

+ {

13729

+ rtx new_rtx = cse_process_notes (XEXP (x, 0), object, changed);

13730

+ /* We don't substitute negative VOIDmode constants into these rtx,

13731

+ since they would impede folding. */

13732

+ if (GET_MODE (new_rtx) != VOIDmode

13733

+ || (CONST_INT_P (new_rtx) && INTVAL (new_rtx) >= 0)

13734

+ || (CONST_DOUBLE_P (new_rtx) && CONST_DOUBLE_HIGH (new_rtx) >= 0))

13735

+ validate_change (object, &XEXP (x, 0), new_rtx, 0);

13736

+ return x;

13737

+ }

13738

+

13739

case REG:

13740

i = REG_QTY (REGNO (x));

13741

13742

Index: gcc/tree-ssa-sink.c

13743

===================================================================

13744

--- a/src/gcc/tree-ssa-sink.c (.../tags/gcc_4_8_2_release)

13745

+++ b/src/gcc/tree-ssa-sink.c (.../branches/gcc-4_8-branch)

13746

@@ -559,7 +559,7 @@

13747

execute_sink_code (void)

13748

{

13749

loop_optimizer_init (LOOPS_NORMAL);

13750

-

13751

+ split_critical_edges ();

13752

connect_infinite_loops_to_exit ();

13753

memset (&sink_stats, 0, sizeof (sink_stats));

13754

calculate_dominance_info (CDI_DOMINATORS);

13755

Index: gcc/config.in

13756

===================================================================

13757

--- a/src/gcc/config.in (.../tags/gcc_4_8_2_release)

13758

+++ b/src/gcc/config.in (.../branches/gcc-4_8-branch)

13759

@@ -375,6 +375,12 @@

13760

#endif

13761

13762

13763

+/* Define if your assembler supports LEON instructions. */

13764

+#ifndef USED_FOR_TARGET

13765

+#undef HAVE_AS_LEON

13766

+#endif

13767

+

13768

+

13769

/* Define if the assembler won't complain about a line such as # 0 "" 2. */

13770

#ifndef USED_FOR_TARGET

13771

#undef HAVE_AS_LINE_ZERO

13772

Index: gcc/ifcvt.c

13773

===================================================================

13774

--- a/src/gcc/ifcvt.c (.../tags/gcc_4_8_2_release)

13775

+++ b/src/gcc/ifcvt.c (.../branches/gcc-4_8-branch)

13776

@@ -115,7 +115,11 @@

13777

13778

while (1)

13779

{

13780

- if (CALL_P (insn) || NONJUMP_INSN_P (insn))

13781

+ if ((CALL_P (insn) || NONJUMP_INSN_P (insn))

13782

+ /* Don't count USE/CLOBBER insns, flow_find_cross_jump etc.

13783

+ don't count them either and we need consistency. */

13784

+ && GET_CODE (PATTERN (insn)) != USE

13785

+ && GET_CODE (PATTERN (insn)) != CLOBBER)

13786

count++;

13787

13788

if (insn == BB_END (bb))

13789

@@ -505,7 +509,10 @@

13790

n_insns -= 2 * n_matching;

13791

}

13792

13793

- if (then_start && else_start)

13794

+ if (then_start

13795

+ && else_start

13796

+ && then_n_insns > n_matching

13797

+ && else_n_insns > n_matching)

13798

{

13799

int longest_match = MIN (then_n_insns - n_matching,

13800

else_n_insns - n_matching);

13801

Index: gcc/expr.c

13802

===================================================================

13803

--- a/src/gcc/expr.c (.../tags/gcc_4_8_2_release)

13804

+++ b/src/gcc/expr.c (.../branches/gcc-4_8-branch)

13805

@@ -1994,12 +1994,14 @@

13806

HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));

13807

enum machine_mode mode = GET_MODE (tmps[i]);

13808

unsigned int bytelen = GET_MODE_SIZE (mode);

13809

- unsigned int adj_bytelen = bytelen;

13810

+ unsigned int adj_bytelen;

13811

rtx dest = dst;

13812

13813

/* Handle trailing fragments that run over the size of the struct. */

13814

if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)

13815

adj_bytelen = ssize - bytepos;

13816

+ else

13817

+ adj_bytelen = bytelen;

13818

13819

if (GET_CODE (dst) == CONCAT)

13820

{

13821

@@ -2040,6 +2042,7 @@

13822

}

13823

}

13824

13825

+ /* Handle trailing fragments that run over the size of the struct. */

13826

if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)

13827

{

13828

/* store_bit_field always takes its value from the lsb.

13829

@@ -2057,16 +2060,22 @@

13830

tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],

13831

shift, tmps[i], 0);

13832

}

13833

- bytelen = adj_bytelen;

13834

+

13835

+ /* Make sure not to write past the end of the struct. */

13836

+ store_bit_field (dest,

13837

+ adj_bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,

13838

+ bytepos * BITS_PER_UNIT, ssize * BITS_PER_UNIT - 1,

13839

+ VOIDmode, tmps[i]);

13840

}

13841

13842

/* Optimize the access just a bit. */

13843

- if (MEM_P (dest)

13844

- && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))

13845

- || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))

13846

- && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0

13847

- && bytelen == GET_MODE_SIZE (mode))

13848

+ else if (MEM_P (dest)

13849

+ && (!SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))

13850

+ || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))

13851

+ && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0

13852

+ && bytelen == GET_MODE_SIZE (mode))

13853

emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);

13854

+

13855

else

13856

store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,

13857

0, 0, mode, tmps[i]);

13858

@@ -4551,19 +4560,19 @@

13859

- tree_low_cst (DECL_FIELD_BIT_OFFSET (repr), 1));

13860

13861

/* If the adjustment is larger than bitpos, we would have a negative bit

13862

- position for the lower bound and this may wreak havoc later. This can

13863

- occur only if we have a non-null offset, so adjust offset and bitpos

13864

- to make the lower bound non-negative. */

13865

+ position for the lower bound and this may wreak havoc later. Adjust

13866

+ offset and bitpos to make the lower bound non-negative in that case. */

13867

if (bitoffset > *bitpos)

13868

{

13869

HOST_WIDE_INT adjust = bitoffset - *bitpos;

13870

-

13871

gcc_assert ((adjust % BITS_PER_UNIT) == 0);

13872

- gcc_assert (*offset != NULL_TREE);

13873

13874

*bitpos += adjust;

13875

- *offset

13876

- = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));

13877

+ if (*offset == NULL_TREE)

13878

+ *offset = size_int (-adjust / BITS_PER_UNIT);

13879

+ else

13880

+ *offset

13881

+ = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));

13882

*bitstart = 0;

13883

}

13884

else

13885

@@ -4668,8 +4677,7 @@

13886

expand_insn (icode, 2, ops);

13887

}

13888

else

13889

- store_bit_field (mem, GET_MODE_BITSIZE (mode),

13890

- 0, 0, 0, mode, reg);

13891

+ store_bit_field (mem, GET_MODE_BITSIZE (mode), 0, 0, 0, mode, reg);

13892

return;

13893

}

13894

13895

@@ -4698,6 +4706,15 @@

13896

tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,

13897

&unsignedp, &volatilep, true);

13898

13899

+ /* Make sure bitpos is not negative, it can wreak havoc later. */

13900

+ if (bitpos < 0)

13901

+ {

13902

+ gcc_assert (offset == NULL_TREE);

13903

+ offset = size_int (bitpos >> (BITS_PER_UNIT == 8

13904

+ ? 3 : exact_log2 (BITS_PER_UNIT)));

13905

+ bitpos &= BITS_PER_UNIT - 1;

13906

+ }

13907

+

13908

if (TREE_CODE (to) == COMPONENT_REF

13909

&& DECL_BIT_FIELD_TYPE (TREE_OPERAND (to, 1)))

13910

get_bit_range (&bitregion_start, &bitregion_end, to, &bitpos, &offset);

13911

Index: gcc/go/go-gcc.cc

13912

===================================================================

13913

--- a/src/gcc/go/go-gcc.cc (.../tags/gcc_4_8_2_release)

13914

+++ b/src/gcc/go/go-gcc.cc (.../branches/gcc-4_8-branch)

13915

@@ -232,6 +232,9 @@

13916

Bexpression*

13917

convert_expression(Btype* type, Bexpression* expr, Location);

13918

13919

+ Bexpression*

13920

+ function_code_expression(Bfunction*, Location);

13921

+

13922

// Statements.

13923

13924

Bstatement*

13925

@@ -334,6 +337,17 @@

13926

Bexpression*

13927

label_address(Blabel*, Location);

13928

13929

+ // Functions.

13930

+

13931

+ Bfunction*

13932

+ error_function()

13933

+ { return this->make_function(error_mark_node); }

13934

+

13935

+ Bfunction*

13936

+ function(Btype* fntype, const std::string& name, const std::string& asm_name,

13937

+ bool is_visible, bool is_declaration, bool is_inlinable,

13938

+ bool disable_split_stack, bool in_unique_section, Location);

13939

+

13940

private:

13941

// Make a Bexpression from a tree.

13942

Bexpression*

13943

@@ -350,6 +364,10 @@

13944

make_type(tree t)

13945

{ return new Btype(t); }

13946

13947

+ Bfunction*

13948

+ make_function(tree t)

13949

+ { return new Bfunction(t); }

13950

+

13951

Btype*

13952

fill_in_struct(Btype*, const std::vector<Btyped_identifier>&);

13953

13954

@@ -966,6 +984,19 @@

13955

return tree_to_expr(ret);

13956

}

13957

13958

+// Get the address of a function.

13959

+

13960

+Bexpression*

13961

+Gcc_backend::function_code_expression(Bfunction* bfunc, Location location)

13962

+{

13963

+ tree func = bfunc->get_tree();

13964

+ if (func == error_mark_node)

13965

+ return this->error_expression();

13966

+

13967

+ tree ret = build_fold_addr_expr_loc(location.gcc_location(), func);

13968

+ return this->make_expression(ret);

13969

+}

13970

+

13971

// An expression as a statement.

13972

13973

Bstatement*

13974

@@ -1724,6 +1755,56 @@

13975

return this->make_expression(ret);

13976

}

13977

13978

+// Declare or define a new function.

13979

+

13980

+Bfunction*

13981

+Gcc_backend::function(Btype* fntype, const std::string& name,

13982

+ const std::string& asm_name, bool is_visible,

13983

+ bool is_declaration, bool is_inlinable,

13984

+ bool disable_split_stack, bool in_unique_section,

13985

+ Location location)

13986

+{

13987

+ tree functype = fntype->get_tree();

13988

+ if (functype != error_mark_node)

13989

+ {

13990

+ gcc_assert(FUNCTION_POINTER_TYPE_P(functype));

13991

+ functype = TREE_TYPE(functype);

13992

+ }

13993

+ tree id = get_identifier_from_string(name);

13994

+ if (functype == error_mark_node || id == error_mark_node)

13995

+ return this->error_function();

13996

+

13997

+ tree decl = build_decl(location.gcc_location(), FUNCTION_DECL, id, functype);

13998

+ if (!asm_name.empty())

13999

+ SET_DECL_ASSEMBLER_NAME(decl, get_identifier_from_string(asm_name));

14000

+ if (is_visible)

14001

+ TREE_PUBLIC(decl) = 1;

14002

+ if (is_declaration)

14003

+ DECL_EXTERNAL(decl) = 1;

14004

+ else

14005

+ {

14006

+ tree restype = TREE_TYPE(functype);

14007

+ tree resdecl =

14008

+ build_decl(location.gcc_location(), RESULT_DECL, NULL_TREE, restype);

14009

+ DECL_ARTIFICIAL(resdecl) = 1;

14010

+ DECL_IGNORED_P(resdecl) = 1;

14011

+ DECL_CONTEXT(resdecl) = decl;

14012

+ DECL_RESULT(decl) = resdecl;

14013

+ }

14014

+ if (!is_inlinable)

14015

+ DECL_UNINLINABLE(decl) = 1;

14016

+ if (disable_split_stack)

14017

+ {

14018

+ tree attr = get_identifier("__no_split_stack__");

14019

+ DECL_ATTRIBUTES(decl) = tree_cons(attr, NULL_TREE, NULL_TREE);

14020

+ }

14021

+ if (in_unique_section)

14022

+ resolve_unique_section(decl, 0, 1);

14023

+

14024

+ go_preserve_from_gc(decl);

14025

+ return new Bfunction(decl);

14026

+}

14027

+

14028

// The single backend.

14029

14030

static Gcc_backend gcc_backend;

14031

@@ -1799,3 +1880,9 @@

14032

{

14033

return bv->get_tree();

14034

}

14035

+

14036

+tree

14037

+function_to_tree(Bfunction* bf)

14038

+{

14039

+ return bf->get_tree();

14040

+}

14041

Index: gcc/go/ChangeLog

14042

===================================================================

14043

--- a/src/gcc/go/ChangeLog (.../tags/gcc_4_8_2_release)

14044

+++ b/src/gcc/go/ChangeLog (.../branches/gcc-4_8-branch)

14045

@@ -1,3 +1,22 @@

14046

+2013-12-11 Ian Lance Taylor <iant@google.com>

14047

+

14048

+ * go-lang.c (go_langhook_post_options): Disable sibling calls by

14049

+ default.

14050

+

14051

+2013-10-16 Ian Lance Taylor <iant@google.com>

14052

+

14053

+ Bring in from mainline:

14054

+

14055

+ 2013-10-11 Chris Manghane <cmang@google.com>

14056

+ * go-gcc.cc (Gcc_backend::function_code_expression): New

14057

+ function.

14058

+

14059

+ 2013-10-10 Chris Manghane <cmang@google.com>

14060

+ * go-gcc.cc (Backend::error_function): New function.

14061

+ (Backend::function): New function.

14062

+ (Backend::make_function): New function.

14063

+ (function_to_tree): New function.

14064

+

14065

2013-10-16 Release Manager

14066

14067

* GCC 4.8.2 released.

14068

Index: gcc/go/go-lang.c

14069

===================================================================

14070

--- a/src/gcc/go/go-lang.c (.../tags/gcc_4_8_2_release)

14071

+++ b/src/gcc/go/go-lang.c (.../branches/gcc-4_8-branch)

14072

@@ -269,6 +269,10 @@

14073

if (flag_excess_precision_cmdline == EXCESS_PRECISION_DEFAULT)

14074

flag_excess_precision_cmdline = EXCESS_PRECISION_STANDARD;

14075

14076

+ /* Tail call optimizations can confuse uses of runtime.Callers. */

14077

+ if (!global_options_set.x_flag_optimize_sibling_calls)

14078

+ global_options.x_flag_optimize_sibling_calls = 0;

14079

+

14080

/* Returning false means that the backend should be used. */

14081

return false;

14082

}

14083

Index: gcc/go/gofrontend/gogo.cc

14084

===================================================================

14085

--- a/src/gcc/go/gofrontend/gogo.cc (.../tags/gcc_4_8_2_release)

14086

+++ b/src/gcc/go/gofrontend/gogo.cc (.../branches/gcc-4_8-branch)

14087

@@ -2822,7 +2822,10 @@

14088

if (orig_fntype->is_varargs())

14089

new_fntype->set_is_varargs();

14090

14091

- std::string name = orig_no->name() + "$recover";

14092

+ std::string name = orig_no->name();

14093

+ if (orig_fntype->is_method())

14094

+ name += "$" + orig_fntype->receiver()->type()->mangled_name(gogo);

14095

+ name += "$recover";

14096

Named_object *new_no = gogo->start_function(name, new_fntype, false,

14097

location);

14098

Function *new_func = new_no->func_value();

14099

@@ -2916,7 +2919,25 @@

14100

&& !orig_rec_no->var_value()->is_receiver());

14101

orig_rec_no->var_value()->set_is_receiver();

14102

14103

- const std::string& new_receiver_name(orig_fntype->receiver()->name());

14104

+ std::string new_receiver_name(orig_fntype->receiver()->name());

14105

+ if (new_receiver_name.empty())

14106

+ {

14107

+ // Find the receiver. It was named "r.NNN" in

14108

+ // Gogo::start_function.

14109

+ for (Bindings::const_definitions_iterator p =

14110

+ new_bindings->begin_definitions();

14111

+ p != new_bindings->end_definitions();

14112

+ ++p)

14113

+ {

14114

+ const std::string& pname((*p)->name());

14115

+ if (pname[0] == 'r' && pname[1] == '.')

14116

+ {

14117

+ new_receiver_name = pname;

14118

+ break;

14119

+ }

14120

+ }

14121

+ go_assert(!new_receiver_name.empty());

14122

+ }

14123

Named_object* new_rec_no = new_bindings->lookup_local(new_receiver_name);

14124

if (new_rec_no == NULL)

14125

go_assert(saw_errors());

14126

@@ -3320,7 +3341,8 @@

14127

closure_var_(NULL), block_(block), location_(location), labels_(),

14128

local_type_count_(0), descriptor_(NULL), fndecl_(NULL), defer_stack_(NULL),

14129

is_sink_(false), results_are_named_(false), nointerface_(false),

14130

- calls_recover_(false), is_recover_thunk_(false), has_recover_thunk_(false),

14131

+ is_unnamed_type_stub_method_(false), calls_recover_(false),

14132

+ is_recover_thunk_(false), has_recover_thunk_(false),

14133

in_unique_section_(false)

14134

{

14135

}

14136

@@ -3819,6 +3841,81 @@

14137

*presults = results;

14138

}

14139

14140

+// Get the backend representation.

14141

+

14142

+Bfunction*

14143

+Function::get_or_make_decl(Gogo* gogo, Named_object* no)

14144

+{

14145

+ if (this->fndecl_ == NULL)

14146

+ {

14147

+ std::string asm_name;

14148

+ bool is_visible = false;

14149

+ if (no->package() != NULL)

14150

+ ;

14151

+ else if (this->enclosing_ != NULL || Gogo::is_thunk(no))

14152

+ ;

14153

+ else if (Gogo::unpack_hidden_name(no->name()) == "init"

14154

+ && !this->type_->is_method())

14155

+ ;

14156

+ else if (Gogo::unpack_hidden_name(no->name()) == "main"

14157

+ && gogo->is_main_package())

14158

+ is_visible = true;

14159

+ // Methods have to be public even if they are hidden because

14160

+ // they can be pulled into type descriptors when using

14161

+ // anonymous fields.

14162

+ else if (!Gogo::is_hidden_name(no->name())

14163

+ || this->type_->is_method())

14164

+ {

14165

+ if (!this->is_unnamed_type_stub_method_)

14166

+ is_visible = true;

14167

+ std::string pkgpath = gogo->pkgpath_symbol();

14168

+ if (this->type_->is_method()

14169

+ && Gogo::is_hidden_name(no->name())

14170

+ && Gogo::hidden_name_pkgpath(no->name()) != gogo->pkgpath())

14171

+ {

14172

+ // This is a method we created for an unexported

14173

+ // method of an imported embedded type. We need to

14174

+ // use the pkgpath of the imported package to avoid

14175

+ // a possible name collision. See bug478 for a test

14176

+ // case.

14177

+ pkgpath = Gogo::hidden_name_pkgpath(no->name());

14178

+ pkgpath = Gogo::pkgpath_for_symbol(pkgpath);

14179

+ }

14180

+

14181

+ asm_name = pkgpath;

14182

+ asm_name.append(1, '.');

14183

+ asm_name.append(Gogo::unpack_hidden_name(no->name()));

14184

+ if (this->type_->is_method())

14185

+ {

14186

+ asm_name.append(1, '.');

14187

+ Type* rtype = this->type_->receiver()->type();

14188

+ asm_name.append(rtype->mangled_name(gogo));

14189

+ }

14190

+ }

14191

+

14192

+ // If a function calls the predeclared recover function, we

14193

+ // can't inline it, because recover behaves differently in a

14194

+ // function passed directly to defer. If this is a recover

14195

+ // thunk that we built to test whether a function can be

14196

+ // recovered, we can't inline it, because that will mess up

14197

+ // our return address comparison.

14198

+ bool is_inlinable = !(this->calls_recover_ || this->is_recover_thunk_);

14199

+

14200

+ // If this is a thunk created to call a function which calls

14201

+ // the predeclared recover function, we need to disable

14202

+ // stack splitting for the thunk.

14203

+ bool disable_split_stack = this->is_recover_thunk_;

14204

+

14205

+ Btype* functype = this->type_->get_backend_fntype(gogo);

14206

+ this->fndecl_ =

14207

+ gogo->backend()->function(functype, no->get_id(gogo), asm_name,

14208

+ is_visible, false, is_inlinable,

14209

+ disable_split_stack,

14210

+ this->in_unique_section_, this->location());

14211

+ }

14212

+ return this->fndecl_;

14213

+}

14214

+

14215

// Class Block.

14216

14217

Block::Block(Block* enclosing, Location location)

14218

@@ -5110,6 +5207,75 @@

14219

go_unreachable();

14220

}

14221

14222

+

14223

+// Return the external identifier for this object.

14224

+

14225

+std::string

14226

+Named_object::get_id(Gogo* gogo)

14227

+{

14228

+ go_assert(!this->is_variable() && !this->is_result_variable());

14229

+ std::string decl_name;

14230

+ if (this->is_function_declaration()

14231

+ && !this->func_declaration_value()->asm_name().empty())

14232

+ decl_name = this->func_declaration_value()->asm_name();

14233

+ else if (this->is_type()

14234

+ && Linemap::is_predeclared_location(this->type_value()->location()))

14235

+ {

14236

+ // We don't need the package name for builtin types.

14237

+ decl_name = Gogo::unpack_hidden_name(this->name_);

14238

+ }

14239

+ else

14240

+ {

14241

+ std::string package_name;

14242

+ if (this->package_ == NULL)

14243

+ package_name = gogo->package_name();

14244

+ else

14245

+ package_name = this->package_->package_name();

14246

+

14247

+ // Note that this will be misleading if this is an unexported

14248

+ // method generated for an embedded imported type. In that case

14249

+ // the unexported method should have the package name of the

14250

+ // package from which it is imported, but we are going to give

14251

+ // it our package name. Fixing this would require knowing the

14252

+ // package name, but we only know the package path. It might be

14253

+ // better to use package paths here anyhow. This doesn't affect

14254

+ // the assembler code, because we always set that name in

14255

+ // Function::get_or_make_decl anyhow. FIXME.

14256

+

14257

+ decl_name = package_name + '.' + Gogo::unpack_hidden_name(this->name_);

14258

+

14259

+ Function_type* fntype;

14260

+ if (this->is_function())

14261

+ fntype = this->func_value()->type();

14262

+ else if (this->is_function_declaration())

14263

+ fntype = this->func_declaration_value()->type();

14264

+ else

14265

+ fntype = NULL;

14266

+ if (fntype != NULL && fntype->is_method())

14267

+ {

14268

+ decl_name.push_back('.');

14269

+ decl_name.append(fntype->receiver()->type()->mangled_name(gogo));

14270

+ }

14271

+ }

14272

+ if (this->is_type())

14273

+ {

14274

+ unsigned int index;

14275

+ const Named_object* in_function = this->type_value()->in_function(&index);

14276

+ if (in_function != NULL)

14277

+ {

14278

+ decl_name += '$' + Gogo::unpack_hidden_name(in_function->name());

14279

+ if (index > 0)

14280

+ {

14281

+ char buf[30];

14282

+ snprintf(buf, sizeof buf, "%u", index);

14283

+ decl_name += '$';

14284

+ decl_name += buf;

14285

+ }

14286

+ }

14287

+ }

14288

+ return decl_name;

14289

+}

14290

+

14291

// Class Bindings.

14292

14293

Bindings::Bindings(Bindings* enclosing)

14294

Index: gcc/go/gofrontend/runtime.def

14295

===================================================================

14296

--- a/src/gcc/go/gofrontend/runtime.def (.../tags/gcc_4_8_2_release)

14297

+++ b/src/gcc/go/gofrontend/runtime.def (.../branches/gcc-4_8-branch)

14298

@@ -68,6 +68,12 @@

14299

P1(STRING), R1(SLICE))

14300

14301

14302

+// Complex division.

14303

+DEF_GO_RUNTIME(COMPLEX64_DIV, "__go_complex64_div",

14304

+ P2(COMPLEX64, COMPLEX64), R1(COMPLEX64))

14305

+DEF_GO_RUNTIME(COMPLEX128_DIV, "__go_complex128_div",

14306

+ P2(COMPLEX128, COMPLEX128), R1(COMPLEX128))

14307

+

14308

// Make a slice.

14309

DEF_GO_RUNTIME(MAKESLICE1, "__go_make_slice1", P2(TYPE, UINTPTR), R1(SLICE))

14310

DEF_GO_RUNTIME(MAKESLICE2, "__go_make_slice2", P3(TYPE, UINTPTR, UINTPTR),

14311

Index: gcc/go/gofrontend/gogo.h

14312

===================================================================

14313

--- a/src/gcc/go/gofrontend/gogo.h (.../tags/gcc_4_8_2_release)

14314

+++ b/src/gcc/go/gofrontend/gogo.h (.../branches/gcc-4_8-branch)

14315

@@ -48,6 +48,7 @@

14316

class Bblock;

14317

class Bvariable;

14318

class Blabel;

14319

+class Bfunction;

14320

14321

// This file declares the basic classes used to hold the internal

14322

// representation of Go which is built by the parser.

14323

@@ -952,6 +953,15 @@

14324

this->nointerface_ = true;

14325

}

14326

14327

+ // Record that this function is a stub method created for an unnamed

14328

+ // type.

14329

+ void

14330

+ set_is_unnamed_type_stub_method()

14331

+ {

14332

+ go_assert(this->is_method());

14333

+ this->is_unnamed_type_stub_method_ = true;

14334

+ }

14335

+

14336

// Add a new field to the closure variable.

14337

void

14338

add_closure_field(Named_object* var, Location loc)

14339

@@ -1089,17 +1099,13 @@

14340

this->descriptor_ = descriptor;

14341

}

14342

14343

- // Return the function's decl given an identifier.

14344

- tree

14345

- get_or_make_decl(Gogo*, Named_object*, tree id);

14346

+ // Return the backend representation.

14347

+ Bfunction*

14348

+ get_or_make_decl(Gogo*, Named_object*);

14349

14350

// Return the function's decl after it has been built.

14351

tree

14352

- get_decl() const

14353

- {

14354

- go_assert(this->fndecl_ != NULL);

14355

- return this->fndecl_;

14356

- }

14357

+ get_decl() const;

14358

14359

// Set the function decl to hold a tree of the function code.

14360

void

14361

@@ -1170,7 +1176,7 @@

14362

// The function descriptor, if any.

14363

Expression* descriptor_;

14364

// The function decl.

14365

- tree fndecl_;

14366

+ Bfunction* fndecl_;

14367

// The defer stack variable. A pointer to this variable is used to

14368

// distinguish the defer stack for one function from another. This

14369

// is NULL unless we actually need a defer stack.

14370

@@ -1181,6 +1187,9 @@

14371

bool results_are_named_ : 1;

14372

// True if this method should not be included in the type descriptor.

14373

bool nointerface_ : 1;

14374

+ // True if this function is a stub method created for an unnamed

14375

+ // type.

14376

+ bool is_unnamed_type_stub_method_ : 1;

14377

// True if this function calls the predeclared recover function.

14378

bool calls_recover_ : 1;

14379

// True if this a thunk built for a function which calls recover.

14380

@@ -1265,9 +1274,9 @@

14381

has_descriptor() const

14382

{ return this->descriptor_ != NULL; }

14383

14384

- // Return a decl for the function given an identifier.

14385

- tree

14386

- get_or_make_decl(Gogo*, Named_object*, tree id);

14387

+ // Return a backend representation.

14388

+ Bfunction*

14389

+ get_or_make_decl(Gogo*, Named_object*);

14390

14391

// If there is a descriptor, build it into the backend

14392

// representation.

14393

@@ -1290,7 +1299,7 @@

14394

// The function descriptor, if any.

14395

Expression* descriptor_;

14396

// The function decl if needed.

14397

- tree fndecl_;

14398

+ Bfunction* fndecl_;

14399

};

14400

14401

// A variable.

14402

@@ -2181,8 +2190,8 @@

14403

Bvariable*

14404

get_backend_variable(Gogo*, Named_object* function);

14405

14406

- // Return a tree for the external identifier for this object.

14407

- tree

14408

+ // Return the external identifier for this object.

14409

+ std::string

14410

get_id(Gogo*);

14411

14412

// Return a tree representing this object.

14413

Index: gcc/go/gofrontend/types.h

14414

===================================================================

14415

--- a/src/gcc/go/gofrontend/types.h (.../tags/gcc_4_8_2_release)

14416

+++ b/src/gcc/go/gofrontend/types.h (.../branches/gcc-4_8-branch)

14417

@@ -1138,6 +1138,13 @@

14418

Function_type* equal_fntype, Named_object** hash_fn,

14419

Named_object** equal_fn);

14420

14421

+ void

14422

+ write_named_hash(Gogo*, Named_type*, Function_type* hash_fntype,

14423

+ Function_type* equal_fntype);

14424

+

14425

+ void

14426

+ write_named_equal(Gogo*, Named_type*);

14427

+

14428

// Build a composite literal for the uncommon type information.

14429

Expression*

14430

uncommon_type_constructor(Gogo*, Type* uncommon_type,

14431

@@ -1717,7 +1724,8 @@

14432

Typed_identifier_list* results, Location location)

14433

: Type(TYPE_FUNCTION),

14434

receiver_(receiver), parameters_(parameters), results_(results),

14435

- location_(location), is_varargs_(false), is_builtin_(false)

14436

+ location_(location), is_varargs_(false), is_builtin_(false),

14437

+ fnbtype_(NULL)

14438

{ }

14439

14440

// Get the receiver.

14441

@@ -1789,6 +1797,12 @@

14442

Function_type*

14443

copy_with_receiver(Type*) const;

14444

14445

+ // Return a copy of this type with the receiver treated as the first

14446

+ // parameter. If WANT_POINTER_RECEIVER is true, the receiver is

14447

+ // forced to be a pointer.

14448

+ Function_type*

14449

+ copy_with_receiver_as_param(bool want_pointer_receiver) const;

14450

+

14451

// Return a copy of this type ignoring any receiver and using dummy

14452

// names for all parameters. This is used for thunks for method

14453

// values.

14454

@@ -1798,6 +1812,11 @@

14455

static Type*

14456

make_function_type_descriptor_type();

14457

14458

+ // Return the backend representation of this function type. This is used

14459

+ // as the real type of a backend function declaration or defintion.

14460

+ Btype*

14461

+ get_backend_fntype(Gogo*);

14462

+

14463

protected:

14464

int

14465

do_traverse(Traverse*);

14466

@@ -1851,6 +1870,9 @@

14467

// Whether this is a special builtin function which can not simply

14468

// be called. This is used for len, cap, etc.

14469

bool is_builtin_;

14470

+ // The backend representation of this type for backend function

14471

+ // declarations and definitions.

14472

+ Btype* fnbtype_;

14473

};

14474

14475

// The type of a pointer.

14476

@@ -1915,7 +1937,7 @@

14477

{

14478

public:

14479

explicit Struct_field(const Typed_identifier& typed_identifier)

14480

- : typed_identifier_(typed_identifier), tag_(NULL)

14481

+ : typed_identifier_(typed_identifier), tag_(NULL), is_imported_(false)

14482

{ }

14483

14484

// The field name.

14485

@@ -1926,6 +1948,10 @@

14486

bool

14487

is_field_name(const std::string& name) const;

14488

14489

+ // Return whether this struct field is an unexported field named NAME.

14490

+ bool

14491

+ is_unexported_field_name(Gogo*, const std::string& name) const;

14492

+

14493

// Return whether this struct field is an embedded built-in type.

14494

bool

14495

is_embedded_builtin(Gogo*) const;

14496

@@ -1963,6 +1989,11 @@

14497

set_tag(const std::string& tag)

14498

{ this->tag_ = new std::string(tag); }

14499

14500

+ // Record that this field is defined in an imported struct.

14501

+ void

14502

+ set_is_imported()

14503

+ { this->is_imported_ = true; }

14504

+

14505

// Set the type. This is only used in error cases.

14506

void

14507

set_type(Type* type)

14508

@@ -1973,6 +2004,8 @@

14509

Typed_identifier typed_identifier_;

14510

// The field tag. This is NULL if the field has no tag.

14511

std::string* tag_;

14512

+ // Whether this field is defined in an imported struct.

14513

+ bool is_imported_;

14514

};

14515

14516

// A list of struct fields.

14517

Index: gcc/go/gofrontend/parse.cc

14518

===================================================================

14519

--- a/src/gcc/go/gofrontend/parse.cc (.../tags/gcc_4_8_2_release)

14520

+++ b/src/gcc/go/gofrontend/parse.cc (.../branches/gcc-4_8-branch)

14521

@@ -744,6 +744,8 @@

14522

return NULL;

14523

14524

Parse::Names names;

14525

+ if (receiver != NULL)

14526

+ names[receiver->name()] = receiver;

14527

if (params != NULL)

14528

this->check_signature_names(params, &names);

14529

if (results != NULL)

14530

Index: gcc/go/gofrontend/import.h

14531

===================================================================

14532

--- a/src/gcc/go/gofrontend/import.h (.../tags/gcc_4_8_2_release)

14533

+++ b/src/gcc/go/gofrontend/import.h (.../branches/gcc-4_8-branch)

14534

@@ -149,6 +149,11 @@

14535

location() const

14536

{ return this->location_; }

14537

14538

+ // Return the package we are importing.

14539

+ Package*

14540

+ package() const

14541

+ { return this->package_; }

14542

+

14543

// Return the next character.

14544

int

14545

peek_char()

14546

Index: gcc/go/gofrontend/runtime.cc

14547

===================================================================

14548

--- a/src/gcc/go/gofrontend/runtime.cc (.../tags/gcc_4_8_2_release)

14549

+++ b/src/gcc/go/gofrontend/runtime.cc (.../branches/gcc-4_8-branch)

14550

@@ -42,6 +42,8 @@

14551

RFT_RUNE,

14552

// Go type float64, C type double.

14553

RFT_FLOAT64,

14554

+ // Go type complex64, C type __complex float.

14555

+ RFT_COMPLEX64,

14556

// Go type complex128, C type __complex double.

14557

RFT_COMPLEX128,

14558

// Go type string, C type struct __go_string.

14559

@@ -126,6 +128,10 @@

14560

t = Type::lookup_float_type("float64");

14561

break;

14562

14563

+ case RFT_COMPLEX64:

14564

+ t = Type::lookup_complex_type("complex64");

14565

+ break;

14566

+

14567

case RFT_COMPLEX128:

14568

t = Type::lookup_complex_type("complex128");

14569

break;

14570

@@ -216,6 +222,7 @@

14571

case RFT_UINTPTR:

14572

case RFT_RUNE:

14573

case RFT_FLOAT64:

14574

+ case RFT_COMPLEX64:

14575

case RFT_COMPLEX128:

14576

case RFT_STRING:

14577

case RFT_POINTER:

14578

Index: gcc/go/gofrontend/expressions.h

14579

===================================================================

14580

--- a/src/gcc/go/gofrontend/expressions.h (.../tags/gcc_4_8_2_release)

14581

+++ b/src/gcc/go/gofrontend/expressions.h (.../branches/gcc-4_8-branch)

14582

@@ -1514,8 +1514,8 @@

14583

closure()

14584

{ return this->closure_; }

14585

14586

- // Return a tree for the code for a function.

14587

- static tree

14588

+ // Return a backend expression for the code of a function.

14589

+ static Bexpression*

14590

get_code_pointer(Gogo*, Named_object* function, Location loc);

14591

14592

protected:

14593

Index: gcc/go/gofrontend/gogo-tree.cc

14594

===================================================================

14595

--- a/src/gcc/go/gofrontend/gogo-tree.cc (.../tags/gcc_4_8_2_release)

14596

+++ b/src/gcc/go/gofrontend/gogo-tree.cc (.../branches/gcc-4_8-branch)

14597

@@ -985,74 +985,6 @@

14598

delete[] vec;

14599

}

14600

14601

-// Get a tree for the identifier for a named object.

14602

-

14603

-tree

14604

-Named_object::get_id(Gogo* gogo)

14605

-{

14606

- go_assert(!this->is_variable() && !this->is_result_variable());

14607

- std::string decl_name;

14608

- if (this->is_function_declaration()

14609

- && !this->func_declaration_value()->asm_name().empty())

14610

- decl_name = this->func_declaration_value()->asm_name();

14611

- else if (this->is_type()

14612

- && Linemap::is_predeclared_location(this->type_value()->location()))

14613

- {

14614

- // We don't need the package name for builtin types.

14615

- decl_name = Gogo::unpack_hidden_name(this->name_);

14616

- }

14617

- else

14618

- {

14619

- std::string package_name;

14620

- if (this->package_ == NULL)

14621

- package_name = gogo->package_name();

14622

- else

14623

- package_name = this->package_->package_name();

14624

-

14625

- // Note that this will be misleading if this is an unexported

14626

- // method generated for an embedded imported type. In that case

14627

- // the unexported method should have the package name of the

14628

- // package from which it is imported, but we are going to give

14629

- // it our package name. Fixing this would require knowing the

14630

- // package name, but we only know the package path. It might be

14631

- // better to use package paths here anyhow. This doesn't affect

14632

- // the assembler code, because we always set that name in

14633

- // Function::get_or_make_decl anyhow. FIXME.

14634

-

14635

- decl_name = package_name + '.' + Gogo::unpack_hidden_name(this->name_);

14636

-

14637

- Function_type* fntype;

14638

- if (this->is_function())

14639

- fntype = this->func_value()->type();

14640

- else if (this->is_function_declaration())

14641

- fntype = this->func_declaration_value()->type();

14642

- else

14643

- fntype = NULL;

14644

- if (fntype != NULL && fntype->is_method())

14645

- {

14646

- decl_name.push_back('.');

14647

- decl_name.append(fntype->receiver()->type()->mangled_name(gogo));

14648

- }

14649

- }

14650

- if (this->is_type())

14651

- {

14652

- unsigned int index;

14653

- const Named_object* in_function = this->type_value()->in_function(&index);

14654

- if (in_function != NULL)

14655

- {

14656

- decl_name += '$' + Gogo::unpack_hidden_name(in_function->name());

14657

- if (index > 0)

14658

- {

14659

- char buf[30];

14660

- snprintf(buf, sizeof buf, "%u", index);

14661

- decl_name += '$';

14662

- decl_name += buf;

14663

- }

14664

- }

14665

- }

14666

- return get_identifier_from_string(decl_name);

14667

-}

14668

-

14669

// Get a tree for a named object.

14670

14671

tree

14672

@@ -1067,11 +999,6 @@

14673

return error_mark_node;

14674

}

14675

14676

- tree name;

14677

- if (this->classification_ == NAMED_OBJECT_TYPE)

14678

- name = NULL_TREE;

14679

- else

14680

- name = this->get_id(gogo);

14681

tree decl;

14682

switch (this->classification_)

14683

{

14684

@@ -1099,6 +1026,7 @@

14685

decl = error_mark_node;

14686

else if (INTEGRAL_TYPE_P(TREE_TYPE(expr_tree)))

14687

{

14688

+ tree name = get_identifier_from_string(this->get_id(gogo));

14689

decl = build_decl(named_constant->location().gcc_location(),

14690

CONST_DECL, name, TREE_TYPE(expr_tree));

14691

DECL_INITIAL(decl) = expr_tree;

14692

@@ -1161,7 +1089,7 @@

14693

case NAMED_OBJECT_FUNC:

14694

{

14695

Function* func = this->u_.func_value;

14696

- decl = func->get_or_make_decl(gogo, this, name);

14697

+ decl = function_to_tree(func->get_or_make_decl(gogo, this));

14698

if (decl != error_mark_node)

14699

{

14700

if (func->block() != NULL)

14701

@@ -1286,124 +1214,13 @@

14702

return block_tree;

14703

}

14704

14705

-// Get a tree for a function decl.

14706

+// Get the backend representation.

14707

14708

-tree

14709

-Function::get_or_make_decl(Gogo* gogo, Named_object* no, tree id)

14710

+Bfunction*

14711

+Function_declaration::get_or_make_decl(Gogo* gogo, Named_object* no)

14712

{

14713

- if (this->fndecl_ == NULL_TREE)

14714

+ if (this->fndecl_ == NULL)

14715

{

14716

- tree functype = type_to_tree(this->type_->get_backend(gogo));

14717

-

14718

- if (functype != error_mark_node)

14719

- {

14720

- // The type of a function comes back as a pointer to a

14721

- // struct whose first field is the function, but we want the

14722

- // real function type for a function declaration.

14723

- go_assert(POINTER_TYPE_P(functype)

14724

- && TREE_CODE(TREE_TYPE(functype)) == RECORD_TYPE);

14725

- functype = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(functype)));

14726

- go_assert(FUNCTION_POINTER_TYPE_P(functype));

14727

- functype = TREE_TYPE(functype);

14728

- }

14729

-

14730

- if (functype == error_mark_node)

14731

- this->fndecl_ = error_mark_node;

14732

- else

14733

- {

14734

- tree decl = build_decl(this->location().gcc_location(), FUNCTION_DECL,

14735

- id, functype);

14736

-

14737

- this->fndecl_ = decl;

14738

-

14739

- if (no->package() != NULL)

14740

- ;

14741

- else if (this->enclosing_ != NULL || Gogo::is_thunk(no))

14742

- ;

14743

- else if (Gogo::unpack_hidden_name(no->name()) == "init"

14744

- && !this->type_->is_method())

14745

- ;

14746

- else if (Gogo::unpack_hidden_name(no->name()) == "main"

14747

- && gogo->is_main_package())

14748

- TREE_PUBLIC(decl) = 1;

14749

- // Methods have to be public even if they are hidden because

14750

- // they can be pulled into type descriptors when using

14751

- // anonymous fields.

14752

- else if (!Gogo::is_hidden_name(no->name())

14753

- || this->type_->is_method())

14754

- {

14755

- TREE_PUBLIC(decl) = 1;

14756

- std::string pkgpath = gogo->pkgpath_symbol();

14757

- if (this->type_->is_method()

14758

- && Gogo::is_hidden_name(no->name())

14759

- && Gogo::hidden_name_pkgpath(no->name()) != gogo->pkgpath())

14760

- {

14761

- // This is a method we created for an unexported

14762

- // method of an imported embedded type. We need to

14763

- // use the pkgpath of the imported package to avoid

14764

- // a possible name collision. See bug478 for a test

14765

- // case.

14766

- pkgpath = Gogo::hidden_name_pkgpath(no->name());

14767

- pkgpath = Gogo::pkgpath_for_symbol(pkgpath);

14768

- }

14769

-

14770

- std::string asm_name = pkgpath;

14771

- asm_name.append(1, '.');

14772

- asm_name.append(Gogo::unpack_hidden_name(no->name()));

14773

- if (this->type_->is_method())

14774

- {

14775

- asm_name.append(1, '.');

14776

- Type* rtype = this->type_->receiver()->type();

14777

- asm_name.append(rtype->mangled_name(gogo));

14778

- }

14779

- SET_DECL_ASSEMBLER_NAME(decl,

14780

- get_identifier_from_string(asm_name));

14781

- }

14782

-

14783

- // Why do we have to do this in the frontend?

14784

- tree restype = TREE_TYPE(functype);

14785

- tree resdecl =

14786

- build_decl(this->location().gcc_location(), RESULT_DECL, NULL_TREE,

14787

- restype);

14788

- DECL_ARTIFICIAL(resdecl) = 1;

14789

- DECL_IGNORED_P(resdecl) = 1;

14790

- DECL_CONTEXT(resdecl) = decl;

14791

- DECL_RESULT(decl) = resdecl;

14792

-

14793

- // If a function calls the predeclared recover function, we

14794

- // can't inline it, because recover behaves differently in a

14795

- // function passed directly to defer. If this is a recover

14796

- // thunk that we built to test whether a function can be

14797

- // recovered, we can't inline it, because that will mess up

14798

- // our return address comparison.

14799

- if (this->calls_recover_ || this->is_recover_thunk_)

14800

- DECL_UNINLINABLE(decl) = 1;

14801

-

14802

- // If this is a thunk created to call a function which calls

14803

- // the predeclared recover function, we need to disable

14804

- // stack splitting for the thunk.

14805

- if (this->is_recover_thunk_)

14806

- {

14807

- tree attr = get_identifier("__no_split_stack__");

14808

- DECL_ATTRIBUTES(decl) = tree_cons(attr, NULL_TREE, NULL_TREE);

14809

- }

14810

-

14811

- if (this->in_unique_section_)

14812

- resolve_unique_section (decl, 0, 1);

14813

-

14814

- go_preserve_from_gc(decl);

14815

- }

14816

- }

14817

- return this->fndecl_;

14818

-}

14819

-

14820

-// Get a tree for a function declaration.

14821

-

14822

-tree

14823

-Function_declaration::get_or_make_decl(Gogo* gogo, Named_object* no, tree id)

14824

-{

14825

- if (this->fndecl_ == NULL_TREE)

14826

- {

14827

// Let Go code use an asm declaration to pick up a builtin

14828

// function.

14829

if (!this->asm_name_.empty())

14830

@@ -1412,58 +1229,46 @@

14831

builtin_functions.find(this->asm_name_);

14832

if (p != builtin_functions.end())

14833

{

14834

- this->fndecl_ = p->second;

14835

+ this->fndecl_ = tree_to_function(p->second);

14836

return this->fndecl_;

14837

}

14838

}

14839

14840

- tree functype = type_to_tree(this->fntype_->get_backend(gogo));

14841

+ std::string asm_name;

14842

+ if (this->asm_name_.empty())

14843

+ {

14844

+ asm_name = (no->package() == NULL

14845

+ ? gogo->pkgpath_symbol()

14846

+ : no->package()->pkgpath_symbol());

14847

+ asm_name.append(1, '.');

14848

+ asm_name.append(Gogo::unpack_hidden_name(no->name()));

14849

+ if (this->fntype_->is_method())

14850

+ {

14851

+ asm_name.append(1, '.');

14852

+ Type* rtype = this->fntype_->receiver()->type();

14853

+ asm_name.append(rtype->mangled_name(gogo));

14854

+ }

14855

+ }

14856

14857

- if (functype != error_mark_node)

14858

- {

14859

- // The type of a function comes back as a pointer to a

14860

- // struct whose first field is the function, but we want the

14861

- // real function type for a function declaration.

14862

- go_assert(POINTER_TYPE_P(functype)

14863

- && TREE_CODE(TREE_TYPE(functype)) == RECORD_TYPE);

14864

- functype = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(functype)));

14865

- go_assert(FUNCTION_POINTER_TYPE_P(functype));

14866

- functype = TREE_TYPE(functype);

14867

- }

14868

+ Btype* functype = this->fntype_->get_backend_fntype(gogo);

14869

+ this->fndecl_ =

14870

+ gogo->backend()->function(functype, no->get_id(gogo), asm_name,

14871

+ true, true, true, false, false,

14872

+ this->location());

14873

+ }

14874

14875

- tree decl;

14876

- if (functype == error_mark_node)

14877

- decl = error_mark_node;

14878

- else

14879

- {

14880

- decl = build_decl(this->location().gcc_location(), FUNCTION_DECL, id,

14881

- functype);

14882

- TREE_PUBLIC(decl) = 1;

14883

- DECL_EXTERNAL(decl) = 1;

14884

-

14885

- if (this->asm_name_.empty())

14886

- {

14887

- std::string asm_name = (no->package() == NULL

14888

- ? gogo->pkgpath_symbol()

14889

- : no->package()->pkgpath_symbol());

14890

- asm_name.append(1, '.');

14891

- asm_name.append(Gogo::unpack_hidden_name(no->name()));

14892

- if (this->fntype_->is_method())

14893

- {

14894

- asm_name.append(1, '.');

14895

- Type* rtype = this->fntype_->receiver()->type();

14896

- asm_name.append(rtype->mangled_name(gogo));

14897

- }

14898

- SET_DECL_ASSEMBLER_NAME(decl,

14899

- get_identifier_from_string(asm_name));

14900

- }

14901

- }

14902

- this->fndecl_ = decl;

14903

- go_preserve_from_gc(decl);

14904

- }

14905

return this->fndecl_;

14906

}

14907

14908

+// Return the function's decl after it has been built.

14909

+

14910

+tree

14911

+Function::get_decl() const

14912

+{

14913

+ go_assert(this->fndecl_ != NULL);

14914

+ return function_to_tree(this->fndecl_);

14915

+}

14916

+

14917

// We always pass the receiver to a method as a pointer. If the

14918

// receiver is actually declared as a non-pointer type, then we copy

14919

// the value into a local variable, so that it has the right type. In

14920

@@ -1558,7 +1363,7 @@

14921

void

14922

Function::build_tree(Gogo* gogo, Named_object* named_function)

14923

{

14924

- tree fndecl = this->fndecl_;

14925

+ tree fndecl = this->get_decl();

14926

go_assert(fndecl != NULL_TREE);

14927

14928

tree params = NULL_TREE;

14929

@@ -1796,7 +1601,7 @@

14930

set = NULL_TREE;

14931

else

14932

set = fold_build2_loc(end_loc.gcc_location(), MODIFY_EXPR, void_type_node,

14933

- DECL_RESULT(this->fndecl_), retval);

14934

+ DECL_RESULT(this->get_decl()), retval);

14935

tree ret_stmt = fold_build1_loc(end_loc.gcc_location(), RETURN_EXPR,

14936

void_type_node, set);

14937

append_to_statement_list(ret_stmt, &stmt_list);

14938

@@ -1851,7 +1656,7 @@

14939

retval = this->return_value(gogo, named_function, end_loc,

14940

&stmt_list);

14941

set = fold_build2_loc(end_loc.gcc_location(), MODIFY_EXPR, void_type_node,

14942

- DECL_RESULT(this->fndecl_), retval);

14943

+ DECL_RESULT(this->get_decl()), retval);

14944

ret_stmt = fold_build1_loc(end_loc.gcc_location(), RETURN_EXPR,

14945

void_type_node, set);

14946

14947

@@ -1869,7 +1674,7 @@

14948

*fini = stmt_list;

14949

}

14950

14951

-// Return the value to assign to DECL_RESULT(this->fndecl_). This may

14952

+// Return the value to assign to DECL_RESULT(this->get_decl()). This may

14953

// also add statements to STMT_LIST, which need to be executed before

14954

// the assignment. This is used for a return statement with no

14955

// explicit values.

14956

@@ -1902,7 +1707,7 @@

14957

}

14958

else

14959

{

14960

- tree rettype = TREE_TYPE(DECL_RESULT(this->fndecl_));

14961

+ tree rettype = TREE_TYPE(DECL_RESULT(this->get_decl()));

14962

retval = create_tmp_var(rettype, "RESULT");

14963

tree field = TYPE_FIELDS(rettype);

14964

int index = 0;

14965

@@ -2323,18 +2128,14 @@

14966

go_assert(m != NULL);

14967

14968

Named_object* no = m->named_object();

14969

-

14970

- tree fnid = no->get_id(this);

14971

-

14972

- tree fndecl;

14973

+ Bfunction* bf;

14974

if (no->is_function())

14975

- fndecl = no->func_value()->get_or_make_decl(this, no, fnid);

14976

+ bf = no->func_value()->get_or_make_decl(this, no);

14977

else if (no->is_function_declaration())

14978

- fndecl = no->func_declaration_value()->get_or_make_decl(this, no,

14979

- fnid);

14980

+ bf = no->func_declaration_value()->get_or_make_decl(this, no);

14981

else

14982

go_unreachable();

14983

- fndecl = build_fold_addr_expr(fndecl);

14984

+ tree fndecl = build_fold_addr_expr(function_to_tree(bf));

14985

14986

elt = pointers->quick_push(empty);

14987

elt->index = size_int(i);

14988

@@ -2353,10 +2154,11 @@

14989

TREE_CONSTANT(decl) = 1;

14990

DECL_INITIAL(decl) = constructor;

14991

14992

- // If the interface type has hidden methods, then this is the only

14993

- // definition of the table. Otherwise it is a comdat table which

14994

- // may be defined in multiple packages.

14995

- if (has_hidden_methods)

14996

+ // If the interface type has hidden methods, and the table is for a

14997

+ // named type, then this is the only definition of the table.

14998

+ // Otherwise it is a comdat table which may be defined in multiple

14999

+ // packages.

15000

+ if (has_hidden_methods && type->named_type() != NULL)

15001

TREE_PUBLIC(decl) = 1;

15002

else

15003

{

15004

Index: gcc/go/gofrontend/lex.cc

15005

===================================================================

15006

--- a/src/gcc/go/gofrontend/lex.cc (.../tags/gcc_4_8_2_release)

15007

+++ b/src/gcc/go/gofrontend/lex.cc (.../branches/gcc-4_8-branch)

15008

@@ -873,7 +873,28 @@

15009

&& (cc < 'a' || cc > 'z')

15010

&& cc != '_'

15011

&& (cc < '0' || cc > '9'))

15012

- break;

15013

+ {

15014

+ // Check for an invalid character here, as we get better

15015

+ // error behaviour if we swallow them as part of the

15016

+ // identifier we are building.

15017

+ if ((cc >= ' ' && cc < 0x7f)

15018

+ || cc == '\t'

15019

+ || cc == '\r'

15020

+ || cc == '\n')

15021

+ break;

15022

+

15023

+ this->lineoff_ = p - this->linebuf_;

15024

+ error_at(this->location(),

15025

+ "invalid character 0x%x in identifier",

15026

+ cc);

15027

+ if (!has_non_ascii_char)

15028

+ {

15029

+ buf.assign(pstart, p - pstart);

15030

+ has_non_ascii_char = true;

15031

+ }

15032

+ if (!Lex::is_invalid_identifier(buf))

15033

+ buf.append("$INVALID$");

15034

+ }

15035

++p;

15036

if (is_first)

15037

{

15038

Index: gcc/go/gofrontend/backend.h

15039

===================================================================

15040

--- a/src/gcc/go/gofrontend/backend.h (.../tags/gcc_4_8_2_release)

15041

+++ b/src/gcc/go/gofrontend/backend.h (.../branches/gcc-4_8-branch)

15042

@@ -23,7 +23,7 @@

15043

// The backend representation of a statement.

15044

class Bstatement;

15045

15046

-// The backend representation of a function definition.

15047

+// The backend representation of a function definition or declaration.

15048

class Bfunction;

15049

15050

// The backend representation of a block.

15051

@@ -266,6 +266,11 @@

15052

virtual Bexpression*

15053

convert_expression(Btype* type, Bexpression* expr, Location) = 0;

15054

15055

+ // Create an expression for the address of a function. This is used to

15056

+ // get the address of the code for a function.

15057

+ virtual Bexpression*

15058

+ function_code_expression(Bfunction*, Location) = 0;

15059

+

15060

// Statements.

15061

15062

// Create an error statement. This is used for cases which should

15063

@@ -498,6 +503,32 @@

15064

// recover.

15065

virtual Bexpression*

15066

label_address(Blabel*, Location) = 0;

15067

+

15068

+ // Functions.

15069

+

15070

+ // Create an error function. This is used for cases which should

15071

+ // not occur in a correct program, in order to keep the compilation

15072

+ // going without crashing.

15073

+ virtual Bfunction*

15074

+ error_function() = 0;

15075

+

15076

+ // Declare or define a function of FNTYPE.

15077

+ // NAME is the Go name of the function. ASM_NAME, if not the empty string, is

15078

+ // the name that should be used in the symbol table; this will be non-empty if

15079

+ // a magic extern comment is used.

15080

+ // IS_VISIBLE is true if this function should be visible outside of the

15081

+ // current compilation unit. IS_DECLARATION is true if this is a function

15082

+ // declaration rather than a definition; the function definition will be in

15083

+ // another compilation unit.

15084

+ // IS_INLINABLE is true if the function can be inlined.

15085

+ // DISABLE_SPLIT_STACK is true if this function may not split the stack; this

15086

+ // is used for the implementation of recover.

15087

+ // IN_UNIQUE_SECTION is true if this function should be put into a unique

15088

+ // location if possible; this is used for field tracking.

15089

+ virtual Bfunction*

15090

+ function(Btype* fntype, const std::string& name, const std::string& asm_name,

15091

+ bool is_visible, bool is_declaration, bool is_inlinable,

15092

+ bool disable_split_stack, bool in_unique_section, Location) = 0;

15093

};

15094

15095

// The backend interface has to define this function.

15096

@@ -517,5 +548,6 @@

15097

extern tree stat_to_tree(Bstatement*);

15098

extern tree block_to_tree(Bblock*);

15099

extern tree var_to_tree(Bvariable*);

15100

+extern tree function_to_tree(Bfunction*);

15101

15102

#endif // !defined(GO_BACKEND_H)

15103

Index: gcc/go/gofrontend/types.cc

15104

===================================================================

15105

--- a/src/gcc/go/gofrontend/types.cc (.../tags/gcc_4_8_2_release)

15106

+++ b/src/gcc/go/gofrontend/types.cc (.../branches/gcc-4_8-branch)

15107

@@ -1834,7 +1834,9 @@

15108

bloc);

15109

gogo->start_block(bloc);

15110

15111

- if (this->struct_type() != NULL)

15112

+ if (name != NULL && name->real_type()->named_type() != NULL)

15113

+ this->write_named_hash(gogo, name, hash_fntype, equal_fntype);

15114

+ else if (this->struct_type() != NULL)

15115

this->struct_type()->write_hash_function(gogo, name, hash_fntype,

15116

equal_fntype);

15117

else if (this->array_type() != NULL)

15118

@@ -1852,7 +1854,9 @@

15119

false, bloc);

15120

gogo->start_block(bloc);

15121

15122

- if (this->struct_type() != NULL)

15123

+ if (name != NULL && name->real_type()->named_type() != NULL)

15124

+ this->write_named_equal(gogo, name);

15125

+ else if (this->struct_type() != NULL)

15126

this->struct_type()->write_equal_function(gogo, name);

15127

else if (this->array_type() != NULL)

15128

this->array_type()->write_equal_function(gogo, name);

15129

@@ -1865,6 +1869,100 @@

15130

gogo->finish_function(bloc);

15131

}

15132

15133

+// Write a hash function that simply calls the hash function for a

15134

+// named type. This is used when one named type is defined as

15135

+// another. This ensures that this case works when the other named

15136

+// type is defined in another package and relies on calling hash

15137

+// functions defined only in that package.

15138

+

15139

+void

15140

+Type::write_named_hash(Gogo* gogo, Named_type* name,

15141

+ Function_type* hash_fntype, Function_type* equal_fntype)

15142

+{

15143

+ Location bloc = Linemap::predeclared_location();

15144

+

15145

+ Named_type* base_type = name->real_type()->named_type();

15146

+ go_assert(base_type != NULL);

15147

+

15148

+ // The pointer to the type we are going to hash. This is an

15149

+ // unsafe.Pointer.

15150

+ Named_object* key_arg = gogo->lookup("key", NULL);

15151

+ go_assert(key_arg != NULL);

15152

+

15153

+ // The size of the type we are going to hash.

15154

+ Named_object* keysz_arg = gogo->lookup("key_size", NULL);

15155

+ go_assert(keysz_arg != NULL);

15156

+

15157

+ Named_object* hash_fn;

15158

+ Named_object* equal_fn;

15159

+ name->real_type()->type_functions(gogo, base_type, hash_fntype, equal_fntype,

15160

+ &hash_fn, &equal_fn);

15161

+

15162

+ // Call the hash function for the base type.

15163

+ Expression* key_ref = Expression::make_var_reference(key_arg, bloc);

15164

+ Expression* keysz_ref = Expression::make_var_reference(keysz_arg, bloc);

15165

+ Expression_list* args = new Expression_list();

15166

+ args->push_back(key_ref);

15167

+ args->push_back(keysz_ref);

15168

+ Expression* func = Expression::make_func_reference(hash_fn, NULL, bloc);

15169

+ Expression* call = Expression::make_call(func, args, false, bloc);

15170

+

15171

+ // Return the hash of the base type.

15172

+ Expression_list* vals = new Expression_list();

15173

+ vals->push_back(call);

15174

+ Statement* s = Statement::make_return_statement(vals, bloc);

15175

+ gogo->add_statement(s);

15176

+}

15177

+

15178

+// Write an equality function that simply calls the equality function

15179

+// for a named type. This is used when one named type is defined as

15180

+// another. This ensures that this case works when the other named

15181

+// type is defined in another package and relies on calling equality

15182

+// functions defined only in that package.

15183

+

15184

+void

15185

+Type::write_named_equal(Gogo* gogo, Named_type* name)

15186

+{

15187

+ Location bloc = Linemap::predeclared_location();

15188

+

15189

+ // The pointers to the types we are going to compare. These have

15190

+ // type unsafe.Pointer.

15191

+ Named_object* key1_arg = gogo->lookup("key1", NULL);

15192

+ Named_object* key2_arg = gogo->lookup("key2", NULL);

15193

+ go_assert(key1_arg != NULL && key2_arg != NULL);

15194

+

15195

+ Named_type* base_type = name->real_type()->named_type();

15196

+ go_assert(base_type != NULL);

15197

+

15198

+ // Build temporaries with the base type.

15199

+ Type* pt = Type::make_pointer_type(base_type);

15200

+

15201

+ Expression* ref = Expression::make_var_reference(key1_arg, bloc);

15202

+ ref = Expression::make_cast(pt, ref, bloc);

15203

+ Temporary_statement* p1 = Statement::make_temporary(pt, ref, bloc);

15204

+ gogo->add_statement(p1);

15205

+

15206

+ ref = Expression::make_var_reference(key2_arg, bloc);

15207

+ ref = Expression::make_cast(pt, ref, bloc);

15208

+ Temporary_statement* p2 = Statement::make_temporary(pt, ref, bloc);

15209

+ gogo->add_statement(p2);

15210

+

15211

+ // Compare the values for equality.

15212

+ Expression* t1 = Expression::make_temporary_reference(p1, bloc);

15213

+ t1 = Expression::make_unary(OPERATOR_MULT, t1, bloc);

15214

+

15215

+ Expression* t2 = Expression::make_temporary_reference(p2, bloc);

15216

+ t2 = Expression::make_unary(OPERATOR_MULT, t2, bloc);

15217

+

15218

+ Expression* cond = Expression::make_binary(OPERATOR_EQEQ, t1, t2, bloc);

15219

+

15220

+ // Return the equality comparison.

15221

+ Expression_list* vals = new Expression_list();

15222

+ vals->push_back(cond);

15223

+ Statement* s = Statement::make_return_statement(vals, bloc);

15224

+ gogo->add_statement(s);

15225

+}

15226

+

15227

// Return a composite literal for the type descriptor for a plain type

15228

// of kind RUNTIME_TYPE_KIND named NAME.

15229

15230

@@ -2164,26 +2262,9 @@

15231

15232

++p;

15233

go_assert(p->is_field_name("typ"));

15234

- if (!only_value_methods && m->is_value_method())

15235

- {

15236

- // This is a value method on a pointer type. Change the type of

15237

- // the method to use a pointer receiver. The implementation

15238

- // always uses a pointer receiver anyhow.

15239

- Type* rtype = mtype->receiver()->type();

15240

- Type* prtype = Type::make_pointer_type(rtype);

15241

- Typed_identifier* receiver =

15242

- new Typed_identifier(mtype->receiver()->name(), prtype,

15243

- mtype->receiver()->location());

15244

- mtype = Type::make_function_type(receiver,

15245

- (mtype->parameters() == NULL

15246

- ? NULL

15247

- : mtype->parameters()->copy()),

15248

- (mtype->results() == NULL

15249

- ? NULL

15250

- : mtype->results()->copy()),

15251

- mtype->location());

15252

- }

15253

- vals->push_back(Expression::make_type_descriptor(mtype, bloc));

15254

+ bool want_pointer_receiver = !only_value_methods && m->is_value_method();

15255

+ nonmethod_type = mtype->copy_with_receiver_as_param(want_pointer_receiver);

15256

+ vals->push_back(Expression::make_type_descriptor(nonmethod_type, bloc));

15257

15258

++p;

15259

go_assert(p->is_field_name("tfn"));

15260

@@ -3383,6 +3464,68 @@

15261

// Get the backend representation for a function type.

15262

15263

Btype*

15264

+Function_type::get_backend_fntype(Gogo* gogo)

15265

+{

15266

+ if (this->fnbtype_ == NULL)

15267

+ {

15268

+ Backend::Btyped_identifier breceiver;

15269

+ if (this->receiver_ != NULL)

15270

+ {

15271

+ breceiver.name = Gogo::unpack_hidden_name(this->receiver_->name());

15272

+

15273

+ // We always pass the address of the receiver parameter, in

15274

+ // order to make interface calls work with unknown types.

15275

+ Type* rtype = this->receiver_->type();

15276

+ if (rtype->points_to() == NULL)

15277

+ rtype = Type::make_pointer_type(rtype);

15278

+ breceiver.btype = rtype->get_backend(gogo);

15279

+ breceiver.location = this->receiver_->location();

15280

+ }

15281

+

15282

+ std::vector<Backend::Btyped_identifier> bparameters;

15283

+ if (this->parameters_ != NULL)

15284

+ {

15285

+ bparameters.resize(this->parameters_->size());

15286

+ size_t i = 0;

15287

+ for (Typed_identifier_list::const_iterator p =

15288

+ this->parameters_->begin(); p != this->parameters_->end();

15289

+ ++p, ++i)

15290

+ {

15291

+ bparameters[i].name = Gogo::unpack_hidden_name(p->name());

15292

+ bparameters[i].btype = p->type()->get_backend(gogo);

15293

+ bparameters[i].location = p->location();

15294

+ }

15295

+ go_assert(i == bparameters.size());

15296

+ }

15297

+

15298

+ std::vector<Backend::Btyped_identifier> bresults;

15299

+ if (this->results_ != NULL)

15300

+ {

15301

+ bresults.resize(this->results_->size());

15302

+ size_t i = 0;

15303

+ for (Typed_identifier_list::const_iterator p =

15304

+ this->results_->begin(); p != this->results_->end();

15305

+ ++p, ++i)

15306

+ {

15307

+ bresults[i].name = Gogo::unpack_hidden_name(p->name());

15308

+ bresults[i].btype = p->type()->get_backend(gogo);

15309

+ bresults[i].location = p->location();

15310

+ }

15311

+ go_assert(i == bresults.size());

15312

+ }

15313

+

15314

+ this->fnbtype_ = gogo->backend()->function_type(breceiver, bparameters,

15315

+ bresults,

15316

+ this->location());

15317

+

15318

+ }

15319

+

15320

+ return this->fnbtype_;

15321

+}

15322

+

15323

+// Get the backend representation for a Go function type.

15324

+

15325

+Btype*

15326

Function_type::do_get_backend(Gogo* gogo)

15327

{

15328

// When we do anything with a function value other than call it, it

15329

@@ -3395,57 +3538,9 @@

15330

gogo->backend()->placeholder_struct_type("__go_descriptor", loc);

15331

Btype* ptr_struct_type = gogo->backend()->pointer_type(struct_type);

15332

15333

- Backend::Btyped_identifier breceiver;

15334

- if (this->receiver_ != NULL)

15335

- {

15336

- breceiver.name = Gogo::unpack_hidden_name(this->receiver_->name());

15337

-

15338

- // We always pass the address of the receiver parameter, in

15339

- // order to make interface calls work with unknown types.

15340

- Type* rtype = this->receiver_->type();

15341

- if (rtype->points_to() == NULL)

15342

- rtype = Type::make_pointer_type(rtype);

15343

- breceiver.btype = rtype->get_backend(gogo);

15344

- breceiver.location = this->receiver_->location();

15345

- }

15346

-

15347

- std::vector<Backend::Btyped_identifier> bparameters;

15348

- if (this->parameters_ != NULL)

15349

- {

15350

- bparameters.resize(this->parameters_->size());

15351

- size_t i = 0;

15352

- for (Typed_identifier_list::const_iterator p = this->parameters_->begin();

15353

- p != this->parameters_->end();

15354

- ++p, ++i)

15355

- {

15356

- bparameters[i].name = Gogo::unpack_hidden_name(p->name());

15357

- bparameters[i].btype = p->type()->get_backend(gogo);

15358

- bparameters[i].location = p->location();

15359

- }

15360

- go_assert(i == bparameters.size());

15361

- }

15362

-

15363

- std::vector<Backend::Btyped_identifier> bresults;

15364

- if (this->results_ != NULL)

15365

- {

15366

- bresults.resize(this->results_->size());

15367

- size_t i = 0;

15368

- for (Typed_identifier_list::const_iterator p = this->results_->begin();

15369

- p != this->results_->end();

15370

- ++p, ++i)

15371

- {

15372

- bresults[i].name = Gogo::unpack_hidden_name(p->name());

15373

- bresults[i].btype = p->type()->get_backend(gogo);

15374

- bresults[i].location = p->location();

15375

- }

15376

- go_assert(i == bresults.size());

15377

- }

15378

-

15379

- Btype* fntype = gogo->backend()->function_type(breceiver, bparameters,

15380

- bresults, loc);

15381

std::vector<Backend::Btyped_identifier> fields(1);

15382

fields[0].name = "code";

15383

- fields[0].btype = fntype;

15384

+ fields[0].btype = this->get_backend_fntype(gogo);

15385

fields[0].location = loc;

15386

if (!gogo->backend()->set_placeholder_struct_type(struct_type, fields))

15387

return gogo->backend()->error_type();

15388

@@ -3821,6 +3916,32 @@

15389

return ret;

15390

}

15391

15392

+// Make a copy of a function type with the receiver as the first

15393

+// parameter.

15394

+

15395

+Function_type*

15396

+Function_type::copy_with_receiver_as_param(bool want_pointer_receiver) const

15397

+{

15398

+ go_assert(this->is_method());

15399

+ Typed_identifier_list* new_params = new Typed_identifier_list();

15400

+ Type* rtype = this->receiver_->type();

15401

+ if (want_pointer_receiver)

15402

+ rtype = Type::make_pointer_type(rtype);

15403

+ Typed_identifier receiver(this->receiver_->name(), rtype,

15404

+ this->receiver_->location());

15405

+ new_params->push_back(receiver);

15406

+ const Typed_identifier_list* orig_params = this->parameters_;

15407

+ if (orig_params != NULL && !orig_params->empty())

15408

+ {

15409

+ for (Typed_identifier_list::const_iterator p = orig_params->begin();

15410

+ p != orig_params->end();

15411

+ ++p)

15412

+ new_params->push_back(*p);

15413

+ }

15414

+ return Type::make_function_type(NULL, new_params, this->results_,

15415

+ this->location_);

15416

+}

15417

+

15418

// Make a copy of a function type ignoring any receiver and adding a

15419

// closure parameter.

15420

15421

@@ -4195,7 +4316,8 @@

15422

15423

// This is a horrible hack caused by the fact that we don't pack

15424

// the names of builtin types. FIXME.

15425

- if (nt != NULL

15426

+ if (!this->is_imported_

15427

+ && nt != NULL

15428

&& nt->is_builtin()

15429

&& nt->name() == Gogo::unpack_hidden_name(name))

15430

return true;

15431

@@ -4204,6 +4326,36 @@

15432

}

15433

}

15434

15435

+// Return whether this field is an unexported field named NAME.

15436

+

15437

+bool

15438

+Struct_field::is_unexported_field_name(Gogo* gogo,

15439

+ const std::string& name) const

15440

+{

15441

+ const std::string& field_name(this->field_name());

15442

+ if (Gogo::is_hidden_name(field_name)

15443

+ && name == Gogo::unpack_hidden_name(field_name)

15444

+ && gogo->pack_hidden_name(name, false) != field_name)

15445

+ return true;

15446

+

15447

+ // Check for the name of a builtin type. This is like the test in

15448

+ // is_field_name, only there we return false if this->is_imported_,

15449

+ // and here we return true.

15450

+ if (this->is_imported_ && this->is_anonymous())

15451

+ {

15452

+ Type* t = this->typed_identifier_.type();

15453

+ if (t->points_to() != NULL)

15454

+ t = t->points_to();

15455

+ Named_type* nt = t->named_type();

15456

+ if (nt != NULL

15457

+ && nt->is_builtin()

15458

+ && nt->name() == Gogo::unpack_hidden_name(name))

15459

+ return true;

15460

+ }

15461

+

15462

+ return false;

15463

+}

15464

+

15465

// Return whether this field is an embedded built-in type.

15466

15467

bool

15468

@@ -4264,13 +4416,8 @@

15469

++p)

15470

{

15471

Type* t = p->type();

15472

- if (t->is_undefined())

15473

+ if (p->is_anonymous())

15474

{

15475

- error_at(p->location(), "struct field type is incomplete");

15476

- p->set_type(Type::make_error_type());

15477

- }

15478

- else if (p->is_anonymous())

15479

- {

15480

if (t->named_type() != NULL && t->points_to() != NULL)

15481

{

15482

error_at(p->location(), "embedded type may not be a pointer");

15483

@@ -4641,13 +4788,8 @@

15484

for (Struct_field_list::const_iterator pf = fields->begin();

15485

pf != fields->end();

15486

++pf)

15487

- {

15488

- const std::string& field_name(pf->field_name());

15489

- if (Gogo::is_hidden_name(field_name)

15490

- && name == Gogo::unpack_hidden_name(field_name)

15491

- && gogo->pack_hidden_name(name, false) != field_name)

15492

- return true;

15493

- }

15494

+ if (pf->is_unexported_field_name(gogo, name))

15495

+ return true;

15496

}

15497

return false;

15498

}

15499

@@ -5250,6 +5392,7 @@

15500

Type* ftype = imp->read_type();

15501

15502

Struct_field sf(Typed_identifier(name, ftype, imp->location()));

15503

+ sf.set_is_imported();

15504

15505

if (imp->peek_char() == ' ')

15506

{

15507

@@ -9022,6 +9165,8 @@

15508

fntype->is_varargs(), location);

15509

gogo->finish_function(fntype->location());

15510

15511

+ if (type->named_type() == NULL && stub->is_function())

15512

+ stub->func_value()->set_is_unnamed_type_stub_method();

15513

if (m->nointerface() && stub->is_function())

15514

stub->func_value()->set_nointerface();

15515

}

15516

@@ -9289,7 +9434,9 @@

15517

else

15518

{

15519

bool is_unexported;

15520

- if (!Gogo::is_hidden_name(name))

15521

+ // The test for 'a' and 'z' is to handle builtin names,

15522

+ // which are not hidden.

15523

+ if (!Gogo::is_hidden_name(name) && (name[0] < 'a' || name[0] > 'z'))

15524

is_unexported = false;

15525

else

15526

{

15527

Index: gcc/go/gofrontend/expressions.cc

15528

===================================================================

15529

--- a/src/gcc/go/gofrontend/expressions.cc (.../tags/gcc_4_8_2_release)

15530

+++ b/src/gcc/go/gofrontend/expressions.cc (.../branches/gcc-4_8-branch)

15531

@@ -1219,7 +1219,7 @@

15532

15533

// Get the tree for the code of a function expression.

15534

15535

-tree

15536

+Bexpression*

15537

Func_expression::get_code_pointer(Gogo* gogo, Named_object* no, Location loc)

15538

{

15539

Function_type* fntype;

15540

@@ -1237,25 +1237,18 @@

15541

error_at(loc,

15542

"invalid use of special builtin function %qs; must be called",

15543

no->message_name().c_str());

15544

- return error_mark_node;

15545

+ return gogo->backend()->error_expression();

15546

}

15547

15548

- tree id = no->get_id(gogo);

15549

- if (id == error_mark_node)

15550

- return error_mark_node;

15551

-

15552

- tree fndecl;

15553

+ Bfunction* fndecl;

15554

if (no->is_function())

15555

- fndecl = no->func_value()->get_or_make_decl(gogo, no, id);

15556

+ fndecl = no->func_value()->get_or_make_decl(gogo, no);

15557

else if (no->is_function_declaration())

15558

- fndecl = no->func_declaration_value()->get_or_make_decl(gogo, no, id);

15559

+ fndecl = no->func_declaration_value()->get_or_make_decl(gogo, no);

15560

else

15561

go_unreachable();

15562

15563

- if (fndecl == error_mark_node)

15564

- return error_mark_node;

15565

-

15566

- return build_fold_addr_expr_loc(loc.gcc_location(), fndecl);

15567

+ return gogo->backend()->function_code_expression(fndecl, loc);

15568

}

15569

15570

// Get the tree for a function expression. This is used when we take

15571

@@ -1492,8 +1485,10 @@

15572

tree

15573

Func_code_reference_expression::do_get_tree(Translate_context* context)

15574

{

15575

- return Func_expression::get_code_pointer(context->gogo(), this->function_,

15576

- this->location());

15577

+ Bexpression* ret =

15578

+ Func_expression::get_code_pointer(context->gogo(), this->function_,

15579

+ this->location());

15580

+ return expr_to_tree(ret);

15581

}

15582

15583

// Make a reference to the code of a function.

15584

@@ -3055,8 +3050,7 @@

15585

do_lower(Gogo*, Named_object*, Statement_inserter*, int);

15586

15587

bool

15588

- do_is_constant() const

15589

- { return this->expr_->is_constant(); }

15590

+ do_is_constant() const;

15591

15592

bool

15593

do_numeric_constant_value(Numeric_constant*) const;

15594

@@ -3198,6 +3192,27 @@

15595

return this;

15596

}

15597

15598

+// Return whether a type conversion is a constant.

15599

+

15600

+bool

15601

+Type_conversion_expression::do_is_constant() const

15602

+{

15603

+ if (!this->expr_->is_constant())

15604

+ return false;

15605

+

15606

+ // A conversion to a type that may not be used as a constant is not

15607

+ // a constant. For example, []byte(nil).

15608

+ Type* type = this->type_;

15609

+ if (type->integer_type() == NULL

15610

+ && type->float_type() == NULL

15611

+ && type->complex_type() == NULL

15612

+ && !type->is_boolean_type()

15613

+ && !type->is_string_type())

15614

+ return false;

15615

+

15616

+ return true;

15617

+}

15618

+

15619

// Return the constant numeric value if there is one.

15620

15621

bool

15622

@@ -5586,6 +5601,15 @@

15623

subcontext.type = NULL;

15624

}

15625

15626

+ if (this->op_ == OPERATOR_ANDAND || this->op_ == OPERATOR_OROR)

15627

+ {

15628

+ // For a logical operation, the context does not determine the

15629

+ // types of the operands. The operands must be some boolean

15630

+ // type but if the context has a boolean type they do not

15631

+ // inherit it. See http://golang.org/issue/3924.

15632

+ subcontext.type = NULL;

15633

+ }

15634

+

15635

// Set the context for the left hand operand.

15636

if (is_shift_op)

15637

{

15638

@@ -5967,6 +5991,43 @@

15639

right);

15640

}

15641

15642

+ // For complex division Go wants slightly different results than the

15643

+ // GCC library provides, so we have our own runtime routine.

15644

+ if (this->op_ == OPERATOR_DIV && this->left_->type()->complex_type() != NULL)

15645

+ {

15646

+ const char *name;

15647

+ tree *pdecl;

15648

+ Type* ctype;

15649

+ static tree complex64_div_decl;

15650

+ static tree complex128_div_decl;

15651

+ switch (this->left_->type()->complex_type()->bits())

15652

+ {

15653

+ case 64:

15654

+ name = "__go_complex64_div";

15655

+ pdecl = &complex64_div_decl;

15656

+ ctype = Type::lookup_complex_type("complex64");

15657

+ break;

15658

+ case 128:

15659

+ name = "__go_complex128_div";

15660

+ pdecl = &complex128_div_decl;

15661

+ ctype = Type::lookup_complex_type("complex128");

15662

+ break;

15663

+ default:

15664

+ go_unreachable();

15665

+ }

15666

+ Btype* cbtype = ctype->get_backend(gogo);

15667

+ tree ctype_tree = type_to_tree(cbtype);

15668

+ return Gogo::call_builtin(pdecl,

15669

+ this->location(),

15670

+ name,

15671

+ 2,

15672

+ ctype_tree,

15673

+ ctype_tree,

15674

+ fold_convert_loc(gccloc, ctype_tree, left),

15675

+ type,

15676

+ fold_convert_loc(gccloc, ctype_tree, right));

15677

+ }

15678

+

15679

tree compute_type = excess_precision_type(type);

15680

if (compute_type != NULL_TREE)

15681

{

15682

@@ -7191,6 +7252,15 @@

15683

if (this->code_ == BUILTIN_OFFSETOF)

15684

{

15685

Expression* arg = this->one_arg();

15686

+

15687

+ if (arg->bound_method_expression() != NULL

15688

+ || arg->interface_field_reference_expression() != NULL)

15689

+ {

15690

+ this->report_error(_("invalid use of method value as argument "

15691

+ "of Offsetof"));

15692

+ return this;

15693

+ }

15694

+

15695

Field_reference_expression* farg = arg->field_reference_expression();

15696

while (farg != NULL)

15697

{

15698

@@ -7200,7 +7270,8 @@

15699

// it must not be reached through pointer indirections.

15700

if (farg->expr()->deref() != farg->expr())

15701

{

15702

- this->report_error(_("argument of Offsetof implies indirection of an embedded field"));

15703

+ this->report_error(_("argument of Offsetof implies "

15704

+ "indirection of an embedded field"));

15705

return this;

15706

}

15707

// Go up until we reach the original base.

15708

@@ -7476,7 +7547,7 @@

15709

switch (nc.to_unsigned_long(&v))

15710

{

15711

case Numeric_constant::NC_UL_VALID:

15712

- return true;

15713

+ break;

15714

case Numeric_constant::NC_UL_NOTINT:

15715

error_at(e->location(), "non-integer %s argument to make",

15716

is_length ? "len" : "cap");

15717

@@ -7488,8 +7559,23 @@

15718

case Numeric_constant::NC_UL_BIG:

15719

// We don't want to give a compile-time error for a 64-bit

15720

// value on a 32-bit target.

15721

- return true;

15722

+ break;

15723

}

15724

+

15725

+ mpz_t val;

15726

+ if (!nc.to_int(&val))

15727

+ go_unreachable();

15728

+ int bits = mpz_sizeinbase(val, 2);

15729

+ mpz_clear(val);

15730

+ Type* int_type = Type::lookup_integer_type("int");

15731

+ if (bits >= int_type->integer_type()->bits())

15732

+ {

15733

+ error_at(e->location(), "%s argument too large for make",

15734

+ is_length ? "len" : "cap");

15735

+ return false;

15736

+ }

15737

+

15738

+ return true;

15739

}

15740

15741

if (e->type()->integer_type() != NULL)

15742

@@ -7595,6 +7681,8 @@

15743

bool

15744

Builtin_call_expression::do_is_constant() const

15745

{

15746

+ if (this->is_error_expression())

15747

+ return true;

15748

switch (this->code_)

15749

{

15750

case BUILTIN_LEN:

15751

@@ -9744,15 +9832,9 @@

15752

}

15753

15754

tree fntype_tree = type_to_tree(fntype->get_backend(gogo));

15755

- if (fntype_tree == error_mark_node)

15756

+ tree fnfield_type = type_to_tree(fntype->get_backend_fntype(gogo));

15757

+ if (fntype_tree == error_mark_node || fnfield_type == error_mark_node)

15758

return error_mark_node;

15759

- go_assert(POINTER_TYPE_P(fntype_tree));

15760

- if (TREE_TYPE(fntype_tree) == error_mark_node)

15761

- return error_mark_node;

15762

- go_assert(TREE_CODE(TREE_TYPE(fntype_tree)) == RECORD_TYPE);

15763

- tree fnfield_type = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(fntype_tree)));

15764

- if (fnfield_type == error_mark_node)

15765

- return error_mark_node;

15766

go_assert(FUNCTION_POINTER_TYPE_P(fnfield_type));

15767

tree rettype = TREE_TYPE(TREE_TYPE(fnfield_type));

15768

if (rettype == error_mark_node)

15769

@@ -9763,7 +9845,7 @@

15770

if (func != NULL)

15771

{

15772

Named_object* no = func->named_object();

15773

- fn = Func_expression::get_code_pointer(gogo, no, location);

15774

+ fn = expr_to_tree(Func_expression::get_code_pointer(gogo, no, location));

15775

if (!has_closure)

15776

closure_tree = NULL_TREE;

15777

else

15778

@@ -10817,11 +10899,20 @@

15779

void

15780

String_index_expression::do_check_types(Gogo*)

15781

{

15782

- if (this->start_->type()->integer_type() == NULL)

15783

+ Numeric_constant nc;

15784

+ unsigned long v;

15785

+ if (this->start_->type()->integer_type() == NULL

15786

+ && !this->start_->type()->is_error()

15787

+ && (!this->start_->numeric_constant_value(&nc)

15788

+ || nc.to_unsigned_long(&v) == Numeric_constant::NC_UL_NOTINT))

15789

this->report_error(_("index must be integer"));

15790

if (this->end_ != NULL

15791

&& this->end_->type()->integer_type() == NULL

15792

- && !this->end_->is_nil_expression())

15793

+ && !this->end_->type()->is_error()

15794

+ && !this->end_->is_nil_expression()

15795

+ && !this->end_->is_error_expression()

15796

+ && (!this->end_->numeric_constant_value(&nc)

15797

+ || nc.to_unsigned_long(&v) == Numeric_constant::NC_UL_NOTINT))

15798

this->report_error(_("slice end must be integer"));

15799

15800

std::string sval;

15801

Index: gcc/recog.c

15802

===================================================================

15803

--- a/src/gcc/recog.c (.../tags/gcc_4_8_2_release)

15804

+++ b/src/gcc/recog.c (.../branches/gcc-4_8-branch)

15805

@@ -3061,6 +3061,9 @@

15806

return 1;

15807

}

15808

15809

+/* Regno offset to be used in the register search. */

15810

+static int search_ofs;

15811

+

15812

/* Try to find a hard register of mode MODE, matching the register class in

15813

CLASS_STR, which is available at the beginning of insn CURRENT_INSN and

15814

remains available until the end of LAST_INSN. LAST_INSN may be NULL_RTX,

15815

@@ -3076,7 +3079,6 @@

15816

peep2_find_free_register (int from, int to, const char *class_str,

15817

enum machine_mode mode, HARD_REG_SET *reg_set)

15818

{

15819

- static int search_ofs;

15820

enum reg_class cl;

15821

HARD_REG_SET live;

15822

df_ref *def_rec;

15823

@@ -3541,6 +3543,7 @@

15824

/* Initialize the regsets we're going to use. */

15825

for (i = 0; i < MAX_INSNS_PER_PEEP2 + 1; ++i)

15826

peep2_insn_data[i].live_before = BITMAP_ALLOC (&reg_obstack);

15827

+ search_ofs = 0;

15828

live = BITMAP_ALLOC (&reg_obstack);

15829

15830

FOR_EACH_BB_REVERSE (bb)

15831

Index: gcc/ada/indepsw-darwin.adb

15832

===================================================================

15833

--- a/src/gcc/ada/indepsw-darwin.adb (.../tags/gcc_4_8_2_release)

15834

+++ b/src/gcc/ada/indepsw-darwin.adb (.../branches/gcc-4_8-branch)

15835

@@ -0,0 +1,67 @@

15836

+------------------------------------------------------------------------------

15837

+-- --

15838

+-- GNAT COMPILER COMPONENTS --

15839

+-- --

15840

+-- I N D E P S W --

15841

+-- --

15842

+-- B o d y --

15843

+-- (Darwin version) --

15844

+-- --

15845

15846

+-- --

15847

+-- GNAT is free software; you can redistribute it and/or modify it under --

15848

+-- terms of the GNU General Public License as published by the Free Soft- --

15849

+-- ware Foundation; either version 3, or (at your option) any later ver- --

15850

+-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --

15851

+-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --

15852

+-- or FITNESS FOR A PARTICULAR PURPOSE. --

15853

+-- --

15854

+-- As a special exception under Section 7 of GPL version 3, you are granted --

15855

+-- additional permissions described in the GCC Runtime Library Exception, --

15856

+-- version 3.1, as published by the Free Software Foundation. --

15857

+-- --

15858

+-- You should have received a copy of the GNU General Public License and --

15859

+-- a copy of the GCC Runtime Library Exception along with this program; --

15860

+-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --

15861

+-- <http://www.gnu.org/licenses/>. --

15862

+-- --

15863

+-- GNAT was originally developed by the GNAT team at New York University. --

15864

+-- Extensive contributions were provided by Ada Core Technologies Inc. --

15865

+-- --

15866

+------------------------------------------------------------------------------

15867

+

15868

+-- This is the Darwin version

15869

+

15870

+package body Indepsw is

15871

+

15872

+ Map_Switch : aliased constant String := "-Wl,-map,";

15873

+

15874

+ -------------

15875

+ -- Convert --

15876

+ -------------

15877

+

15878

+ procedure Convert

15879

+ (Switch : Switch_Kind;

15880

+ Argument : String;

15881

+ To : out String_List_Access)

15882

+ is

15883

+ begin

15884

+ case Switch is

15885

+ when Map_File =>

15886

+ To := new Argument_List'(1 => new String'(Map_Switch & Argument));

15887

+ end case;

15888

+ end Convert;

15889

+

15890

+ ------------------

15891

+ -- Is_Supported --

15892

+ ------------------

15893

+

15894

+ function Is_Supported (Switch : Switch_Kind) return Boolean is

15895

+ begin

15896

+ case Switch is

15897

+ when Map_File =>

15898

+ return True;

15899

+ end case;

15900

+ end Is_Supported;

15901

+

15902

+end Indepsw;

15903

Index: gcc/ada/ChangeLog

15904

===================================================================

15905

--- a/src/gcc/ada/ChangeLog (.../tags/gcc_4_8_2_release)

15906

+++ b/src/gcc/ada/ChangeLog (.../branches/gcc-4_8-branch)

15907

@@ -1,3 +1,29 @@

15908

+2013-12-12 Eric Botcazou <ebotcazou@adacore.com>

15909

+ Iain Sandoe <iain@codesourcery.com>

15910

+

15911

+ PR ada/55946

15912

+ * gcc-interface/Make-lang.in (ada/doctools/xgnatugn): Use gnatmake.

15913

+ * gcc-interface/Makefile.in (GCC_LINK): Add LDFLAGS.

15914

+ (../../gnatmake): Remove LDFLAGS.

15915

+ (../../gnatlink): Likewise.

15916

+

15917

+2013-12-04 Eric Botcazou <ebotcazou@adacore.com>

15918

+

15919

+ PR ada/59382

15920

+ * indepsw-darwin.adb: New file.

15921

+

15922

+2013-10-19 Eric Botcazou <ebotcazou@adacore.com>

15923

+

15924

+ * gcc-interface/utils.c (scale_by_factor_of): New function.

15925

+ (rest_of_record_type_compilation): Use scale_by_factor_of in order to

15926

+ scale the original offset for both rounding cases; in the second case,

15927

+ take into accout the addend to compute the alignment. Tidy up.

15928

+

15929

+2013-10-19 Eric Botcazou <ebotcazou@adacore.com>

15930

+

15931

+ * gcc-interface/utils.c (gnat_set_type_context): New function.

15932

+ (gnat_pushdecl): Use it to set the context of the type.

15933

+

15934

2013-10-16 Release Manager

15935

15936

* GCC 4.8.2 released.

15937

Index: gcc/ada/gcc-interface/utils.c

15938

===================================================================

15939

--- a/src/gcc/ada/gcc-interface/utils.c (.../tags/gcc_4_8_2_release)

15940

+++ b/src/gcc/ada/gcc-interface/utils.c (.../branches/gcc-4_8-branch)

15941

@@ -232,6 +232,7 @@

15942

static tree split_plus (tree, tree *);

15943

static tree float_type_for_precision (int, enum machine_mode);

15944

static tree convert_to_fat_pointer (tree, tree);

15945

+static unsigned int scale_by_factor_of (tree, unsigned int);

15946

static bool potential_alignment_gap (tree, tree, tree);

15947

static void process_attributes (tree, struct attrib *);

15948

15949

@@ -532,6 +533,22 @@

15950

free_binding_level = level;

15951

}

15952

15953

+/* Set the context of TYPE and its parallel types (if any) to CONTEXT. */

15954

+

15955

+static void

15956

+gnat_set_type_context (tree type, tree context)

15957

+{

15958

+ tree decl = TYPE_STUB_DECL (type);

15959

+

15960

+ TYPE_CONTEXT (type) = context;

15961

+

15962

+ while (decl && DECL_PARALLEL_TYPE (decl))

15963

+ {

15964

+ TYPE_CONTEXT (DECL_PARALLEL_TYPE (decl)) = context;

15965

+ decl = TYPE_STUB_DECL (DECL_PARALLEL_TYPE (decl));

15966

+ }

15967

+}

15968

+

15969

/* Record DECL as belonging to the current lexical scope and use GNAT_NODE

15970

for location information and flag propagation. */

15971

15972

@@ -613,7 +630,7 @@

15973

if (TREE_CODE (t) == POINTER_TYPE)

15974

TYPE_NEXT_PTR_TO (t) = tt;

15975

TYPE_NAME (tt) = DECL_NAME (decl);

15976

- TYPE_CONTEXT (tt) = DECL_CONTEXT (decl);

15977

+ gnat_set_type_context (tt, DECL_CONTEXT (decl));

15978

TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (t);

15979

DECL_ORIGINAL_TYPE (decl) = tt;

15980

}

15981

@@ -623,7 +640,7 @@

15982

/* We need a variant for the placeholder machinery to work. */

15983

tree tt = build_variant_type_copy (t);

15984

TYPE_NAME (tt) = decl;

15985

- TYPE_CONTEXT (tt) = DECL_CONTEXT (decl);

15986

+ gnat_set_type_context (tt, DECL_CONTEXT (decl));

15987

TREE_USED (tt) = TREE_USED (t);

15988

TREE_TYPE (decl) = tt;

15989

if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))

15990

@@ -645,7 +662,7 @@

15991

if (!(TYPE_NAME (t) && TREE_CODE (TYPE_NAME (t)) == TYPE_DECL))

15992

{

15993

TYPE_NAME (t) = decl;

15994

- TYPE_CONTEXT (t) = DECL_CONTEXT (decl);

15995

+ gnat_set_type_context (t, DECL_CONTEXT (decl));

15996

}

15997

}

15998

}

15999

@@ -1692,93 +1709,74 @@

16000

TYPE_SIZE_UNIT (new_record_type)

16001

= size_int (TYPE_ALIGN (record_type) / BITS_PER_UNIT);

16002

16003

- /* Now scan all the fields, replacing each field with a new

16004

- field corresponding to the new encoding. */

16005

+ /* Now scan all the fields, replacing each field with a new field

16006

+ corresponding to the new encoding. */

16007

for (old_field = TYPE_FIELDS (record_type); old_field;

16008

old_field = DECL_CHAIN (old_field))

16009

{

16010

tree field_type = TREE_TYPE (old_field);

16011

tree field_name = DECL_NAME (old_field);

16012

- tree new_field;

16013

tree curpos = bit_position (old_field);

16014

+ tree pos, new_field;

16015

bool var = false;

16016

unsigned int align = 0;

16017

- tree pos;

16018

16019

+ /* We're going to do some pattern matching below so remove as many

16020

+ conversions as possible. */

16021

+ curpos = remove_conversions (curpos, true);

16022

+

16023

/* See how the position was modified from the last position.

16024

16025

- There are two basic cases we support: a value was added

16026

- to the last position or the last position was rounded to

16027

- a boundary and they something was added. Check for the

16028

- first case first. If not, see if there is any evidence

16029

- of rounding. If so, round the last position and try

16030

- again.

16031

+ There are two basic cases we support: a value was added

16032

+ to the last position or the last position was rounded to

16033

+ a boundary and they something was added. Check for the

16034

+ first case first. If not, see if there is any evidence

16035

+ of rounding. If so, round the last position and retry.

16036

16037

- If this is a union, the position can be taken as zero. */

16038

-

16039

- /* Some computations depend on the shape of the position expression,

16040

- so strip conversions to make sure it's exposed. */

16041

- curpos = remove_conversions (curpos, true);

16042

-

16043

+ If this is a union, the position can be taken as zero. */

16044

if (TREE_CODE (new_record_type) == UNION_TYPE)

16045

- pos = bitsize_zero_node, align = 0;

16046

+ pos = bitsize_zero_node;

16047

else

16048

pos = compute_related_constant (curpos, last_pos);

16049

16050

- if (!pos && TREE_CODE (curpos) == MULT_EXPR

16051

+ if (!pos

16052

+ && TREE_CODE (curpos) == MULT_EXPR

16053

&& host_integerp (TREE_OPERAND (curpos, 1), 1))

16054

{

16055

tree offset = TREE_OPERAND (curpos, 0);

16056

align = tree_low_cst (TREE_OPERAND (curpos, 1), 1);

16057

-

16058

- /* An offset which is a bitwise AND with a mask increases the

16059

- alignment according to the number of trailing zeros. */

16060

- offset = remove_conversions (offset, true);

16061

- if (TREE_CODE (offset) == BIT_AND_EXPR

16062

- && TREE_CODE (TREE_OPERAND (offset, 1)) == INTEGER_CST)

16063

- {

16064

- unsigned HOST_WIDE_INT mask

16065

- = TREE_INT_CST_LOW (TREE_OPERAND (offset, 1));

16066

- unsigned int i;

16067

-

16068

- for (i = 0; i < HOST_BITS_PER_WIDE_INT; i++)

16069

- {

16070

- if (mask & 1)

16071

- break;

16072

- mask >>= 1;

16073

- align *= 2;

16074

- }

16075

- }

16076

-

16077

- pos = compute_related_constant (curpos,

16078

- round_up (last_pos, align));

16079

+ align = scale_by_factor_of (offset, align);

16080

+ last_pos = round_up (last_pos, align);

16081

+ pos = compute_related_constant (curpos, last_pos);

16082

}

16083

- else if (!pos && TREE_CODE (curpos) == PLUS_EXPR

16084

- && TREE_CODE (TREE_OPERAND (curpos, 1)) == INTEGER_CST

16085

+ else if (!pos

16086

+ && TREE_CODE (curpos) == PLUS_EXPR

16087

+ && host_integerp (TREE_OPERAND (curpos, 1), 1)

16088

&& TREE_CODE (TREE_OPERAND (curpos, 0)) == MULT_EXPR

16089

- && host_integerp (TREE_OPERAND

16090

- (TREE_OPERAND (curpos, 0), 1),

16091

- 1))

16092

+ && host_integerp

16093

+ (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1))

16094

{

16095

+ tree offset = TREE_OPERAND (TREE_OPERAND (curpos, 0), 0);

16096

+ unsigned HOST_WIDE_INT addend

16097

+ = tree_low_cst (TREE_OPERAND (curpos, 1), 1);

16098

align

16099

- = tree_low_cst

16100

- (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1);

16101

- pos = compute_related_constant (curpos,

16102

- round_up (last_pos, align));

16103

+ = tree_low_cst (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1);

16104

+ align = scale_by_factor_of (offset, align);

16105

+ align = MIN (align, addend & -addend);

16106

+ last_pos = round_up (last_pos, align);

16107

+ pos = compute_related_constant (curpos, last_pos);

16108

}

16109

- else if (potential_alignment_gap (prev_old_field, old_field,

16110

- pos))

16111

+ else if (potential_alignment_gap (prev_old_field, old_field, pos))

16112

{

16113

align = TYPE_ALIGN (field_type);

16114

- pos = compute_related_constant (curpos,

16115

- round_up (last_pos, align));

16116

+ last_pos = round_up (last_pos, align);

16117

+ pos = compute_related_constant (curpos, last_pos);

16118

}

16119

16120

/* If we can't compute a position, set it to zero.

16121

16122

- ??? We really should abort here, but it's too much work

16123

- to get this correct for all cases. */

16124

-

16125

+ ??? We really should abort here, but it's too much work

16126

+ to get this correct for all cases. */

16127

if (!pos)

16128

pos = bitsize_zero_node;

16129

16130

@@ -2553,6 +2551,32 @@

16131

return false;

16132

}

16133

16134

+/* Return VALUE scaled by the biggest power-of-2 factor of EXPR. */

16135

+

16136

+static unsigned int

16137

+scale_by_factor_of (tree expr, unsigned int value)

16138

+{

16139

+ expr = remove_conversions (expr, true);

16140

+

16141

+ /* An expression which is a bitwise AND with a mask has a power-of-2 factor

16142

+ corresponding to the number of trailing zeros of the mask. */

16143

+ if (TREE_CODE (expr) == BIT_AND_EXPR

16144

+ && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)

16145

+ {

16146

+ unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (TREE_OPERAND (expr, 1));

16147

+ unsigned int i = 0;

16148

+

16149

+ while ((mask & 1) == 0 && i < HOST_BITS_PER_WIDE_INT)

16150

+ {

16151

+ mask >>= 1;

16152

+ value *= 2;

16153

+ i++;

16154

+ }

16155

+ }

16156

+

16157

+ return value;

16158

+}

16159

+

16160

/* Given two consecutive field decls PREV_FIELD and CURR_FIELD, return true

16161

unless we can prove these 2 fields are laid out in such a way that no gap

16162

exist between the end of PREV_FIELD and the beginning of CURR_FIELD. OFFSET

16163

Index: gcc/ada/gcc-interface/Makefile.in

16164

===================================================================

16165

--- a/src/gcc/ada/gcc-interface/Makefile.in (.../tags/gcc_4_8_2_release)

16166

+++ b/src/gcc/ada/gcc-interface/Makefile.in (.../branches/gcc-4_8-branch)

16167

@@ -2397,7 +2397,7 @@

16168

"GNATLINK=$(GNATLINK)" \

16169

"GNATBIND=$(GNATBIND)"

16170

16171

-GCC_LINK=$(CC) $(GCC_LINK_FLAGS) $(ADA_INCLUDES)

16172

+GCC_LINK=$(CC) $(GCC_LINK_FLAGS) $(ADA_INCLUDES) $(LDFLAGS)

16173

16174

# Build directory for the tools. Let's copy the target-dependent

16175

# sources using the same mechanism as for gnatlib. The other sources are

16176

@@ -2519,12 +2519,10 @@

16177

16178

# Likewise for the tools

16179

../../gnatmake$(exeext): $(P) b_gnatm.o link.o targext.o $(GNATMAKE_OBJS)

16180

- $(GCC_LINK) $(ALL_CFLAGS) $(LDFLAGS) -o $@ b_gnatm.o $(GNATMAKE_OBJS) \

16181

- $(TOOLS_LIBS)

16182

+ +$(GCC_LINK) $(ALL_CFLAGS) -o $@ b_gnatm.o $(GNATMAKE_OBJS) $(TOOLS_LIBS)

16183

16184

../../gnatlink$(exeext): $(P) b_gnatl.o link.o targext.o $(GNATLINK_OBJS)

16185

- $(GCC_LINK) $(ALL_CFLAGS) $(LDFLAGS) -o $@ b_gnatl.o $(GNATLINK_OBJS) \

16186

- $(TOOLS_LIBS)

16187

+ +$(GCC_LINK) $(ALL_CFLAGS) -o $@ b_gnatl.o $(GNATLINK_OBJS) $(TOOLS_LIBS)

16188

16189

../stamp-gnatlib-$(RTSDIR):

16190

@if [ ! -f stamp-gnatlib-$(RTSDIR) ] ; \

16191

Index: gcc/ada/gcc-interface/Make-lang.in

16192

===================================================================

16193

--- a/src/gcc/ada/gcc-interface/Make-lang.in (.../tags/gcc_4_8_2_release)

16194

+++ b/src/gcc/ada/gcc-interface/Make-lang.in (.../branches/gcc-4_8-branch)

16195

@@ -625,7 +625,7 @@

16196

ada/doctools/xgnatugn$(build_exeext): ada/xgnatugn.adb

16197

-$(MKDIR) ada/doctools

16198

$(CP) $^ ada/doctools

16199

- cd ada/doctools && $(GNATMAKE) -q xgnatugn

16200

+ cd ada/doctools && gnatmake -q xgnatugn

16201

16202

# Note that doc/gnat_ugn.texi and doc/projects.texi do not depend on

16203

# xgnatugn being built so we can distribute a pregenerated doc/gnat_ugn.info

16204

Index: gcc/fortran/interface.c

16205

===================================================================

16206

--- a/src/gcc/fortran/interface.c (.../tags/gcc_4_8_2_release)

16207

+++ b/src/gcc/fortran/interface.c (.../branches/gcc-4_8-branch)

16208

@@ -1245,7 +1245,8 @@

16209

return FAILURE;

16210

}

16211

16212

- if (r1->ts.u.cl->length)

16213

+ if (s1->ts.u.cl && s1->ts.u.cl->length

16214

+ && s2->ts.u.cl && s2->ts.u.cl->length)

16215

{

16216

int compval = gfc_dep_compare_expr (r1->ts.u.cl->length,

16217

r2->ts.u.cl->length);

16218

@@ -1367,8 +1368,8 @@

16219

if (s1->attr.function && s2->attr.function)

16220

{

16221

/* If both are functions, check result characteristics. */

16222

- if (check_result_characteristics (s1, s2, errmsg, err_len)

16223

- == FAILURE)

16224

+ if (check_result_characteristics (s1, s2, errmsg, err_len) == FAILURE

16225

+ || check_result_characteristics (s2, s1, errmsg, err_len) == FAILURE)

16226

return 0;

16227

}

16228

16229

Index: gcc/fortran/trans-expr.c

16230

===================================================================

16231

--- a/src/gcc/fortran/trans-expr.c (.../tags/gcc_4_8_2_release)

16232

+++ b/src/gcc/fortran/trans-expr.c (.../branches/gcc-4_8-branch)

16233

@@ -670,7 +670,6 @@

16234

gfc_add_modify (&parmse->post, vptr,

16235

fold_convert (TREE_TYPE (vptr), ctree));

16236

16237

- gcc_assert (!optional || (optional && !copyback));

16238

if (optional)

16239

{

16240

tree tmp2;

16241

Index: gcc/fortran/class.c

16242

===================================================================

16243

--- a/src/gcc/fortran/class.c (.../tags/gcc_4_8_2_release)

16244

+++ b/src/gcc/fortran/class.c (.../branches/gcc-4_8-branch)

16245

@@ -2486,7 +2486,7 @@

16246

return NULL;

16247

16248

/* Sometimes the typespec is passed from a single call. */

16249

- if (ts->type == BT_DERIVED)

16250

+ if (ts->type == BT_DERIVED || ts->type == BT_CLASS)

16251

return gfc_find_derived_vtab (ts->u.derived);

16252

16253

/* Find the top-level namespace. */

16254

Index: gcc/fortran/decl.c

16255

===================================================================

16256

--- a/src/gcc/fortran/decl.c (.../tags/gcc_4_8_2_release)

16257

+++ b/src/gcc/fortran/decl.c (.../branches/gcc-4_8-branch)

16258

@@ -7384,6 +7384,7 @@

16259

16260

16261

/* Check a derived type that is being extended. */

16262

+

16263

static gfc_symbol*

16264

check_extended_derived_type (char *name)

16265

{

16266

@@ -7395,14 +7396,15 @@

16267

return NULL;

16268

}

16269

16270

+ extended = gfc_find_dt_in_generic (extended);

16271

+

16272

+ /* F08:C428. */

16273

if (!extended)

16274

{

16275

- gfc_error ("No such symbol in TYPE definition at %C");

16276

+ gfc_error ("Symbol '%s' at %C has not been previously defined", name);

16277

return NULL;

16278

}

16279

16280

- extended = gfc_find_dt_in_generic (extended);

16281

-

16282

if (extended->attr.flavor != FL_DERIVED)

16283

{

16284

gfc_error ("'%s' in EXTENDS expression at %C is not a "

16285

Index: gcc/fortran/dump-parse-tree.c

16286

===================================================================

16287

--- a/src/gcc/fortran/dump-parse-tree.c (.../tags/gcc_4_8_2_release)

16288

+++ b/src/gcc/fortran/dump-parse-tree.c (.../branches/gcc-4_8-branch)

16289

@@ -110,7 +110,8 @@

16290

break;

16291

16292

case BT_CHARACTER:

16293

- show_expr (ts->u.cl->length);

16294

+ if (ts->u.cl)

16295

+ show_expr (ts->u.cl->length);

16296

fprintf(dumpfile, " %d", ts->kind);

16297

break;

16298

16299

Index: gcc/fortran/ChangeLog

16300

===================================================================

16301

--- a/src/gcc/fortran/ChangeLog (.../tags/gcc_4_8_2_release)

16302

+++ b/src/gcc/fortran/ChangeLog (.../branches/gcc-4_8-branch)

16303

@@ -1,3 +1,89 @@

16304

+2014-01-11 Janus Weil <janus@gcc.gnu.org>

16305

+

16306

+ Backport from mainline

16307

+ 2013-12-29 Janus Weil <janus@gcc.gnu.org>

16308

+

16309

+ PR fortran/59612

16310

+ PR fortran/57042

16311

+ * dump-parse-tree.c (show_typespec): Check for charlen.

16312

+ * invoke.texi: Fix documentation of -fdump-fortran-optimized and

16313

+ -fdump-parse-tree.

16314

+

16315

+2014-01-04 Janus Weil <janus@gcc.gnu.org>

16316

+

16317

+ Backport from mainline

16318

+ 2014-01-02 Janus Weil <janus@gcc.gnu.org>

16319

+

16320

+ PR fortran/59654

16321

+ * resolve.c (resolve_typebound_procedures): No need to create the vtab

16322

+ here.

16323

+

16324

+2013-12-31 Janus Weil <janus@gcc.gnu.org>

16325

+

16326

+ Backport from mainline

16327

+ 2013-12-30 Janus Weil <janus@gcc.gnu.org>

16328

+

16329

+ PR fortran/58998

16330

+ * resolve.c (resolve_symbol): Check that symbol is not only flavorless

16331

+ but also untyped.

16332

+

16333

+2013-12-18 Janus Weil <janus@gcc.gnu.org>

16334

+

16335

+ Backport from mainline

16336

+ 2013-12-15 Janus Weil <janus@gcc.gnu.org>

16337

+

16338

+ PR fortran/59493

16339

+ * class.c (gfc_find_intrinsic_vtab): Handle BT_CLASS.

16340

+

16341

+2013-11-30 Paul Thomas <pault@gcc.gnu.org>

16342

+

16343

+ Backport from mainline

16344

+ 2013-11-04 Paul Thomas <pault@gcc.gnu.org>

16345

+

16346

+ PR fortran/57445

16347

+ * trans-expr.c (gfc_conv_class_to_class): Remove spurious

16348

+ assert.

16349

+

16350

+2013-11-17 Janus Weil <janus@gcc.gnu.org>

16351

+

16352

+ Backport from mainline

16353

+ 2013-11-07 Janus Weil <janus@gcc.gnu.org>

16354

+

16355

+ PR fortran/58471

16356

+ * primary.c (gfc_expr_attr): Check for result symbol.

16357

+

16358

+2013-11-16 Janus Weil <janus@gcc.gnu.org>

16359

+

16360

+ Backport from mainline

16361

+ 2013-09-20 Janus Weil <janus@gcc.gnu.org>

16362

+

16363

+ PR fortran/58099

16364

+ * expr.c (gfc_check_pointer_assign): Remove second call to

16365

+ 'gfc_compare_interfaces' with swapped arguments.

16366

+ * interface.c (gfc_compare_interfaces): Symmetrize the call to

16367

+ 'check_result_characteristics' by calling it with swapped arguments.

16368

+

16369

+2013-11-16 Paul Thomas <pault@gcc.gnu.org>

16370

+

16371

+ PR fortran/58771

16372

+ * trans-io.c (transfer_expr): If the backend_decl for a derived

16373

+ type is missing, build it with gfc_typenode_for_spec.

16374

+

16375

+2013-11-05 Steven G. Kargl <kargl@gcc.gnu.org>

16376

+

16377

+ PR fortran/58989

16378

+ * check.c (gfc_check_reshape): ensure that shape is a constant

16379

+ expression.

16380

+

16381

+2013-11-02 Janus Weil <janus@gcc.gnu.org>

16382

+

16383

+ Backport from mainline

16384

+ 2013-09-23 Janus Weil <janus@gcc.gnu.org>

16385

+

16386

+ PR fortran/58355

16387

+ * decl.c (check_extended_derived_type): Prevent segfault, modify error

16388

+ message.

16389

+

16390

2013-10-16 Release Manager

16391

16392

* GCC 4.8.2 released.

16393

Index: gcc/fortran/expr.c

16394

===================================================================

16395

--- a/src/gcc/fortran/expr.c (.../tags/gcc_4_8_2_release)

16396

+++ b/src/gcc/fortran/expr.c (.../branches/gcc-4_8-branch)

16397

@@ -3555,14 +3555,6 @@

16398

return FAILURE;

16399

}

16400

16401

- if (!gfc_compare_interfaces (s2, s1, name, 0, 1,

16402

- err, sizeof(err), NULL, NULL))

16403

- {

16404

- gfc_error ("Interface mismatch in procedure pointer assignment "

16405

- "at %L: %s", &rvalue->where, err);

16406

- return FAILURE;

16407

- }

16408

-

16409

return SUCCESS;

16410

}

16411

16412

Index: gcc/fortran/resolve.c

16413

===================================================================

16414

--- a/src/gcc/fortran/resolve.c (.../tags/gcc_4_8_2_release)

16415

+++ b/src/gcc/fortran/resolve.c (.../branches/gcc-4_8-branch)

16416

@@ -12425,9 +12425,6 @@

16417

resolve_bindings_derived = derived;

16418

resolve_bindings_result = SUCCESS;

16419

16420

- /* Make sure the vtab has been generated. */

16421

- gfc_find_derived_vtab (derived);

16422

-

16423

if (derived->f2k_derived->tb_sym_root)

16424

gfc_traverse_symtree (derived->f2k_derived->tb_sym_root,

16425

&resolve_typebound_procedure);

16426

@@ -13256,7 +13253,8 @@

16427

if (sym->attr.flavor == FL_UNKNOWN

16428

|| (sym->attr.flavor == FL_PROCEDURE && !sym->attr.intrinsic

16429

&& !sym->attr.generic && !sym->attr.external

16430

- && sym->attr.if_source == IFSRC_UNKNOWN))

16431

+ && sym->attr.if_source == IFSRC_UNKNOWN

16432

+ && sym->ts.type == BT_UNKNOWN))

16433

{

16434

16435

/* If we find that a flavorless symbol is an interface in one of the

16436

Index: gcc/fortran/trans-io.c

16437

===================================================================

16438

--- a/src/gcc/fortran/trans-io.c (.../tags/gcc_4_8_2_release)

16439

+++ b/src/gcc/fortran/trans-io.c (.../branches/gcc-4_8-branch)

16440

@@ -243,16 +243,16 @@

16441

16442

/* The code to generate the error. */

16443

gfc_start_block (&block);

16444

-

16445

+

16446

arg1 = gfc_build_addr_expr (NULL_TREE, var);

16447

-

16448

+

16449

arg2 = build_int_cst (integer_type_node, error_code),

16450

-

16451

+

16452

asprintf (&message, "%s", _(msgid));

16453

arg3 = gfc_build_addr_expr (pchar_type_node,

16454

gfc_build_localized_cstring_const (message));

16455

free (message);

16456

-

16457

+

16458

tmp = build_call_expr_loc (input_location,

16459

gfor_fndecl_generate_error, 3, arg1, arg2, arg3);

16460

16461

@@ -521,7 +521,7 @@

16462

gfc_trans_io_runtime_check (cond, var, LIBERROR_BAD_UNIT,

16463

"Unit number in I/O statement too small",

16464

&se.pre);

16465

-

16466

+

16467

/* UNIT numbers should be less than the max. */

16468

val = gfc_conv_mpz_to_tree (gfc_integer_kinds[i].huge, 4);

16469

cond = fold_build2_loc (input_location, GT_EXPR, boolean_type_node,

16470

@@ -1000,7 +1000,7 @@

16471

if (p->convert)

16472

mask |= set_string (&block, &post_block, var, IOPARM_open_convert,

16473

p->convert);

16474

-

16475

+

16476

if (p->newunit)

16477

mask |= set_parameter_ref (&block, &post_block, var, IOPARM_open_newunit,

16478

p->newunit);

16479

@@ -1234,7 +1234,7 @@

16480

{

16481

mask |= set_parameter_ref (&block, &post_block, var, IOPARM_inquire_exist,

16482

p->exist);

16483

-

16484

+

16485

if (p->unit && !p->iostat)

16486

{

16487

p->iostat = create_dummy_iostat ();

16488

@@ -1322,7 +1322,7 @@

16489

if (p->pad)

16490

mask |= set_string (&block, &post_block, var, IOPARM_inquire_pad,

16491

p->pad);

16492

-

16493

+

16494

if (p->convert)

16495

mask |= set_string (&block, &post_block, var, IOPARM_inquire_convert,

16496

p->convert);

16497

@@ -1547,7 +1547,7 @@

16498

tree dtype;

16499

tree dt_parm_addr;

16500

tree decl = NULL_TREE;

16501

- int n_dim;

16502

+ int n_dim;

16503

int itype;

16504

int rank = 0;

16505

16506

@@ -2032,7 +2032,7 @@

16507

if (gfc_notification_std (GFC_STD_GNU) != SILENT)

16508

{

16509

gfc_error_now ("Derived type '%s' at %L has PRIVATE components",

16510

- ts->u.derived->name, code != NULL ? &(code->loc) :

16511

+ ts->u.derived->name, code != NULL ? &(code->loc) :

16512

&gfc_current_locus);

16513

return;

16514

}

16515

@@ -2041,7 +2041,7 @@

16516

ts->kind = ts->u.derived->ts.kind;

16517

ts->f90_type = ts->u.derived->ts.f90_type;

16518

}

16519

-

16520

+

16521

kind = ts->kind;

16522

function = NULL;

16523

arg2 = NULL;

16524

@@ -2123,7 +2123,7 @@

16525

function = iocall[IOCALL_X_CHARACTER_WIDE];

16526

else

16527

function = iocall[IOCALL_X_CHARACTER_WIDE_WRITE];

16528

-

16529

+

16530

tmp = gfc_build_addr_expr (NULL_TREE, dt_parm);

16531

tmp = build_call_expr_loc (input_location,

16532

function, 4, tmp, addr_expr, arg2, arg3);

16533

@@ -2158,6 +2158,12 @@

16534

expr = build_fold_indirect_ref_loc (input_location,

16535

expr);

16536

16537

+ /* Make sure that the derived type has been built. An external

16538

+ function, if only referenced in an io statement requires this

16539

+ check (see PR58771). */

16540

+ if (ts->u.derived->backend_decl == NULL_TREE)

16541

+ tmp = gfc_typenode_for_spec (ts);

16542

+

16543

for (c = ts->u.derived->components; c; c = c->next)

16544

{

16545

field = c->backend_decl;

16546

Index: gcc/fortran/check.c

16547

===================================================================

16548

--- a/src/gcc/fortran/check.c (.../tags/gcc_4_8_2_release)

16549

+++ b/src/gcc/fortran/check.c (.../branches/gcc-4_8-branch)

16550

@@ -3208,7 +3208,7 @@

16551

"than %d elements", &shape->where, GFC_MAX_DIMENSIONS);

16552

return FAILURE;

16553

}

16554

- else if (shape->expr_type == EXPR_ARRAY)

16555

+ else if (shape->expr_type == EXPR_ARRAY && gfc_is_constant_expr (shape))

16556

{

16557

gfc_expr *e;

16558

int i, extent;

16559

Index: gcc/fortran/primary.c

16560

===================================================================

16561

--- a/src/gcc/fortran/primary.c (.../tags/gcc_4_8_2_release)

16562

+++ b/src/gcc/fortran/primary.c (.../branches/gcc-4_8-branch)

16563

@@ -2252,7 +2252,7 @@

16564

case EXPR_FUNCTION:

16565

gfc_clear_attr (&attr);

16566

16567

- if (e->value.function.esym != NULL)

16568

+ if (e->value.function.esym && e->value.function.esym->result)

16569

{

16570

gfc_symbol *sym = e->value.function.esym->result;

16571

attr = sym->attr;

16572

Index: gcc/configure.ac

16573

===================================================================

16574

--- a/src/gcc/configure.ac (.../tags/gcc_4_8_2_release)

16575

+++ b/src/gcc/configure.ac (.../branches/gcc-4_8-branch)

16576

@@ -1516,13 +1516,11 @@

16577

/* | [A-Za-z]:[\\/]* ) realsrcdir=${srcdir};;

16578

*) realsrcdir=../${srcdir};;

16579

esac

16580

- saved_CFLAGS="${CFLAGS}"

16581

CC="${CC_FOR_BUILD}" CFLAGS="${CFLAGS_FOR_BUILD}" \

16582

- LDFLAGS="${LDFLAGS_FOR_BUILD}" \

16583

+ LDFLAGS="${LDFLAGS_FOR_BUILD}" GMPINC="" \

16584

${realsrcdir}/configure \

16585

--enable-languages=${enable_languages-all} \

16586

--target=$target_alias --host=$build_alias --build=$build_alias

16587

- CFLAGS="${saved_CFLAGS}"

16588

16589

# We just finished tests for the build machine, so rename

16590

# the file auto-build.h in the gcc directory.

16591

@@ -1887,6 +1885,7 @@

16592

if test x$build != x$host || test "x$coverage_flags" != x

16593

then

16594

BUILD_CFLAGS='$(INTERNAL_CFLAGS) $(T_CFLAGS) $(CFLAGS_FOR_BUILD)'

16595

+ BUILD_CXXFLAGS='$(INTERNAL_CFLAGS) $(T_CFLAGS) $(CXXFLAGS_FOR_BUILD)'

16596

BUILD_LDFLAGS='$(LDFLAGS_FOR_BUILD)'

16597

fi

16598

16599

@@ -3611,6 +3610,19 @@

16600

kasumi_fi_xor %f46, %f48, %f50, %f52],,

16601

[AC_DEFINE(HAVE_AS_SPARC4, 1,

16602

[Define if your assembler supports SPARC4 instructions.])])

16603

+

16604

+ gcc_GAS_CHECK_FEATURE([LEON instructions],

16605

+ gcc_cv_as_sparc_leon,,

16606

+ [-Aleon],

16607

+ [.text

16608

+ .register %g2, #scratch

16609

+ .register %g3, #scratch

16610

+ .align 4

16611

+ smac %g2, %g3, %g1

16612

+ umac %g2, %g3, %g1

16613

+ cas [[%g2]], %g3, %g1],,

16614

+ [AC_DEFINE(HAVE_AS_LEON, 1,

16615

+ [Define if your assembler supports LEON instructions.])])

16616

;;

16617

16618

changequote(,)dnl

16619

@@ -5193,15 +5205,15 @@

16620

AC_MSG_CHECKING([for exported symbols])

16621

if test "x$export_sym_check" != x; then

16622

echo "int main() {return 0;} int foobar() {return 0;}" > conftest.c

16623

- ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest > /dev/null 2>&1

16624

- if $export_sym_check conftest | grep foobar > /dev/null; then

16625

+ ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest$ac_exeext > /dev/null 2>&1

16626

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

16627

: # No need to use a flag

16628

AC_MSG_RESULT([yes])

16629

else

16630

AC_MSG_RESULT([yes])

16631

AC_MSG_CHECKING([for -rdynamic])

16632

- ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest > /dev/null 2>&1

16633

- if $export_sym_check conftest | grep foobar > /dev/null; then

16634

+ ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest$ac_exeext > /dev/null 2>&1

16635

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

16636

plugin_rdynamic=yes

16637

pluginlibs="-rdynamic"

16638

else

16639

Index: gcc/print-rtl.c

16640

===================================================================

16641

--- a/src/gcc/print-rtl.c (.../tags/gcc_4_8_2_release)

16642

+++ b/src/gcc/print-rtl.c (.../branches/gcc-4_8-branch)

16643

@@ -582,6 +582,8 @@

16644

16645

if (MEM_EXPR (in_rtx))

16646

print_mem_expr (outfile, MEM_EXPR (in_rtx));

16647

+ else

16648

+ fputc (' ', outfile);

16649

16650

if (MEM_OFFSET_KNOWN_P (in_rtx))

16651

fprintf (outfile, "+" HOST_WIDE_INT_PRINT_DEC, MEM_OFFSET (in_rtx));

16652

Index: gcc/ipa-split.c

16653

===================================================================

16654

--- a/src/gcc/ipa-split.c (.../tags/gcc_4_8_2_release)

16655

+++ b/src/gcc/ipa-split.c (.../branches/gcc-4_8-branch)

16656

@@ -136,7 +136,7 @@

16657

variable, check it if it is present in bitmap passed via DATA. */

16658

16659

static bool

16660

-test_nonssa_use (gimple stmt ATTRIBUTE_UNUSED, tree t, void *data)

16661

+test_nonssa_use (gimple, tree t, tree, void *data)

16662

{

16663

t = get_base_address (t);

16664

16665

@@ -229,7 +229,7 @@

16666

}

16667

if (gimple_code (stmt) == GIMPLE_LABEL

16668

&& test_nonssa_use (stmt, gimple_label_label (stmt),

16669

- non_ssa_vars))

16670

+ NULL_TREE, non_ssa_vars))

16671

{

16672

ok = false;

16673

goto done;

16674

@@ -258,7 +258,7 @@

16675

if (virtual_operand_p (gimple_phi_result (stmt)))

16676

continue;

16677

if (TREE_CODE (op) != SSA_NAME

16678

- && test_nonssa_use (stmt, op, non_ssa_vars))

16679

+ && test_nonssa_use (stmt, op, op, non_ssa_vars))

16680

{

16681

ok = false;

16682

goto done;

16683

@@ -670,7 +670,7 @@

16684

Return true when access to T prevents splitting the function. */

16685

16686

static bool

16687

-mark_nonssa_use (gimple stmt ATTRIBUTE_UNUSED, tree t, void *data)

16688

+mark_nonssa_use (gimple, tree t, tree, void *data)

16689

{

16690

t = get_base_address (t);

16691

16692

@@ -830,7 +830,7 @@

16693

if (TREE_CODE (op) == SSA_NAME)

16694

bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op));

16695

else

16696

- can_split &= !mark_nonssa_use (stmt, op, non_ssa_vars);

16697

+ can_split &= !mark_nonssa_use (stmt, op, op, non_ssa_vars);

16698

}

16699

}

16700

return can_split;

16701

Index: gcc/alias.c

16702

===================================================================

16703

--- a/src/gcc/alias.c (.../tags/gcc_4_8_2_release)

16704

+++ b/src/gcc/alias.c (.../branches/gcc-4_8-branch)

16705

@@ -2871,17 +2871,14 @@

16706

/* Wipe the reg_seen array clean. */

16707

bitmap_clear (reg_seen);

16708

16709

- /* Mark all hard registers which may contain an address.

16710

- The stack, frame and argument pointers may contain an address.

16711

- An argument register which can hold a Pmode value may contain

16712

- an address even if it is not in BASE_REGS.

16713

+ /* Initialize the alias information for this pass. */

16714

+ for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)

16715

+ if (static_reg_base_value[i])

16716

+ {

16717

+ new_reg_base_value[i] = static_reg_base_value[i];

16718

+ bitmap_set_bit (reg_seen, i);

16719

+ }

16720

16721

- The address expression is VOIDmode for an argument and

16722

- Pmode for other registers. */

16723

-

16724

- memcpy (new_reg_base_value, static_reg_base_value,

16725

- FIRST_PSEUDO_REGISTER * sizeof (rtx));

16726

-

16727

/* Walk the insns adding values to the new_reg_base_value array. */

16728

for (i = 0; i < rpo_cnt; i++)

16729

{

16730

Index: gcc/tree-vect-loop.c

16731

===================================================================

16732

--- a/src/gcc/tree-vect-loop.c (.../tags/gcc_4_8_2_release)

16733

+++ b/src/gcc/tree-vect-loop.c (.../branches/gcc-4_8-branch)

16734

@@ -1537,7 +1537,7 @@

16735

16736

if (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)

16737

|| LOOP_VINFO_INT_NITERS (loop_vinfo) % vectorization_factor != 0

16738

- || LOOP_PEELING_FOR_ALIGNMENT (loop_vinfo))

16739

+ || LOOP_VINFO_PEELING_FOR_GAPS (loop_vinfo))

16740

{

16741

if (dump_enabled_p ())

16742

dump_printf_loc (MSG_NOTE, vect_location, "epilog loop required.");

16743

@@ -3115,14 +3115,12 @@

16744

stmt_vec_info stmt_vinfo = vinfo_for_stmt (iv_phi);

16745

loop_vec_info loop_vinfo = STMT_VINFO_LOOP_VINFO (stmt_vinfo);

16746

struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo);

16747

- tree scalar_type;

16748

tree vectype;

16749

int nunits;

16750

edge pe = loop_preheader_edge (loop);

16751

struct loop *iv_loop;

16752

basic_block new_bb;

16753

tree new_vec, vec_init, vec_step, t;

16754

- tree access_fn;

16755

tree new_var;

16756

tree new_name;

16757

gimple init_stmt, induction_phi, new_stmt;

16758

@@ -3130,7 +3128,6 @@

16759

tree init_expr, step_expr;

16760

int vf = LOOP_VINFO_VECT_FACTOR (loop_vinfo);

16761

int i;

16762

- bool ok;

16763

int ncopies;

16764

tree expr;

16765

stmt_vec_info phi_info = vinfo_for_stmt (iv_phi);

16766

@@ -3159,16 +3156,14 @@

16767

latch_e = loop_latch_edge (iv_loop);

16768

loop_arg = PHI_ARG_DEF_FROM_EDGE (iv_phi, latch_e);

16769

16770

- access_fn = analyze_scalar_evolution (iv_loop, PHI_RESULT (iv_phi));

16771

- gcc_assert (access_fn);

16772

- STRIP_NOPS (access_fn);

16773

- ok = vect_is_simple_iv_evolution (iv_loop->num, access_fn,

16774

- &init_expr, &step_expr);

16775

- gcc_assert (ok);

16776

+ step_expr = STMT_VINFO_LOOP_PHI_EVOLUTION_PART (phi_info);

16777

+ gcc_assert (step_expr != NULL_TREE);

16778

+

16779

pe = loop_preheader_edge (iv_loop);

16780

+ init_expr = PHI_ARG_DEF_FROM_EDGE (iv_phi,

16781

+ loop_preheader_edge (iv_loop));

16782

16783

- scalar_type = TREE_TYPE (init_expr);

16784

- vectype = get_vectype_for_scalar_type (scalar_type);

16785

+ vectype = get_vectype_for_scalar_type (TREE_TYPE (init_expr));

16786

resvectype = get_vectype_for_scalar_type (TREE_TYPE (PHI_RESULT (iv_phi)));

16787

gcc_assert (vectype);

16788

nunits = TYPE_VECTOR_SUBPARTS (vectype);

16789

@@ -3177,6 +3172,16 @@

16790

gcc_assert (phi_info);

16791

gcc_assert (ncopies >= 1);

16792

16793

+ /* Convert the step to the desired type. */

16794

+ step_expr = force_gimple_operand (fold_convert (TREE_TYPE (vectype),

16795

+ step_expr),

16796

+ &stmts, true, NULL_TREE);

16797

+ if (stmts)

16798

+ {

16799

+ new_bb = gsi_insert_seq_on_edge_immediate (pe, stmts);

16800

+ gcc_assert (!new_bb);

16801

+ }

16802

+

16803

/* Find the first insertion point in the BB. */

16804

si = gsi_after_labels (bb);

16805

16806

@@ -3186,9 +3191,7 @@

16807

/* iv_loop is nested in the loop to be vectorized. init_expr had already

16808

been created during vectorization of previous stmts. We obtain it

16809

from the STMT_VINFO_VEC_STMT of the defining stmt. */

16810

- tree iv_def = PHI_ARG_DEF_FROM_EDGE (iv_phi,

16811

- loop_preheader_edge (iv_loop));

16812

- vec_init = vect_get_vec_def_for_operand (iv_def, iv_phi, NULL);

16813

+ vec_init = vect_get_vec_def_for_operand (init_expr, iv_phi, NULL);

16814

/* If the initial value is not of proper type, convert it. */

16815

if (!useless_type_conversion_p (vectype, TREE_TYPE (vec_init)))

16816

{

16817

@@ -3211,8 +3214,11 @@

16818

16819

/* iv_loop is the loop to be vectorized. Create:

16820

vec_init = [X, X+S, X+2*S, X+3*S] (S = step_expr, X = init_expr) */

16821

- new_var = vect_get_new_vect_var (scalar_type, vect_scalar_var, "var_");

16822

- new_name = force_gimple_operand (init_expr, &stmts, false, new_var);

16823

+ new_var = vect_get_new_vect_var (TREE_TYPE (vectype),

16824

+ vect_scalar_var, "var_");

16825

+ new_name = force_gimple_operand (fold_convert (TREE_TYPE (vectype),

16826

+ init_expr),

16827

+ &stmts, false, new_var);

16828

if (stmts)

16829

{

16830

new_bb = gsi_insert_seq_on_edge_immediate (pe, stmts);

16831

@@ -3224,9 +3230,7 @@

16832

for (i = 1; i < nunits; i++)

16833

{

16834

/* Create: new_name_i = new_name + step_expr */

16835

- enum tree_code code = POINTER_TYPE_P (scalar_type)

16836

- ? POINTER_PLUS_EXPR : PLUS_EXPR;

16837

- init_stmt = gimple_build_assign_with_ops (code, new_var,

16838

+ init_stmt = gimple_build_assign_with_ops (PLUS_EXPR, new_var,

16839

new_name, step_expr);

16840

new_name = make_ssa_name (new_var, init_stmt);

16841

gimple_assign_set_lhs (init_stmt, new_name);

16842

Index: gcc/lra-coalesce.c

16843

===================================================================

16844

--- a/src/gcc/lra-coalesce.c (.../tags/gcc_4_8_2_release)

16845

+++ b/src/gcc/lra-coalesce.c (.../branches/gcc-4_8-branch)

16846

@@ -221,9 +221,12 @@

16847

basic_block bb;

16848

rtx mv, set, insn, next, *sorted_moves;

16849

int i, mv_num, sregno, dregno;

16850

+ unsigned int regno;

16851

int coalesced_moves;

16852

int max_regno = max_reg_num ();

16853

bitmap_head involved_insns_bitmap;

16854

+ bitmap_head result_pseudo_vals_bitmap;

16855

+ bitmap_iterator bi;

16856

16857

timevar_push (TV_LRA_COALESCE);

16858

16859

@@ -318,6 +321,34 @@

16860

}

16861

}

16862

}

16863

+ /* If we have situation after inheritance pass:

16864

+

16865

+ r1 <- ... insn originally setting p1

16866

+ i1 <- r1 setting inheritance i1 from reload r1

16867

+ ...

16868

+ ... <- ... p2 ... dead p2

16869

+ ..

16870

+ p1 <- i1

16871

+ r2 <- i1

16872

+ ...<- ... r2 ...

16873

+

16874

+ And we are coalescing p1 and p2 using p1. In this case i1 and p1

16875

+ should have different values, otherwise they can get the same

16876

+ hard reg and this is wrong for insn using p2 before coalescing.

16877

+ So invalidate such inheritance pseudo values. */

16878

+ bitmap_initialize (&result_pseudo_vals_bitmap, &reg_obstack);

16879

+ EXECUTE_IF_SET_IN_BITMAP (&coalesced_pseudos_bitmap, 0, regno, bi)

16880

+ bitmap_set_bit (&result_pseudo_vals_bitmap,

16881

+ lra_reg_info[first_coalesced_pseudo[regno]].val);

16882

+ EXECUTE_IF_SET_IN_BITMAP (&lra_inheritance_pseudos, 0, regno, bi)

16883

+ if (bitmap_bit_p (&result_pseudo_vals_bitmap, lra_reg_info[regno].val))

16884

+ {

16885

+ lra_set_regno_unique_value (regno);

16886

+ if (lra_dump_file != NULL)

16887

+ fprintf (lra_dump_file,

16888

+ " Make unique value for inheritance r%d\n", regno);

16889

+ }

16890

+ bitmap_clear (&result_pseudo_vals_bitmap);

16891

bitmap_clear (&used_pseudos_bitmap);

16892

bitmap_clear (&involved_insns_bitmap);

16893

bitmap_clear (&coalesced_pseudos_bitmap);

16894

Index: gcc/gimplify.c

16895

===================================================================

16896

--- a/src/gcc/gimplify.c (.../tags/gcc_4_8_2_release)

16897

+++ b/src/gcc/gimplify.c (.../branches/gcc-4_8-branch)

16898

@@ -2060,6 +2060,9 @@

16899

/* Nonlocal VLAs seen in the current function. */

16900

static struct pointer_set_t *nonlocal_vlas;

16901

16902

+/* The VAR_DECLs created for nonlocal VLAs for debug info purposes. */

16903

+static tree nonlocal_vla_vars;

16904

+

16905

/* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a

16906

DECL_VALUE_EXPR, and it's worth re-examining things. */

16907

16908

@@ -2106,14 +2109,13 @@

16909

ctx = ctx->outer_context;

16910

if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))

16911

{

16912

- tree copy = copy_node (decl), block;

16913

+ tree copy = copy_node (decl);

16914

16915

lang_hooks.dup_lang_specific_decl (copy);

16916

SET_DECL_RTL (copy, 0);

16917

TREE_USED (copy) = 1;

16918

- block = DECL_INITIAL (current_function_decl);

16919

- DECL_CHAIN (copy) = BLOCK_VARS (block);

16920

- BLOCK_VARS (block) = copy;

16921

+ DECL_CHAIN (copy) = nonlocal_vla_vars;

16922

+ nonlocal_vla_vars = copy;

16923

SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));

16924

DECL_HAS_VALUE_EXPR_P (copy) = 1;

16925

}

16926

@@ -4369,7 +4371,7 @@

16927

unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;

16928

tree index = bitsize_int (indexi);

16929

if (offset / part_widthi

16930

- <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))

16931

+ < TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))

16932

return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),

16933

part_width, index);

16934

}

16935

@@ -6131,7 +6133,7 @@

16936

region's REDUCTION clause. */

16937

16938

static bool

16939

-omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)

16940

+omp_check_private (struct gimplify_omp_ctx *ctx, tree decl, bool copyprivate)

16941

{

16942

splay_tree_node n;

16943

16944

@@ -6140,8 +6142,11 @@

16945

ctx = ctx->outer_context;

16946

if (ctx == NULL)

16947

return !(is_global_var (decl)

16948

- /* References might be private, but might be shared too. */

16949

- || lang_hooks.decls.omp_privatize_by_reference (decl));

16950

+ /* References might be private, but might be shared too,

16951

+ when checking for copyprivate, assume they might be

16952

+ private, otherwise assume they might be shared. */

16953

+ || (!copyprivate

16954

+ && lang_hooks.decls.omp_privatize_by_reference (decl)));

16955

16956

n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);

16957

if (n != NULL)

16958

@@ -6267,12 +6272,36 @@

16959

remove = true;

16960

break;

16961

}

16962

+ if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_COPYPRIVATE

16963

+ && !remove

16964

+ && !omp_check_private (ctx, decl, true))

16965

+ {

16966

+ remove = true;

16967

+ if (is_global_var (decl))

16968

+ {

16969

+ if (DECL_THREAD_LOCAL_P (decl))

16970

+ remove = false;

16971

+ else if (DECL_HAS_VALUE_EXPR_P (decl))

16972

+ {

16973

+ tree value = get_base_address (DECL_VALUE_EXPR (decl));

16974

+

16975

+ if (value

16976

+ && DECL_P (value)

16977

+ && DECL_THREAD_LOCAL_P (value))

16978

+ remove = false;

16979

+ }

16980

+ }

16981

+ if (remove)

16982

+ error_at (OMP_CLAUSE_LOCATION (c),

16983

+ "copyprivate variable %qE is not threadprivate"

16984

+ " or private in outer context", DECL_NAME (decl));

16985

+ }

16986

do_notice:

16987

if (outer_ctx)

16988

omp_notice_variable (outer_ctx, decl, true);

16989

if (check_non_private

16990

&& region_type == ORT_WORKSHARE

16991

- && omp_check_private (ctx, decl))

16992

+ && omp_check_private (ctx, decl, false))

16993

{

16994

error ("%s variable %qE is private in outer context",

16995

check_non_private, DECL_NAME (decl));

16996

@@ -8261,6 +8290,21 @@

16997

16998

if (nonlocal_vlas)

16999

{

17000

+ if (nonlocal_vla_vars)

17001

+ {

17002

+ /* tree-nested.c may later on call declare_vars (..., true);

17003

+ which relies on BLOCK_VARS chain to be the tail of the

17004

+ gimple_bind_vars chain. Ensure we don't violate that

17005

+ assumption. */

17006

+ if (gimple_bind_block (outer_bind)

17007

+ == DECL_INITIAL (current_function_decl))

17008

+ declare_vars (nonlocal_vla_vars, outer_bind, true);

17009

+ else

17010

+ BLOCK_VARS (DECL_INITIAL (current_function_decl))

17011

+ = chainon (BLOCK_VARS (DECL_INITIAL (current_function_decl)),

17012

+ nonlocal_vla_vars);

17013

+ nonlocal_vla_vars = NULL_TREE;

17014

+ }

17015

pointer_set_destroy (nonlocal_vlas);

17016

nonlocal_vlas = NULL;

17017

}

17018

Index: gcc/tree-dfa.c

17019

===================================================================

17020

--- a/src/gcc/tree-dfa.c (.../tags/gcc_4_8_2_release)

17021

+++ b/src/gcc/tree-dfa.c (.../branches/gcc-4_8-branch)

17022

@@ -386,7 +386,6 @@

17023

double_int bit_offset = double_int_zero;

17024

HOST_WIDE_INT hbit_offset;

17025

bool seen_variable_array_ref = false;

17026

- tree base_type;

17027

17028

/* First get the final access size from just the outermost expression. */

17029

if (TREE_CODE (exp) == COMPONENT_REF)

17030

@@ -417,8 +416,6 @@

17031

and find the ultimate containing object. */

17032

while (1)

17033

{

17034

- base_type = TREE_TYPE (exp);

17035

-

17036

switch (TREE_CODE (exp))

17037

{

17038

case BIT_FIELD_REF:

17039

@@ -543,7 +540,38 @@

17040

case VIEW_CONVERT_EXPR:

17041

break;

17042

17043

+ case TARGET_MEM_REF:

17044

+ /* Via the variable index or index2 we can reach the

17045

+ whole object. Still hand back the decl here. */

17046

+ if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR

17047

+ && (TMR_INDEX (exp) || TMR_INDEX2 (exp)))

17048

+ {

17049

+ exp = TREE_OPERAND (TMR_BASE (exp), 0);

17050

+ bit_offset = double_int_zero;

17051

+ maxsize = -1;

17052

+ goto done;

17053

+ }

17054

+ /* Fallthru. */

17055

case MEM_REF:

17056

+ /* We need to deal with variable arrays ending structures such as

17057

+ struct { int length; int a[1]; } x; x.a[d]

17058

+ struct { struct { int a; int b; } a[1]; } x; x.a[d].a

17059

+ struct { struct { int a[1]; } a[1]; } x; x.a[0][d], x.a[d][0]

17060

+ struct { int len; union { int a[1]; struct X x; } u; } x; x.u.a[d]

17061

+ where we do not know maxsize for variable index accesses to

17062

+ the array. The simplest way to conservatively deal with this

17063

+ is to punt in the case that offset + maxsize reaches the

17064

+ base type boundary. This needs to include possible trailing

17065

+ padding that is there for alignment purposes. */

17066

+ if (seen_variable_array_ref

17067

+ && maxsize != -1

17068

+ && (!bit_offset.fits_shwi ()

17069

+ || !host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)

17070

+ || (bit_offset.to_shwi () + maxsize

17071

+ == (HOST_WIDE_INT) TREE_INT_CST_LOW

17072

+ (TYPE_SIZE (TREE_TYPE (exp))))))

17073

+ maxsize = -1;

17074

+

17075

/* Hand back the decl for MEM[&decl, off]. */

17076

if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)

17077

{

17078

@@ -565,45 +593,24 @@

17079

}

17080

goto done;

17081

17082

- case TARGET_MEM_REF:

17083

- /* Hand back the decl for MEM[&decl, off]. */

17084

- if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR)

17085

- {

17086

- /* Via the variable index or index2 we can reach the

17087

- whole object. */

17088

- if (TMR_INDEX (exp) || TMR_INDEX2 (exp))

17089

- {

17090

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

17091

- bit_offset = double_int_zero;

17092

- maxsize = -1;

17093

- goto done;

17094

- }

17095

- if (integer_zerop (TMR_OFFSET (exp)))

17096

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

17097

- else

17098

- {

17099

- double_int off = mem_ref_offset (exp);

17100

- off = off.alshift (BITS_PER_UNIT == 8

17101

- ? 3 : exact_log2 (BITS_PER_UNIT),

17102

- HOST_BITS_PER_DOUBLE_INT);

17103

- off += bit_offset;

17104

- if (off.fits_shwi ())

17105

- {

17106

- bit_offset = off;

17107

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

17108

- }

17109

- }

17110

- }

17111

- goto done;

17112

-

17113

default:

17114

goto done;

17115

}

17116

17117

exp = TREE_OPERAND (exp, 0);

17118

}

17119

+

17120

+ /* We need to deal with variable arrays ending structures. */

17121

+ if (seen_variable_array_ref

17122

+ && maxsize != -1

17123

+ && (!bit_offset.fits_shwi ()

17124

+ || !host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)

17125

+ || (bit_offset.to_shwi () + maxsize

17126

+ == (HOST_WIDE_INT)

17127

+ TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp))))))

17128

+ maxsize = -1;

17129

+

17130

done:

17131

-

17132

if (!bit_offset.fits_shwi ())

17133

{

17134

*poffset = 0;

17135

@@ -615,24 +622,6 @@

17136

17137

hbit_offset = bit_offset.to_shwi ();

17138

17139

- /* We need to deal with variable arrays ending structures such as

17140

- struct { int length; int a[1]; } x; x.a[d]

17141

- struct { struct { int a; int b; } a[1]; } x; x.a[d].a

17142

- struct { struct { int a[1]; } a[1]; } x; x.a[0][d], x.a[d][0]

17143

- struct { int len; union { int a[1]; struct X x; } u; } x; x.u.a[d]

17144

- where we do not know maxsize for variable index accesses to

17145

- the array. The simplest way to conservatively deal with this

17146

- is to punt in the case that offset + maxsize reaches the

17147

- base type boundary. This needs to include possible trailing padding

17148

- that is there for alignment purposes. */

17149

-

17150

- if (seen_variable_array_ref

17151

- && maxsize != -1

17152

- && (!host_integerp (TYPE_SIZE (base_type), 1)

17153

- || (hbit_offset + maxsize

17154

- == (signed) TREE_INT_CST_LOW (TYPE_SIZE (base_type)))))

17155

- maxsize = -1;

17156

-

17157

/* In case of a decl or constant base object we can do better. */

17158

17159

if (DECL_P (exp))

17160

Index: gcc/gimple-fold.c

17161

===================================================================

17162

--- a/src/gcc/gimple-fold.c (.../tags/gcc_4_8_2_release)

17163

+++ b/src/gcc/gimple-fold.c (.../branches/gcc-4_8-branch)

17164

@@ -178,7 +178,7 @@

17165

/* Make sure we create a cgraph node for functions we'll reference.

17166

They can be non-existent if the reference comes from an entry

17167

of an external vtable for example. */

17168

- cgraph_get_create_node (base);

17169

+ cgraph_get_create_real_symbol_node (base);

17170

}

17171

/* Fixup types in global initializers. */

17172

if (TREE_TYPE (TREE_TYPE (cval)) != TREE_TYPE (TREE_OPERAND (cval, 0)))

17173

Index: gcc/cfgexpand.c

17174

===================================================================

17175

--- a/src/gcc/cfgexpand.c (.../tags/gcc_4_8_2_release)

17176

+++ b/src/gcc/cfgexpand.c (.../branches/gcc-4_8-branch)

17177

@@ -331,7 +331,7 @@

17178

enter its partition number into bitmap DATA. */

17179

17180

static bool

17181

-visit_op (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

17182

+visit_op (gimple, tree op, tree, void *data)

17183

{

17184

bitmap active = (bitmap)data;

17185

op = get_base_address (op);

17186

@@ -351,7 +351,7 @@

17187

from bitmap DATA. */

17188

17189

static bool

17190

-visit_conflict (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

17191

+visit_conflict (gimple, tree op, tree, void *data)

17192

{

17193

bitmap active = (bitmap)data;

17194

op = get_base_address (op);

17195

@@ -385,7 +385,7 @@

17196

edge e;

17197

edge_iterator ei;

17198

gimple_stmt_iterator gsi;

17199

- bool (*visit)(gimple, tree, void *);

17200

+ walk_stmt_load_store_addr_fn visit;

17201

17202

bitmap_clear (work);

17203

FOR_EACH_EDGE (e, ei, bb->preds)

17204

@@ -4707,14 +4707,18 @@

17205

if (e->insns.r)

17206

{

17207

rebuild_jump_labels_chain (e->insns.r);

17208

- /* Avoid putting insns before parm_birth_insn. */

17209

+ /* Put insns after parm birth, but before

17210

+ NOTE_INSNS_FUNCTION_BEG. */

17211

if (e->src == ENTRY_BLOCK_PTR

17212

- && single_succ_p (ENTRY_BLOCK_PTR)

17213

- && parm_birth_insn)

17214

+ && single_succ_p (ENTRY_BLOCK_PTR))

17215

{

17216

rtx insns = e->insns.r;

17217

e->insns.r = NULL_RTX;

17218

- emit_insn_after_noloc (insns, parm_birth_insn, e->dest);

17219

+ if (NOTE_P (parm_birth_insn)

17220

+ && NOTE_KIND (parm_birth_insn) == NOTE_INSN_FUNCTION_BEG)

17221

+ emit_insn_before_noloc (insns, parm_birth_insn, e->dest);

17222

+ else

17223

+ emit_insn_after_noloc (insns, parm_birth_insn, e->dest);

17224

}

17225

else

17226

commit_one_edge_insertion (e);

17227

Index: gcc/tree-ssa-pre.c

17228

===================================================================

17229

--- a/src/gcc/tree-ssa-pre.c (.../tags/gcc_4_8_2_release)

17230

+++ b/src/gcc/tree-ssa-pre.c (.../branches/gcc-4_8-branch)

17231

@@ -3664,6 +3664,12 @@

17232

if (dump_file && dump_flags & TDF_DETAILS)

17233

fprintf (dump_file, "Starting insert iteration %d\n", num_iterations);

17234

new_stuff = insert_aux (ENTRY_BLOCK_PTR);

17235

+

17236

+ /* Clear the NEW sets before the next iteration. We have already

17237

+ fully propagated its contents. */

17238

+ if (new_stuff)

17239

+ FOR_ALL_BB (bb)

17240

+ bitmap_set_free (NEW_SETS (bb));

17241

}

17242

statistics_histogram_event (cfun, "insert iterations", num_iterations);

17243

}

17244

Index: gcc/cfgcleanup.c

17245

===================================================================

17246

--- a/src/gcc/cfgcleanup.c (.../tags/gcc_4_8_2_release)

17247

+++ b/src/gcc/cfgcleanup.c (.../branches/gcc-4_8-branch)

17248

@@ -1293,7 +1293,6 @@

17249

{

17250

rtx i1, i2, last1, last2, afterlast1, afterlast2;

17251

int ninsns = 0;

17252

- rtx p1;

17253

enum replace_direction dir, last_dir, afterlast_dir;

17254

bool follow_fallthru, did_fallthru;

17255

17256

@@ -1321,8 +1320,9 @@

17257

|| (returnjump_p (i2) && !side_effects_p (PATTERN (i2))))

17258

{

17259

last2 = i2;

17260

- /* Count everything except for unconditional jump as insn. */

17261

- if (!simplejump_p (i2) && !returnjump_p (i2) && last1)

17262

+ /* Count everything except for unconditional jump as insn.

17263

+ Don't count any jumps if dir_p is NULL. */

17264

+ if (!simplejump_p (i2) && !returnjump_p (i2) && last1 && dir_p)

17265

ninsns++;

17266

i2 = PREV_INSN (i2);

17267

}

17268

@@ -1373,8 +1373,8 @@

17269

last1 = i1, last2 = i2;

17270

afterlast_dir = last_dir;

17271

last_dir = dir;

17272

- p1 = PATTERN (i1);

17273

- if (!(GET_CODE (p1) == USE || GET_CODE (p1) == CLOBBER))

17274

+ if (GET_CODE (PATTERN (i1)) != USE

17275

+ && GET_CODE (PATTERN (i1)) != CLOBBER)

17276

ninsns++;

17277

}

17278

17279

@@ -1420,7 +1420,8 @@

17280

/* Like flow_find_cross_jump, except start looking for a matching sequence from

17281

the head of the two blocks. Do not include jumps at the end.

17282

If STOP_AFTER is nonzero, stop after finding that many matching

17283

- instructions. */

17284

+ instructions. If STOP_AFTER is zero, count all INSN_P insns, if it is

17285

+ non-zero, only count active insns. */

17286

17287

int

17288

flow_find_head_matching_sequence (basic_block bb1, basic_block bb2, rtx *f1,

17289

@@ -1492,7 +1493,10 @@

17290

17291

beforelast1 = last1, beforelast2 = last2;

17292

last1 = i1, last2 = i2;

17293

- ninsns++;

17294

+ if (!stop_after

17295

+ || (GET_CODE (PATTERN (i1)) != USE

17296

+ && GET_CODE (PATTERN (i1)) != CLOBBER))

17297

+ ninsns++;

17298

}

17299

17300

if (i1 == BB_END (bb1) || i2 == BB_END (bb2)

17301

Index: gcc/simplify-rtx.c

17302

===================================================================

17303

--- a/src/gcc/simplify-rtx.c (.../tags/gcc_4_8_2_release)

17304

+++ b/src/gcc/simplify-rtx.c (.../branches/gcc-4_8-branch)

17305

@@ -639,11 +639,16 @@

17306

XEXP (op, 0), origmode);

17307

}

17308

17309

- /* Simplify (truncate:SI (op:DI (x:DI) (y:DI)))

17310

- to (op:SI (truncate:SI (x:DI)) (truncate:SI (x:DI))). */

17311

- if (GET_CODE (op) == PLUS

17312

- || GET_CODE (op) == MINUS

17313

- || GET_CODE (op) == MULT)

17314

+ /* If the machine can perform operations in the truncated mode, distribute

17315

+ the truncation, i.e. simplify (truncate:QI (op:SI (x:SI) (y:SI))) into

17316

+ (op:QI (truncate:QI (x:SI)) (truncate:QI (y:SI))). */

17317

+ if (1

17318

+#ifdef WORD_REGISTER_OPERATIONS

17319

+ && precision >= BITS_PER_WORD

17320

+#endif

17321

+ && (GET_CODE (op) == PLUS

17322

+ || GET_CODE (op) == MINUS

17323

+ || GET_CODE (op) == MULT))

17324

{

17325

rtx op0 = simplify_gen_unary (TRUNCATE, mode, XEXP (op, 0), op_mode);

17326

if (op0)

17327

Index: gcc/tree-sra.c

17328

===================================================================

17329

--- a/src/gcc/tree-sra.c (.../tags/gcc_4_8_2_release)

17330

+++ b/src/gcc/tree-sra.c (.../branches/gcc-4_8-branch)

17331

@@ -1161,8 +1161,7 @@

17332

GIMPLE_ASM operands with memory constrains which cannot be scalarized. */

17333

17334

static bool

17335

-asm_visit_addr (gimple stmt ATTRIBUTE_UNUSED, tree op,

17336

- void *data ATTRIBUTE_UNUSED)

17337

+asm_visit_addr (gimple, tree op, tree, void *)

17338

{

17339

op = get_base_address (op);

17340

if (op

17341

Index: gcc/tree-predcom.c

17342

===================================================================

17343

--- a/src/gcc/tree-predcom.c (.../tags/gcc_4_8_2_release)

17344

+++ b/src/gcc/tree-predcom.c (.../branches/gcc-4_8-branch)

17345

@@ -1323,90 +1323,43 @@

17346

gsi_insert_after (&bsi, new_stmt, GSI_NEW_STMT);

17347

}

17348

17349

-/* Returns the reference to the address of REF in the ITER-th iteration of

17350

- LOOP, or NULL if we fail to determine it (ITER may be negative). We

17351

- try to preserve the original shape of the reference (not rewrite it

17352

- as an indirect ref to the address), to make tree_could_trap_p in

17353

- prepare_initializers_chain return false more often. */

17354

+/* Returns a memory reference to DR in the ITER-th iteration of

17355

+ the loop it was analyzed in. Append init stmts to STMTS. */

17356

17357

-static tree

17358

-ref_at_iteration (struct loop *loop, tree ref, int iter)

17359

+static tree

17360

+ref_at_iteration (data_reference_p dr, int iter, gimple_seq *stmts)

17361

{

17362

- tree idx, *idx_p, type, val, op0 = NULL_TREE, ret;

17363

- affine_iv iv;

17364

- bool ok;

17365

-

17366

- if (handled_component_p (ref))

17367

+ tree off = DR_OFFSET (dr);

17368

+ tree coff = DR_INIT (dr);

17369

+ if (iter == 0)

17370

+ ;

17371

+ else if (TREE_CODE (DR_STEP (dr)) == INTEGER_CST)

17372

+ coff = size_binop (PLUS_EXPR, coff,

17373

+ size_binop (MULT_EXPR, DR_STEP (dr), ssize_int (iter)));

17374

+ else

17375

+ off = size_binop (PLUS_EXPR, off,

17376

+ size_binop (MULT_EXPR, DR_STEP (dr), ssize_int (iter)));

17377

+ tree addr = fold_build_pointer_plus (DR_BASE_ADDRESS (dr), off);

17378

+ addr = force_gimple_operand_1 (addr, stmts, is_gimple_mem_ref_addr,

17379

+ NULL_TREE);

17380

+ tree alias_ptr = fold_convert (reference_alias_ptr_type (DR_REF (dr)), coff);

17381

+ /* While data-ref analysis punts on bit offsets it still handles

17382

+ bitfield accesses at byte boundaries. Cope with that. Note that

17383

+ we cannot simply re-apply the outer COMPONENT_REF because the

17384

+ byte-granular portion of it is already applied via DR_INIT and

17385

+ DR_OFFSET, so simply build a BIT_FIELD_REF knowing that the bits

17386

+ start at offset zero. */

17387

+ if (TREE_CODE (DR_REF (dr)) == COMPONENT_REF

17388

+ && DECL_BIT_FIELD (TREE_OPERAND (DR_REF (dr), 1)))

17389

{

17390

- op0 = ref_at_iteration (loop, TREE_OPERAND (ref, 0), iter);

17391

- if (!op0)

17392

- return NULL_TREE;

17393

+ tree field = TREE_OPERAND (DR_REF (dr), 1);

17394

+ return build3 (BIT_FIELD_REF, TREE_TYPE (DR_REF (dr)),

17395

+ build2 (MEM_REF, DECL_BIT_FIELD_TYPE (field),

17396

+ addr, alias_ptr),

17397

+ DECL_SIZE (field), bitsize_zero_node);

17398

}

17399

- else if (!INDIRECT_REF_P (ref)

17400

- && TREE_CODE (ref) != MEM_REF)

17401

- return unshare_expr (ref);

17402

-

17403

- if (TREE_CODE (ref) == MEM_REF)

17404

- {

17405

- ret = unshare_expr (ref);

17406

- idx = TREE_OPERAND (ref, 0);

17407

- idx_p = &TREE_OPERAND (ret, 0);

17408

- }

17409

- else if (TREE_CODE (ref) == COMPONENT_REF)

17410

- {

17411

- /* Check that the offset is loop invariant. */

17412

- if (TREE_OPERAND (ref, 2)

17413

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 2)))

17414

- return NULL_TREE;

17415

-

17416

- return build3 (COMPONENT_REF, TREE_TYPE (ref), op0,

17417

- unshare_expr (TREE_OPERAND (ref, 1)),

17418

- unshare_expr (TREE_OPERAND (ref, 2)));

17419

- }

17420

- else if (TREE_CODE (ref) == ARRAY_REF)

17421

- {

17422

- /* Check that the lower bound and the step are loop invariant. */

17423

- if (TREE_OPERAND (ref, 2)

17424

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 2)))

17425

- return NULL_TREE;

17426

- if (TREE_OPERAND (ref, 3)

17427

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 3)))

17428

- return NULL_TREE;

17429

-

17430

- ret = build4 (ARRAY_REF, TREE_TYPE (ref), op0, NULL_TREE,

17431

- unshare_expr (TREE_OPERAND (ref, 2)),

17432

- unshare_expr (TREE_OPERAND (ref, 3)));

17433

- idx = TREE_OPERAND (ref, 1);

17434

- idx_p = &TREE_OPERAND (ret, 1);

17435

- }

17436

else

17437

- return NULL_TREE;

17438

-

17439

- ok = simple_iv (loop, loop, idx, &iv, true);

17440

- if (!ok)

17441

- return NULL_TREE;

17442

- iv.base = expand_simple_operations (iv.base);

17443

- if (integer_zerop (iv.step))

17444

- *idx_p = unshare_expr (iv.base);

17445

- else

17446

- {

17447

- type = TREE_TYPE (iv.base);

17448

- if (POINTER_TYPE_P (type))

17449

- {

17450

- val = fold_build2 (MULT_EXPR, sizetype, iv.step,

17451

- size_int (iter));

17452

- val = fold_build_pointer_plus (iv.base, val);

17453

- }

17454

- else

17455

- {

17456

- val = fold_build2 (MULT_EXPR, type, iv.step,

17457

- build_int_cst_type (type, iter));

17458

- val = fold_build2 (PLUS_EXPR, type, iv.base, val);

17459

- }

17460

- *idx_p = unshare_expr (val);

17461

- }

17462

-

17463

- return ret;

17464

+ return fold_build2 (MEM_REF, TREE_TYPE (DR_REF (dr)), addr, alias_ptr);

17465

}

17466

17467

/* Get the initialization expression for the INDEX-th temporary variable

17468

@@ -2068,7 +2021,11 @@

17469

17470

stmt = find_common_use_stmt (&name1, &name2);

17471

17472

- if (!stmt)

17473

+ if (!stmt

17474

+ /* A simple post-dominance check - make sure the combination

17475

+ is executed under the same condition as the references. */

17476

+ || (gimple_bb (stmt) != gimple_bb (r1->stmt)

17477

+ && gimple_bb (stmt) != gimple_bb (r2->stmt)))

17478

return false;

17479

17480

acode = gimple_assign_rhs_code (stmt);

17481

@@ -2365,14 +2322,10 @@

17482

if (chain->inits[i] != NULL_TREE)

17483

continue;

17484

17485

- init = ref_at_iteration (loop, DR_REF (dr), (int) i - n);

17486

- if (!init)

17487

- return false;

17488

-

17489

+ init = ref_at_iteration (dr, (int) i - n, &stmts);

17490

if (!chain->all_always_accessed && tree_could_trap_p (init))

17491

return false;

17492

17493

- init = force_gimple_operand (init, &stmts, false, NULL_TREE);

17494

if (stmts)

17495

gsi_insert_seq_on_edge_immediate (entry, stmts);

17496

17497

Index: gcc/loop-iv.c

17498

===================================================================

17499

--- a/src/gcc/loop-iv.c (.../tags/gcc_4_8_2_release)

17500

+++ b/src/gcc/loop-iv.c (.../branches/gcc-4_8-branch)

17501

@@ -425,7 +425,9 @@

17502

&& !iv->first_special)

17503

{

17504

rtx val = get_iv_value (iv, const0_rtx);

17505

- val = lowpart_subreg (mode, val, iv->extend_mode);

17506

+ val = lowpart_subreg (mode, val,

17507

+ iv->extend == IV_UNKNOWN_EXTEND

17508

+ ? iv->mode : iv->extend_mode);

17509

17510

iv->base = val;

17511

iv->extend = IV_UNKNOWN_EXTEND;

17512

@@ -465,8 +467,14 @@

17513

&& !iv->first_special)

17514

{

17515

rtx val = get_iv_value (iv, const0_rtx);

17516

+ if (iv->extend_mode != iv->mode

17517

+ && iv->extend != IV_UNKNOWN_EXTEND

17518

+ && iv->extend != extend)

17519

+ val = lowpart_subreg (iv->mode, val, iv->extend_mode);

17520

val = simplify_gen_unary (iv_extend_to_rtx_code (extend), mode,

17521

- val, iv->extend_mode);

17522

+ val,

17523

+ iv->extend == extend

17524

+ ? iv->extend_mode : iv->mode);

17525

iv->base = val;

17526

iv->extend = IV_UNKNOWN_EXTEND;

17527

iv->mode = iv->extend_mode = mode;

17528

Index: gcc/ipa-prop.c

17529

===================================================================

17530

--- a/src/gcc/ipa-prop.c (.../tags/gcc_4_8_2_release)

17531

+++ b/src/gcc/ipa-prop.c (.../branches/gcc-4_8-branch)

17532

@@ -623,16 +623,22 @@

17533

if (parm_ainfo && parm_ainfo->parm_modified)

17534

return false;

17535

17536

- gcc_checking_assert (gimple_vuse (stmt) != NULL_TREE);

17537

- ao_ref_init (&refd, parm_load);

17538

- /* We can cache visited statements only when parm_ainfo is available and when

17539

- we are looking at a naked load of the whole parameter. */

17540

- if (!parm_ainfo || TREE_CODE (parm_load) != PARM_DECL)

17541

- visited_stmts = NULL;

17542

+ if (optimize)

17543

+ {

17544

+ gcc_checking_assert (gimple_vuse (stmt) != NULL_TREE);

17545

+ ao_ref_init (&refd, parm_load);

17546

+ /* We can cache visited statements only when parm_ainfo is available and

17547

+ when we are looking at a naked load of the whole parameter. */

17548

+ if (!parm_ainfo || TREE_CODE (parm_load) != PARM_DECL)

17549

+ visited_stmts = NULL;

17550

+ else

17551

+ visited_stmts = &parm_ainfo->parm_visited_statements;

17552

+ walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, &modified,

17553

+ visited_stmts);

17554

+ }

17555

else

17556

- visited_stmts = &parm_ainfo->parm_visited_statements;

17557

- walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, &modified,

17558

- visited_stmts);

17559

+ modified = true;

17560

+

17561

if (parm_ainfo && modified)

17562

parm_ainfo->parm_modified = true;

17563

return !modified;

17564

@@ -740,7 +746,7 @@

17565

ipa_load_from_parm_agg_1 (vec<ipa_param_descriptor_t> descriptors,

17566

struct param_analysis_info *parms_ainfo, gimple stmt,

17567

tree op, int *index_p, HOST_WIDE_INT *offset_p,

17568

- bool *by_ref_p)

17569

+ HOST_WIDE_INT *size_p, bool *by_ref_p)

17570

{

17571

int index;

17572

HOST_WIDE_INT size, max_size;

17573

@@ -758,6 +764,8 @@

17574

{

17575

*index_p = index;

17576

*by_ref_p = false;

17577

+ if (size_p)

17578

+ *size_p = size;

17579

return true;

17580

}

17581

return false;

17582

@@ -800,6 +808,8 @@

17583

{

17584

*index_p = index;

17585

*by_ref_p = true;

17586

+ if (size_p)

17587

+ *size_p = size;

17588

return true;

17589

}

17590

return false;

17591

@@ -814,7 +824,7 @@

17592

bool *by_ref_p)

17593

{

17594

return ipa_load_from_parm_agg_1 (info->descriptors, NULL, stmt, op, index_p,

17595

- offset_p, by_ref_p);

17596

+ offset_p, NULL, by_ref_p);

17597

}

17598

17599

/* Given that an actual argument is an SSA_NAME (given in NAME) and is a result

17600

@@ -1462,6 +1472,9 @@

17601

{

17602

struct cgraph_edge *cs;

17603

17604

+ if (!optimize)

17605

+ return;

17606

+

17607

for (cs = node->callees; cs; cs = cs->next_callee)

17608

{

17609

struct cgraph_node *callee = cgraph_function_or_thunk_node (cs->callee,

17610

@@ -1646,7 +1659,7 @@

17611

if (gimple_assign_single_p (def)

17612

&& ipa_load_from_parm_agg_1 (info->descriptors, parms_ainfo, def,

17613

gimple_assign_rhs1 (def), &index, &offset,

17614

- &by_ref))

17615

+ NULL, &by_ref))

17616

{

17617

struct cgraph_edge *cs = ipa_note_param_call (node, index, call);

17618

cs->indirect_info->offset = offset;

17619

@@ -1847,8 +1860,7 @@

17620

passed in DATA. */

17621

17622

static bool

17623

-visit_ref_for_mod_analysis (gimple stmt ATTRIBUTE_UNUSED,

17624

- tree op, void *data)

17625

+visit_ref_for_mod_analysis (gimple, tree op, tree, void *data)

17626

{

17627

struct ipa_node_params *info = (struct ipa_node_params *) data;

17628

17629

@@ -2126,7 +2138,6 @@

17630

we may create the first reference to the object in the unit. */

17631

if (!callee || callee->global.inlined_to)

17632

{

17633

- struct cgraph_node *first_clone = callee;

17634

17635

/* We are better to ensure we can refer to it.

17636

In the case of static functions we are out of luck, since we already

17637

@@ -2142,31 +2153,7 @@

17638

xstrdup (cgraph_node_name (ie->callee)), ie->callee->uid);

17639

return NULL;

17640

}

17641

-

17642

- /* Create symbol table node. Even if inline clone exists, we can not take

17643

- it as a target of non-inlined call. */

17644

- callee = cgraph_create_node (target);

17645

-

17646

- /* OK, we previously inlined the function, then removed the offline copy and

17647

- now we want it back for external call. This can happen when devirtualizing

17648

- while inlining function called once that happens after extern inlined and

17649

- virtuals are already removed. In this case introduce the external node

17650

- and make it available for call. */

17651

- if (first_clone)

17652

- {

17653

- first_clone->clone_of = callee;

17654

- callee->clones = first_clone;

17655

- symtab_prevail_in_asm_name_hash ((symtab_node)callee);

17656

- symtab_insert_node_to_hashtable ((symtab_node)callee);

17657

- if (dump_file)

17658

- fprintf (dump_file, "ipa-prop: Introduced new external node "

17659

- "(%s/%i) and turned into root of the clone tree.\n",

17660

- xstrdup (cgraph_node_name (callee)), callee->uid);

17661

- }

17662

- else if (dump_file)

17663

- fprintf (dump_file, "ipa-prop: Introduced new external node "

17664

- "(%s/%i).\n",

17665

- xstrdup (cgraph_node_name (callee)), callee->uid);

17666

+ callee = cgraph_get_create_real_symbol_node (target);

17667

}

17668

ipa_check_create_node_params ();

17669

17670

@@ -3902,7 +3889,7 @@

17671

struct ipa_agg_replacement_value *v;

17672

gimple stmt = gsi_stmt (gsi);

17673

tree rhs, val, t;

17674

- HOST_WIDE_INT offset;

17675

+ HOST_WIDE_INT offset, size;

17676

int index;

17677

bool by_ref, vce;

17678

17679

@@ -3929,13 +3916,15 @@

17680

continue;

17681

17682

if (!ipa_load_from_parm_agg_1 (descriptors, parms_ainfo, stmt,

17683

- rhs, &index, &offset, &by_ref))

17684

+ rhs, &index, &offset, &size, &by_ref))

17685

continue;

17686

for (v = aggval; v; v = v->next)

17687

if (v->index == index

17688

&& v->offset == offset)

17689

break;

17690

- if (!v || v->by_ref != by_ref)

17691

+ if (!v

17692

+ || v->by_ref != by_ref

17693

+ || tree_low_cst (TYPE_SIZE (TREE_TYPE (v->value)), 0) != size)

17694

continue;

17695

17696

gcc_checking_assert (is_gimple_ip_invariant (v->value));

17697

Index: gcc/tree-ssa-dce.c

17698

===================================================================

17699

--- a/src/gcc/tree-ssa-dce.c (.../tags/gcc_4_8_2_release)

17700

+++ b/src/gcc/tree-ssa-dce.c (.../branches/gcc-4_8-branch)

17701

@@ -1307,26 +1307,19 @@

17702

stats.total++;

17703

17704

/* We can mark a call to free as not necessary if the

17705

- defining statement of its argument is an allocation

17706

- function and that is not necessary itself. */

17707

- if (gimple_call_builtin_p (stmt, BUILT_IN_FREE))

17708

+ defining statement of its argument is not necessary

17709

+ (and thus is getting removed). */

17710

+ if (gimple_plf (stmt, STMT_NECESSARY)

17711

+ && gimple_call_builtin_p (stmt, BUILT_IN_FREE))

17712

{

17713

tree ptr = gimple_call_arg (stmt, 0);

17714

- tree callee2;

17715

- gimple def_stmt;

17716

- if (TREE_CODE (ptr) != SSA_NAME)

17717

- continue;

17718

- def_stmt = SSA_NAME_DEF_STMT (ptr);

17719

- if (!is_gimple_call (def_stmt)

17720

- || gimple_plf (def_stmt, STMT_NECESSARY))

17721

- continue;

17722

- callee2 = gimple_call_fndecl (def_stmt);

17723

- if (callee2 == NULL_TREE

17724

- || DECL_BUILT_IN_CLASS (callee2) != BUILT_IN_NORMAL

17725

- || (DECL_FUNCTION_CODE (callee2) != BUILT_IN_MALLOC

17726

- && DECL_FUNCTION_CODE (callee2) != BUILT_IN_CALLOC))

17727

- continue;

17728

- gimple_set_plf (stmt, STMT_NECESSARY, false);

17729

+ if (TREE_CODE (ptr) == SSA_NAME)

17730

+ {

17731

+ gimple def_stmt = SSA_NAME_DEF_STMT (ptr);

17732

+ if (!gimple_nop_p (def_stmt)

17733

+ && !gimple_plf (def_stmt, STMT_NECESSARY))

17734

+ gimple_set_plf (stmt, STMT_NECESSARY, false);

17735

+ }

17736

}

17737

17738

/* If GSI is not necessary then remove it. */

17739

Index: gcc/tree-ssa-ter.c

17740

===================================================================

17741

--- a/src/gcc/tree-ssa-ter.c (.../tags/gcc_4_8_2_release)

17742

+++ b/src/gcc/tree-ssa-ter.c (.../branches/gcc-4_8-branch)

17743

@@ -590,6 +590,30 @@

17744

}

17745

17746

17747

+/* Helper function for find_ssaname_in_stores. Called via walk_tree to

17748

+ find a SSA_NAME DATA somewhere in *TP. */

17749

+

17750

+static tree

17751

+find_ssaname (tree *tp, int *walk_subtrees, void *data)

17752

+{

17753

+ tree var = (tree) data;

17754

+ if (*tp == var)

17755

+ return var;

17756

+ else if (IS_TYPE_OR_DECL_P (*tp))

17757

+ *walk_subtrees = 0;

17758

+ return NULL_TREE;

17759

+}

17760

+

17761

+/* Helper function for find_replaceable_in_bb. Return true if SSA_NAME DATA

17762

+ is used somewhere in T, which is a store in the statement. Called via

17763

+ walk_stmt_load_store_addr_ops. */

17764

+

17765

+static bool

17766

+find_ssaname_in_store (gimple, tree, tree t, void *data)

17767

+{

17768

+ return walk_tree (&t, find_ssaname, data, NULL) != NULL_TREE;

17769

+}

17770

+

17771

/* This function processes basic block BB, and looks for variables which can

17772

be replaced by their expressions. Results are stored in the table TAB. */

17773

17774

@@ -643,8 +667,7 @@

17775

/* If the stmt does a memory store and the replacement

17776

is a load aliasing it avoid creating overlapping

17777

assignments which we cannot expand correctly. */

17778

- if (gimple_vdef (stmt)

17779

- && gimple_assign_single_p (stmt))

17780

+ if (gimple_vdef (stmt))

17781

{

17782

gimple def_stmt = SSA_NAME_DEF_STMT (use);

17783

while (is_gimple_assign (def_stmt)

17784

@@ -653,9 +676,29 @@

17785

= SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def_stmt));

17786

if (gimple_vuse (def_stmt)

17787

&& gimple_assign_single_p (def_stmt)

17788

- && refs_may_alias_p (gimple_assign_lhs (stmt),

17789

- gimple_assign_rhs1 (def_stmt)))

17790

- same_root_var = true;

17791

+ && stmt_may_clobber_ref_p (stmt,

17792

+ gimple_assign_rhs1 (def_stmt)))

17793

+ {

17794

+ /* For calls, it is not a problem if USE is among

17795

+ call's arguments or say OBJ_TYPE_REF argument,

17796

+ all those necessarily need to be evaluated before

17797

+ the call that may clobber the memory. But if

17798

+ LHS of the call refers to USE, expansion might

17799

+ evaluate it after the call, prevent TER in that

17800

+ case.

17801

+ For inline asm, allow TER of loads into input

17802

+ arguments, but disallow TER for USEs that occur

17803

+ somewhere in outputs. */

17804

+ if (is_gimple_call (stmt)

17805

+ || gimple_code (stmt) == GIMPLE_ASM)

17806

+ {

17807

+ if (walk_stmt_load_store_ops (stmt, use, NULL,

17808

+ find_ssaname_in_store))

17809

+ same_root_var = true;

17810

+ }

17811

+ else

17812

+ same_root_var = true;

17813

+ }

17814

}

17815

17816

/* Mark expression as replaceable unless stmt is volatile, or the

17817

Index: gcc/tree-vect-stmts.c

17818

===================================================================

17819

--- a/src/gcc/tree-vect-stmts.c (.../tags/gcc_4_8_2_release)

17820

+++ b/src/gcc/tree-vect-stmts.c (.../branches/gcc-4_8-branch)

17821

@@ -6054,8 +6054,7 @@

17822

corresponding to that mode. The theory is that any use that

17823

would cause problems with this will disable vectorization anyway. */

17824

else if (!SCALAR_FLOAT_TYPE_P (scalar_type)

17825

- && !INTEGRAL_TYPE_P (scalar_type)

17826

- && !POINTER_TYPE_P (scalar_type))

17827

+ && !INTEGRAL_TYPE_P (scalar_type))

17828

scalar_type = lang_hooks.types.type_for_mode (inner_mode, 1);

17829

17830

/* We can't build a vector type of elements with alignment bigger than

17831

Index: gcc/tree-object-size.c

17832

===================================================================

17833

--- a/src/gcc/tree-object-size.c (.../tags/gcc_4_8_2_release)

17834

+++ b/src/gcc/tree-object-size.c (.../branches/gcc-4_8-branch)

17835

@@ -64,7 +64,7 @@

17836

the subobject (innermost array or field with address taken).

17837

object_sizes[2] is lower bound for number of bytes till the end of

17838

the object and object_sizes[3] lower bound for subobject. */

17839

-static unsigned HOST_WIDE_INT *object_sizes[4];

17840

+static vec<unsigned HOST_WIDE_INT> object_sizes[4];

17841

17842

/* Bitmaps what object sizes have been computed already. */

17843

static bitmap computed[4];

17844

@@ -493,7 +493,7 @@

17845

17846

if (TREE_CODE (ptr) == SSA_NAME

17847

&& POINTER_TYPE_P (TREE_TYPE (ptr))

17848

- && object_sizes[object_size_type] != NULL)

17849

+ && computed[object_size_type] != NULL)

17850

{

17851

if (!bitmap_bit_p (computed[object_size_type], SSA_NAME_VERSION (ptr)))

17852

{

17853

@@ -501,6 +501,8 @@

17854

bitmap_iterator bi;

17855

unsigned int i;

17856

17857

+ if (num_ssa_names > object_sizes[object_size_type].length ())

17858

+ object_sizes[object_size_type].safe_grow (num_ssa_names);

17859

if (dump_file)

17860

{

17861

fprintf (dump_file, "Computing %s %sobject size for ",

17862

@@ -1162,12 +1164,12 @@

17863

{

17864

int object_size_type;

17865

17866

- if (object_sizes[0])

17867

+ if (computed[0])

17868

return;

17869

17870

for (object_size_type = 0; object_size_type <= 3; object_size_type++)

17871

{

17872

- object_sizes[object_size_type] = XNEWVEC (unsigned HOST_WIDE_INT, num_ssa_names);

17873

+ object_sizes[object_size_type].safe_grow (num_ssa_names);

17874

computed[object_size_type] = BITMAP_ALLOC (NULL);

17875

}

17876

17877

@@ -1184,9 +1186,8 @@

17878

17879

for (object_size_type = 0; object_size_type <= 3; object_size_type++)

17880

{

17881

- free (object_sizes[object_size_type]);

17882

+ object_sizes[object_size_type].release ();

17883

BITMAP_FREE (computed[object_size_type]);

17884

- object_sizes[object_size_type] = NULL;

17885

}

17886

}

17887

17888

@@ -1202,18 +1203,11 @@

17889

gimple_stmt_iterator i;

17890

for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))

17891

{

17892

- tree callee, result;

17893

+ tree result;

17894

gimple call = gsi_stmt (i);

17895

-

17896

- if (gimple_code (call) != GIMPLE_CALL)

17897

+ if (!gimple_call_builtin_p (call, BUILT_IN_OBJECT_SIZE))

17898

continue;

17899

17900

- callee = gimple_call_fndecl (call);

17901

- if (!callee

17902

- || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL

17903

- || DECL_FUNCTION_CODE (callee) != BUILT_IN_OBJECT_SIZE)

17904

- continue;

17905

-

17906

init_object_sizes ();

17907

result = fold_call_stmt (call, false);

17908

if (!result)

17909

@@ -1240,20 +1234,32 @@

17910

continue;

17911

}

17912

17913

+ gcc_assert (TREE_CODE (result) == INTEGER_CST);

17914

+

17915

if (dump_file && (dump_flags & TDF_DETAILS))

17916

{

17917

fprintf (dump_file, "Simplified\n ");

17918

print_gimple_stmt (dump_file, call, 0, dump_flags);

17919

+ fprintf (dump_file, " to ");

17920

+ print_generic_expr (dump_file, result, 0);

17921

+ fprintf (dump_file, "\n");

17922

}

17923

17924

- if (!update_call_from_tree (&i, result))

17925

- gcc_unreachable ();

17926

+ tree lhs = gimple_call_lhs (call);

17927

+ if (!lhs)

17928

+ continue;

17929

17930

- if (dump_file && (dump_flags & TDF_DETAILS))

17931

+ /* Propagate into all uses and fold those stmts. */

17932

+ gimple use_stmt;

17933

+ imm_use_iterator iter;

17934

+ FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs)

17935

{

17936

- fprintf (dump_file, "to\n ");

17937

- print_gimple_stmt (dump_file, gsi_stmt (i), 0, dump_flags);

17938

- fprintf (dump_file, "\n");

17939

+ use_operand_p use_p;

17940

+ FOR_EACH_IMM_USE_ON_STMT (use_p, iter)

17941

+ SET_USE (use_p, result);

17942

+ gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);

17943

+ fold_stmt (&gsi);

17944

+ update_stmt (gsi_stmt (gsi));

17945

}

17946

}

17947

}

17948

Index: gcc/combine.c

17949

===================================================================

17950

--- a/src/gcc/combine.c (.../tags/gcc_4_8_2_release)

17951

+++ b/src/gcc/combine.c (.../branches/gcc-4_8-branch)

17952

@@ -5798,8 +5798,15 @@

17953

return x;

17954

}

17955

17956

- /* If the code changed, return a whole new comparison. */

17957

- if (new_code != code)

17958

+ /* If the code changed, return a whole new comparison.

17959

+ We also need to avoid using SUBST in cases where

17960

+ simplify_comparison has widened a comparison with a CONST_INT,

17961

+ since in that case the wider CONST_INT may fail the sanity

17962

+ checks in do_SUBST. */

17963

+ if (new_code != code

17964

+ || (CONST_INT_P (op1)

17965

+ && GET_MODE (op0) != GET_MODE (XEXP (x, 0))

17966

+ && GET_MODE (op0) != GET_MODE (XEXP (x, 1))))

17967

return gen_rtx_fmt_ee (new_code, mode, op0, op1);

17968

17969

/* Otherwise, keep this operation, but maybe change its operands.

17970

@@ -7991,7 +7998,7 @@

17971

if (code == CALL || code == ASM_OPERANDS || code == CLOBBER)

17972

return x;

17973

17974

- /* We want to perform the operation is its present mode unless we know

17975

+ /* We want to perform the operation in its present mode unless we know

17976

that the operation is valid in MODE, in which case we do the operation

17977

in MODE. */

17978

op_mode = ((GET_MODE_CLASS (mode) == GET_MODE_CLASS (GET_MODE (x))

17979

@@ -8427,9 +8434,10 @@

17980

GET_MODE (x), GEN_INT (mask),

17981

XEXP (x, 1));

17982

if (temp && CONST_INT_P (temp))

17983

- SUBST (XEXP (x, 0),

17984

- force_to_mode (XEXP (x, 0), GET_MODE (x),

17985

- INTVAL (temp), next_select));

17986

+ x = simplify_gen_binary (code, GET_MODE (x),

17987

+ force_to_mode (XEXP (x, 0), GET_MODE (x),

17988

+ INTVAL (temp), next_select),

17989

+ XEXP (x, 1));

17990

}

17991

break;

17992

17993

@@ -8497,14 +8505,16 @@

17994

/* We have no way of knowing if the IF_THEN_ELSE can itself be

17995

written in a narrower mode. We play it safe and do not do so. */

17996

17997

- SUBST (XEXP (x, 1),

17998

- gen_lowpart_or_truncate (GET_MODE (x),

17999

- force_to_mode (XEXP (x, 1), mode,

18000

- mask, next_select)));

18001

- SUBST (XEXP (x, 2),

18002

- gen_lowpart_or_truncate (GET_MODE (x),

18003

- force_to_mode (XEXP (x, 2), mode,

18004

- mask, next_select)));

18005

+ op0 = gen_lowpart_or_truncate (GET_MODE (x),

18006

+ force_to_mode (XEXP (x, 1), mode,

18007

+ mask, next_select));

18008

+ op1 = gen_lowpart_or_truncate (GET_MODE (x),

18009

+ force_to_mode (XEXP (x, 2), mode,

18010

+ mask, next_select));

18011

+ if (op0 != XEXP (x, 1) || op1 != XEXP (x, 2))

18012

+ x = simplify_gen_ternary (IF_THEN_ELSE, GET_MODE (x),

18013

+ GET_MODE (XEXP (x, 0)), XEXP (x, 0),

18014

+ op0, op1);

18015

break;

18016

18017

default:

18018

Index: gcc/tree-flow.h

18019

===================================================================

18020

--- a/src/gcc/tree-flow.h (.../tags/gcc_4_8_2_release)

18021

+++ b/src/gcc/tree-flow.h (.../branches/gcc-4_8-branch)

18022

@@ -425,6 +425,7 @@

18023

basic_block, tree);

18024

void remove_edge_and_dominated_blocks (edge);

18025

bool tree_node_can_be_shared (tree);

18026

+extern unsigned int split_critical_edges (void);

18027

18028

/* In tree-cfgcleanup.c */

18029

extern bitmap cfgcleanup_altered_bbs;

18030

Index: gcc/config.gcc

18031

===================================================================

18032

--- a/src/gcc/config.gcc (.../tags/gcc_4_8_2_release)

18033

+++ b/src/gcc/config.gcc (.../branches/gcc-4_8-branch)

18034

@@ -1761,6 +1761,14 @@

18035

tmake_file="${tmake_file} microblaze/t-microblaze-linux"

18036

;;

18037

microblaze*-*-rtems*)

18038

+ case $target in

18039

+ microblazeel-*)

18040

+ tm_defines="${tm_defines} TARGET_BIG_ENDIAN_DEFAULT=0"

18041

+ ;;

18042

+ microblaze-*)

18043

+ tm_defines="${tm_defines} TARGET_BIG_ENDIAN_DEFAULT=4321"

18044

+ ;;

18045

+ esac

18046

tm_file="${tm_file} dbxelf.h"

18047

tm_file="${tm_file} microblaze/rtems.h rtems.h newlib-stdint.h"

18048

c_target_objs="${c_target_objs} microblaze-c.o"

18049

@@ -2963,11 +2971,18 @@

18050

with_cpu=8540

18051

fi

18052

;;

18053

- sparc-leon*-*)

18054

- with_cpu=v8;

18055

- ;;

18056

sparc*-*-*)

18057

- with_cpu="`echo ${target} | sed 's/-.*$//'`"

18058

+ case ${target} in

18059

+ *-leon-*)

18060

+ with_cpu=leon

18061

+ ;;

18062

+ *-leon[3-9]*)

18063

+ with_cpu=leon3

18064

+ ;;

18065

+ *)

18066

+ with_cpu="`echo ${target} | sed 's/-.*$//'`"

18067

+ ;;

18068

+ esac

18069

;;

18070

esac

18071

18072

@@ -3587,7 +3602,7 @@

18073

case ${val} in

18074

"" | sparc | sparcv9 | sparc64 \

18075

| v7 | cypress \

18076

- | v8 | supersparc | hypersparc | leon \

18077

18078

| sparclite | f930 | f934 | sparclite86x \

18079

| sparclet | tsc701 \

18080

18081

@@ -3745,15 +3760,6 @@

18082

cxx_target_objs="${cxx_target_objs} sh-c.o"

18083

;;

18084

18085

- sparc-leon*-*)

18086

- if test x$with_tune = x ; then

18087

- with_tune=leon;

18088

- fi

18089

-

18090

- # The SPARC port checks this value at compile-time.

18091

- target_cpu_default2="TARGET_CPU_$with_cpu"

18092

- ;;

18093

-

18094

sparc*-*-*)

18095

# Some standard aliases.

18096

case x$with_cpu in

18097

@@ -3765,6 +3771,17 @@

18098

;;

18099

esac

18100

18101

+ if test x$with_tune = x ; then

18102

+ case ${target} in

18103

+ *-leon-*)

18104

+ with_tune=leon

18105

+ ;;

18106

+ *-leon[3-9]*)

18107

+ with_tune=leon3

18108

+ ;;

18109

+ esac

18110

+ fi

18111

+

18112

# The SPARC port checks this value at compile-time.

18113

target_cpu_default2="TARGET_CPU_$with_cpu"

18114

;;

18115

Index: gcc/Makefile.in

18116

===================================================================

18117

--- a/src/gcc/Makefile.in (.../tags/gcc_4_8_2_release)

18118

+++ b/src/gcc/Makefile.in (.../branches/gcc-4_8-branch)

18119

@@ -3037,7 +3037,7 @@

18120

$(TM_H) coretypes.h $(GIMPLE_H) \

18121

$(TREE_PASS_H) $(FLAGS_H) $(EXPR_H) $(BASIC_BLOCK_H) \

18122

$(GGC_H) $(OBSTACK_H) $(PARAMS_H) $(CPPLIB_H) $(PARAMS_H) \

18123

- $(GIMPLE_PRETTY_PRINT_H) langhooks.h

18124

+ $(GIMPLE_PRETTY_PRINT_H) langhooks.h $(OPTABS_H)

18125

tree-complex.o : tree-complex.c $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TREE_H) \

18126

$(TM_H) $(FLAGS_H) $(TREE_FLOW_H) $(GIMPLE_H) \

18127

tree-iterator.h $(TREE_PASS_H) tree-ssa-propagate.h

18128

@@ -3276,12 +3276,12 @@

18129

$(TM_H) $(RTL_H) $(REGS_H) insn-config.h insn-codes.h $(DF_H) \

18130

$(RECOG_H) output.h addresses.h $(REGS_H) hard-reg-set.h $(FLAGS_H) \

18131

$(FUNCTION_H) $(EXPR_H) $(BASIC_BLOCK_H) $(TM_P_H) $(EXCEPT_H) \

18132

- ira.h rtl-error.h $(LRA_INT_H)

18133

+ ira.h rtl-error.h $(LRA_INT_H) $(OPTABS_H)

18134

lra-eliminations.o : lra-eliminations.c $(CONFIG_H) $(SYSTEM_H) coretypes.h \

18135

$(TM_H) $(RTL_H) $(REGS_H) insn-config.h $(DF_H) \

18136

$(RECOG_H) output.h $(REGS_H) hard-reg-set.h $(FLAGS_H) $(FUNCTION_H) \

18137

$(EXPR_H) $(BASIC_BLOCK_H) $(TM_P_H) $(EXCEPT_H) ira.h \

18138

- rtl-error.h $(LRA_INT_H)

18139

+ rtl-error.h $(LRA_INT_H) $(OPTABS_H)

18140

lra-lives.o : lra-lives.c $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TM_H) \

18141

$(RTL_H) $(REGS_H) insn-config.h $(DF_H) \

18142

$(RECOG_H) output.h $(REGS_H) hard-reg-set.h $(FLAGS_H) $(FUNCTION_H) \

18143

Index: gcc/gimple.c

18144

===================================================================

18145

--- a/src/gcc/gimple.c (.../tags/gcc_4_8_2_release)

18146

+++ b/src/gcc/gimple.c (.../branches/gcc-4_8-branch)

18147

@@ -3841,42 +3841,46 @@

18148

18149

/* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and

18150

VISIT_ADDR if non-NULL on loads, store and address-taken operands

18151

- passing the STMT, the base of the operand and DATA to it. The base

18152

- will be either a decl, an indirect reference (including TARGET_MEM_REF)

18153

- or the argument of an address expression.

18154

+ passing the STMT, the base of the operand, the operand itself containing

18155

+ the base and DATA to it. The base will be either a decl, an indirect

18156

+ reference (including TARGET_MEM_REF) or the argument of an address

18157

+ expression.

18158

Returns the results of these callbacks or'ed. */

18159

18160

bool

18161

walk_stmt_load_store_addr_ops (gimple stmt, void *data,

18162

- bool (*visit_load)(gimple, tree, void *),

18163

- bool (*visit_store)(gimple, tree, void *),

18164

- bool (*visit_addr)(gimple, tree, void *))

18165

+ walk_stmt_load_store_addr_fn visit_load,

18166

+ walk_stmt_load_store_addr_fn visit_store,

18167

+ walk_stmt_load_store_addr_fn visit_addr)

18168

{

18169

bool ret = false;

18170

unsigned i;

18171

if (gimple_assign_single_p (stmt))

18172

{

18173

- tree lhs, rhs;

18174

+ tree lhs, rhs, arg;

18175

if (visit_store)

18176

{

18177

- lhs = get_base_loadstore (gimple_assign_lhs (stmt));

18178

+ arg = gimple_assign_lhs (stmt);

18179

+ lhs = get_base_loadstore (arg);

18180

if (lhs)

18181

- ret |= visit_store (stmt, lhs, data);

18182

+ ret |= visit_store (stmt, lhs, arg, data);

18183

}

18184

- rhs = gimple_assign_rhs1 (stmt);

18185

+ arg = gimple_assign_rhs1 (stmt);

18186

+ rhs = arg;

18187

while (handled_component_p (rhs))

18188

rhs = TREE_OPERAND (rhs, 0);

18189

if (visit_addr)

18190

{

18191

if (TREE_CODE (rhs) == ADDR_EXPR)

18192

- ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);

18193

+ ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), arg, data);

18194

else if (TREE_CODE (rhs) == TARGET_MEM_REF

18195

&& TREE_CODE (TMR_BASE (rhs)) == ADDR_EXPR)

18196

- ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (rhs), 0), data);

18197

+ ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (rhs), 0), arg,

18198

+ data);

18199

else if (TREE_CODE (rhs) == OBJ_TYPE_REF

18200

&& TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs)) == ADDR_EXPR)

18201

ret |= visit_addr (stmt, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs),

18202

- 0), data);

18203

+ 0), arg, data);

18204

else if (TREE_CODE (rhs) == CONSTRUCTOR)

18205

{

18206

unsigned int ix;

18207

@@ -3884,23 +3888,23 @@

18208

18209

FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (rhs), ix, val)

18210

if (TREE_CODE (val) == ADDR_EXPR)

18211

- ret |= visit_addr (stmt, TREE_OPERAND (val, 0), data);

18212

+ ret |= visit_addr (stmt, TREE_OPERAND (val, 0), arg, data);

18213

else if (TREE_CODE (val) == OBJ_TYPE_REF

18214

&& TREE_CODE (OBJ_TYPE_REF_OBJECT (val)) == ADDR_EXPR)

18215

ret |= visit_addr (stmt,

18216

TREE_OPERAND (OBJ_TYPE_REF_OBJECT (val),

18217

- 0), data);

18218

+ 0), arg, data);

18219

}

18220

lhs = gimple_assign_lhs (stmt);

18221

if (TREE_CODE (lhs) == TARGET_MEM_REF

18222

&& TREE_CODE (TMR_BASE (lhs)) == ADDR_EXPR)

18223

- ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (lhs), 0), data);

18224

+ ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (lhs), 0), lhs, data);

18225

}

18226

if (visit_load)

18227

{

18228

rhs = get_base_loadstore (rhs);

18229

if (rhs)

18230

- ret |= visit_load (stmt, rhs, data);

18231

+ ret |= visit_load (stmt, rhs, arg, data);

18232

}

18233

}

18234

else if (visit_addr

18235

@@ -3913,17 +3917,17 @@

18236

if (op == NULL_TREE)

18237

;

18238

else if (TREE_CODE (op) == ADDR_EXPR)

18239

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18240

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18241

/* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison

18242

tree with two operands. */

18243

else if (i == 1 && COMPARISON_CLASS_P (op))

18244

{

18245

if (TREE_CODE (TREE_OPERAND (op, 0)) == ADDR_EXPR)

18246

ret |= visit_addr (stmt, TREE_OPERAND (TREE_OPERAND (op, 0),

18247

- 0), data);

18248

+ 0), op, data);

18249

if (TREE_CODE (TREE_OPERAND (op, 1)) == ADDR_EXPR)

18250

ret |= visit_addr (stmt, TREE_OPERAND (TREE_OPERAND (op, 1),

18251

- 0), data);

18252

+ 0), op, data);

18253

}

18254

}

18255

}

18256

@@ -3931,38 +3935,39 @@

18257

{

18258

if (visit_store)

18259

{

18260

- tree lhs = gimple_call_lhs (stmt);

18261

- if (lhs)

18262

+ tree arg = gimple_call_lhs (stmt);

18263

+ if (arg)

18264

{

18265

- lhs = get_base_loadstore (lhs);

18266

+ tree lhs = get_base_loadstore (arg);

18267

if (lhs)

18268

- ret |= visit_store (stmt, lhs, data);

18269

+ ret |= visit_store (stmt, lhs, arg, data);

18270

}

18271

}

18272

if (visit_load || visit_addr)

18273

for (i = 0; i < gimple_call_num_args (stmt); ++i)

18274

{

18275

- tree rhs = gimple_call_arg (stmt, i);

18276

+ tree arg = gimple_call_arg (stmt, i);

18277

if (visit_addr

18278

- && TREE_CODE (rhs) == ADDR_EXPR)

18279

- ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);

18280

+ && TREE_CODE (arg) == ADDR_EXPR)

18281

+ ret |= visit_addr (stmt, TREE_OPERAND (arg, 0), arg, data);

18282

else if (visit_load)

18283

{

18284

- rhs = get_base_loadstore (rhs);

18285

+ tree rhs = get_base_loadstore (arg);

18286

if (rhs)

18287

- ret |= visit_load (stmt, rhs, data);

18288

+ ret |= visit_load (stmt, rhs, arg, data);

18289

}

18290

}

18291

if (visit_addr

18292

&& gimple_call_chain (stmt)

18293

&& TREE_CODE (gimple_call_chain (stmt)) == ADDR_EXPR)

18294

ret |= visit_addr (stmt, TREE_OPERAND (gimple_call_chain (stmt), 0),

18295

- data);

18296

+ gimple_call_chain (stmt), data);

18297

if (visit_addr

18298

&& gimple_call_return_slot_opt_p (stmt)

18299

&& gimple_call_lhs (stmt) != NULL_TREE

18300

&& TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))

18301

- ret |= visit_addr (stmt, gimple_call_lhs (stmt), data);

18302

+ ret |= visit_addr (stmt, gimple_call_lhs (stmt),

18303

+ gimple_call_lhs (stmt), data);

18304

}

18305

else if (gimple_code (stmt) == GIMPLE_ASM)

18306

{

18307

@@ -3978,7 +3983,7 @@

18308

tree link = gimple_asm_output_op (stmt, i);

18309

tree op = get_base_loadstore (TREE_VALUE (link));

18310

if (op && visit_store)

18311

- ret |= visit_store (stmt, op, data);

18312

+ ret |= visit_store (stmt, op, TREE_VALUE (link), data);

18313

if (visit_addr)

18314

{

18315

constraint = TREE_STRING_POINTER

18316

@@ -3987,7 +3992,7 @@

18317

parse_output_constraint (&constraint, i, 0, 0, &allows_mem,

18318

&allows_reg, &is_inout);

18319

if (op && !allows_reg && allows_mem)

18320

- ret |= visit_addr (stmt, op, data);

18321

+ ret |= visit_addr (stmt, op, TREE_VALUE (link), data);

18322

}

18323

}

18324

if (visit_load || visit_addr)

18325

@@ -3997,14 +4002,14 @@

18326

tree op = TREE_VALUE (link);

18327

if (visit_addr

18328

&& TREE_CODE (op) == ADDR_EXPR)

18329

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18330

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18331

else if (visit_load || visit_addr)

18332

{

18333

op = get_base_loadstore (op);

18334

if (op)

18335

{

18336

if (visit_load)

18337

- ret |= visit_load (stmt, op, data);

18338

+ ret |= visit_load (stmt, op, TREE_VALUE (link), data);

18339

if (visit_addr)

18340

{

18341

constraint = TREE_STRING_POINTER

18342

@@ -4013,7 +4018,8 @@

18343

0, oconstraints,

18344

&allows_mem, &allows_reg);

18345

if (!allows_reg && allows_mem)

18346

- ret |= visit_addr (stmt, op, data);

18347

+ ret |= visit_addr (stmt, op, TREE_VALUE (link),

18348

+ data);

18349

}

18350

}

18351

}

18352

@@ -4026,12 +4032,12 @@

18353

{

18354

if (visit_addr

18355

&& TREE_CODE (op) == ADDR_EXPR)

18356

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18357

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18358

else if (visit_load)

18359

{

18360

- op = get_base_loadstore (op);

18361

- if (op)

18362

- ret |= visit_load (stmt, op, data);

18363

+ tree base = get_base_loadstore (op);

18364

+ if (base)

18365

+ ret |= visit_load (stmt, base, op, data);

18366

}

18367

}

18368

}

18369

@@ -4042,7 +4048,7 @@

18370

{

18371

tree op = PHI_ARG_DEF (stmt, i);

18372

if (TREE_CODE (op) == ADDR_EXPR)

18373

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18374

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18375

}

18376

}

18377

else if (visit_addr

18378

@@ -4050,7 +4056,7 @@

18379

{

18380

tree op = gimple_goto_dest (stmt);

18381

if (TREE_CODE (op) == ADDR_EXPR)

18382

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18383

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18384

}

18385

18386

return ret;

18387

@@ -4061,8 +4067,8 @@

18388

18389

bool

18390

walk_stmt_load_store_ops (gimple stmt, void *data,

18391

- bool (*visit_load)(gimple, tree, void *),

18392

- bool (*visit_store)(gimple, tree, void *))

18393

+ walk_stmt_load_store_addr_fn visit_load,

18394

+ walk_stmt_load_store_addr_fn visit_store)

18395

{

18396

return walk_stmt_load_store_addr_ops (stmt, data,

18397

visit_load, visit_store, NULL);

18398

@@ -4071,8 +4077,7 @@

18399

/* Helper for gimple_ior_addresses_taken_1. */

18400

18401

static bool

18402

-gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED,

18403

- tree addr, void *data)

18404

+gimple_ior_addresses_taken_1 (gimple, tree addr, tree, void *data)

18405

{

18406

bitmap addresses_taken = (bitmap)data;

18407

addr = get_base_address (addr);

18408

Index: gcc/gimple.h

18409

===================================================================

18410

--- a/src/gcc/gimple.h (.../tags/gcc_4_8_2_release)

18411

+++ b/src/gcc/gimple.h (.../branches/gcc-4_8-branch)

18412

@@ -888,13 +888,14 @@

18413

extern alias_set_type gimple_get_alias_set (tree);

18414

extern void count_uses_and_derefs (tree, gimple, unsigned *, unsigned *,

18415

unsigned *);

18416

+typedef bool (*walk_stmt_load_store_addr_fn) (gimple, tree, tree, void *);

18417

extern bool walk_stmt_load_store_addr_ops (gimple, void *,

18418

- bool (*)(gimple, tree, void *),

18419

- bool (*)(gimple, tree, void *),

18420

- bool (*)(gimple, tree, void *));

18421

+ walk_stmt_load_store_addr_fn,

18422

+ walk_stmt_load_store_addr_fn,

18423

+ walk_stmt_load_store_addr_fn);

18424

extern bool walk_stmt_load_store_ops (gimple, void *,

18425

- bool (*)(gimple, tree, void *),

18426

- bool (*)(gimple, tree, void *));

18427

+ walk_stmt_load_store_addr_fn,

18428

+ walk_stmt_load_store_addr_fn);

18429

extern bool gimple_ior_addresses_taken (bitmap, gimple);

18430

extern bool gimple_call_builtin_p (gimple, enum built_in_class);

18431

extern bool gimple_call_builtin_p (gimple, enum built_in_function);

18432

Index: gcc/tree-cfg.c

18433

===================================================================

18434

--- a/src/gcc/tree-cfg.c (.../tags/gcc_4_8_2_release)

18435

+++ b/src/gcc/tree-cfg.c (.../branches/gcc-4_8-branch)

18436

@@ -104,7 +104,6 @@

18437

static void assign_discriminator (location_t, basic_block);

18438

static edge gimple_redirect_edge_and_branch (edge, basic_block);

18439

static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);

18440

-static unsigned int split_critical_edges (void);

18441

18442

/* Various helpers. */

18443

static inline bool stmt_starts_bb_p (gimple, gimple);

18444

@@ -3513,11 +3512,10 @@

18445

case PLUS_EXPR:

18446

case MINUS_EXPR:

18447

{

18448

- /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.

18449

- ??? This just makes the checker happy and may not be what is

18450

- intended. */

18451

- if (TREE_CODE (lhs_type) == VECTOR_TYPE

18452

- && POINTER_TYPE_P (TREE_TYPE (lhs_type)))

18453

+ tree lhs_etype = lhs_type;

18454

+ tree rhs1_etype = rhs1_type;

18455

+ tree rhs2_etype = rhs2_type;

18456

+ if (TREE_CODE (lhs_type) == VECTOR_TYPE)

18457

{

18458

if (TREE_CODE (rhs1_type) != VECTOR_TYPE

18459

|| TREE_CODE (rhs2_type) != VECTOR_TYPE)

18460

@@ -3525,22 +3523,13 @@

18461

error ("invalid non-vector operands to vector valued plus");

18462

return true;

18463

}

18464

- lhs_type = TREE_TYPE (lhs_type);

18465

- rhs1_type = TREE_TYPE (rhs1_type);

18466

- rhs2_type = TREE_TYPE (rhs2_type);

18467

- /* PLUS_EXPR is commutative, so we might end up canonicalizing

18468

- the pointer to 2nd place. */

18469

- if (POINTER_TYPE_P (rhs2_type))

18470

- {

18471

- tree tem = rhs1_type;

18472

- rhs1_type = rhs2_type;

18473

- rhs2_type = tem;

18474

- }

18475

- goto do_pointer_plus_expr_check;

18476

+ lhs_etype = TREE_TYPE (lhs_type);

18477

+ rhs1_etype = TREE_TYPE (rhs1_type);

18478

+ rhs2_etype = TREE_TYPE (rhs2_type);

18479

}

18480

- if (POINTER_TYPE_P (lhs_type)

18481

- || POINTER_TYPE_P (rhs1_type)

18482

- || POINTER_TYPE_P (rhs2_type))

18483

+ if (POINTER_TYPE_P (lhs_etype)

18484

+ || POINTER_TYPE_P (rhs1_etype)

18485

+ || POINTER_TYPE_P (rhs2_etype))

18486

{

18487

error ("invalid (pointer) operands to plus/minus");

18488

return true;

18489

@@ -3552,7 +3541,6 @@

18490

18491

case POINTER_PLUS_EXPR:

18492

{

18493

-do_pointer_plus_expr_check:

18494

if (!POINTER_TYPE_P (rhs1_type)

18495

|| !useless_type_conversion_p (lhs_type, rhs1_type)

18496

|| !ptrofftype_p (rhs2_type))

18497

@@ -7658,7 +7646,7 @@

18498

18499

/* Split all critical edges. */

18500

18501

-static unsigned int

18502

+unsigned int

18503

split_critical_edges (void)

18504

{

18505

basic_block bb;

18506

Index: gcc/passes.c

18507

===================================================================

18508

--- a/src/gcc/passes.c (.../tags/gcc_4_8_2_release)

18509

+++ b/src/gcc/passes.c (.../branches/gcc-4_8-branch)

18510

@@ -1398,6 +1398,7 @@

18511

/* After CCP we rewrite no longer addressed locals into SSA

18512

form if possible. */

18513

NEXT_PASS (pass_forwprop);

18514

+ NEXT_PASS (pass_object_sizes);

18515

/* pass_build_alias is a dummy pass that ensures that we

18516

execute TODO_rebuild_alias at this point. */

18517

NEXT_PASS (pass_build_alias);

18518

@@ -1435,7 +1436,6 @@

18519

NEXT_PASS (pass_dce);

18520

NEXT_PASS (pass_forwprop);

18521

NEXT_PASS (pass_phiopt);

18522

- NEXT_PASS (pass_object_sizes);

18523

NEXT_PASS (pass_strlen);

18524

NEXT_PASS (pass_ccp);

18525

/* After CCP we rewrite no longer addressed locals into SSA

18526

Index: gcc/tree-ssa-reassoc.c

18527

===================================================================

18528

--- a/src/gcc/tree-ssa-reassoc.c (.../tags/gcc_4_8_2_release)

18529

+++ b/src/gcc/tree-ssa-reassoc.c (.../branches/gcc-4_8-branch)

18530

@@ -1980,8 +1980,15 @@

18531

18532

tem = fold_convert_loc (loc, optype, tem);

18533

gsi = gsi_for_stmt (stmt);

18534

- tem = force_gimple_operand_gsi (&gsi, tem, true, NULL_TREE, true,

18535

- GSI_SAME_STMT);

18536

+ /* In rare cases range->exp can be equal to lhs of stmt.

18537

+ In that case we have to insert after the stmt rather then before

18538

+ it. */

18539

+ if (op == range->exp)

18540

+ tem = force_gimple_operand_gsi (&gsi, tem, true, NULL_TREE, false,

18541

+ GSI_SAME_STMT);

18542

+ else

18543

+ tem = force_gimple_operand_gsi (&gsi, tem, true, NULL_TREE, true,

18544

+ GSI_SAME_STMT);

18545

18546

/* If doing inter-bb range test optimization, update the

18547

stmts immediately. Start with changing the first range test

18548

Index: gcc/config/s390/s390.c

18549

===================================================================

18550

--- a/src/gcc/config/s390/s390.c (.../tags/gcc_4_8_2_release)

18551

+++ b/src/gcc/config/s390/s390.c (.../branches/gcc-4_8-branch)

18552

@@ -407,6 +407,65 @@

18553

bytes on a z10 (or higher) CPU. */

18554

#define PREDICT_DISTANCE (TARGET_Z10 ? 384 : 2048)

18555

18556

+static const int s390_hotpatch_trampoline_halfwords_default = 12;

18557

+static const int s390_hotpatch_trampoline_halfwords_max = 1000000;

18558

+static int s390_hotpatch_trampoline_halfwords = -1;

18559

+

18560

+/* Return the argument of the given hotpatch attribute or the default value if

18561

+ no argument is present. */

18562

+

18563

+static inline int

18564

+get_hotpatch_attribute (tree hotpatch_attr)

18565

+{

18566

+ const_tree args;

18567

+

18568

+ args = TREE_VALUE (hotpatch_attr);

18569

+

18570

+ return (args) ?

18571

+ TREE_INT_CST_LOW (TREE_VALUE (args)):

18572

+ s390_hotpatch_trampoline_halfwords_default;

18573

+}

18574

+

18575

+/* Check whether the hotpatch attribute is applied to a function and, if it has

18576

+ an argument, the argument is valid. */

18577

+

18578

+static tree

18579

+s390_handle_hotpatch_attribute (tree *node, tree name, tree args,

18580

+ int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)

18581

+{

18582

+ if (TREE_CODE (*node) != FUNCTION_DECL)

18583

+ {

18584

+ warning (OPT_Wattributes, "%qE attribute only applies to functions",

18585

+ name);

18586

+ *no_add_attrs = true;

18587

+ }

18588

+ else if (args)

18589

+ {

18590

+ tree expr = TREE_VALUE (args);

18591

+

18592

+ if (TREE_CODE (expr) != INTEGER_CST

18593

+ || !INTEGRAL_TYPE_P (TREE_TYPE (expr))

18594

+ || TREE_INT_CST_HIGH (expr) != 0

18595

+ || TREE_INT_CST_LOW (expr) > (unsigned int)

18596

+ s390_hotpatch_trampoline_halfwords_max)

18597

+ {

18598

+ error ("requested %qE attribute is not a non-negative integer"

18599

+ " constant or too large (max. %d)", name,

18600

+ s390_hotpatch_trampoline_halfwords_max);

18601

+ *no_add_attrs = true;

18602

+ }

18603

+ }

18604

+

18605

+ return NULL_TREE;

18606

+}

18607

+

18608

+static const struct attribute_spec s390_attribute_table[] = {

18609

+ { "hotpatch", 0, 1, true, false, false, s390_handle_hotpatch_attribute, false

18610

+ },

18611

+ /* End element. */

18612

+ { NULL, 0, 0, false, false, false, NULL, false }

18613

+};

18614

+

18615

/* Return the alignment for LABEL. We default to the -falign-labels

18616

value except for the literal pool base label. */

18617

int

18618

@@ -883,7 +942,8 @@

18619

{

18620

/* For CCRAWmode put the required cc mask into the second

18621

operand. */

18622

- if (GET_MODE (XVECEXP (*op0, 0, 0)) == CCRAWmode)

18623

+ if (GET_MODE (XVECEXP (*op0, 0, 0)) == CCRAWmode

18624

+ && INTVAL (*op1) >= 0 && INTVAL (*op1) <= 3)

18625

*op1 = gen_rtx_CONST_INT (VOIDmode, 1 << (3 - INTVAL (*op1)));

18626

*op0 = XVECEXP (*op0, 0, 0);

18627

*code = new_code;

18628

@@ -1594,6 +1654,46 @@

18629

static void

18630

s390_option_override (void)

18631

{

18632

+ unsigned int i;

18633

+ cl_deferred_option *opt;

18634

+ vec<cl_deferred_option> *v =

18635

+ (vec<cl_deferred_option> *) s390_deferred_options;

18636

+

18637

+ if (v)

18638

+ FOR_EACH_VEC_ELT (*v, i, opt)

18639

+ {

18640

+ switch (opt->opt_index)

18641

+ {

18642

+ case OPT_mhotpatch:

18643

+ s390_hotpatch_trampoline_halfwords = (opt->value) ?

18644

+ s390_hotpatch_trampoline_halfwords_default : -1;

18645

+ break;

18646

+ case OPT_mhotpatch_:

18647

+ {

18648

+ int val;

18649

+

18650

+ val = integral_argument (opt->arg);

18651

+ if (val == -1)

18652

+ {

18653

+ /* argument is not a plain number */

18654

+ error ("argument to %qs should be a non-negative integer",

18655

+ "-mhotpatch=");

18656

+ break;

18657

+ }

18658

+ else if (val > s390_hotpatch_trampoline_halfwords_max)

18659

+ {

18660

+ error ("argument to %qs is too large (max. %d)",

18661

+ "-mhotpatch=", s390_hotpatch_trampoline_halfwords_max);

18662

+ break;

18663

+ }

18664

+ s390_hotpatch_trampoline_halfwords = val;

18665

+ break;

18666

+ }

18667

+ default:

18668

+ gcc_unreachable ();

18669

+ }

18670

+ }

18671

+

18672

/* Set up function hooks. */

18673

init_machine_status = s390_init_machine_status;

18674

18675

@@ -5311,6 +5411,102 @@

18676

gcc_unreachable ();

18677

}

18678

18679

+/* Returns -1 if the function should not be made hotpatchable. Otherwise it

18680

+ returns a number >= 0 that is the desired size of the hotpatch trampoline

18681

+ in halfwords. */

18682

+

18683

+static int s390_function_num_hotpatch_trampoline_halfwords (tree decl,

18684

+ bool do_warn)

18685

+{

18686

+ tree attr;

18687

+

18688

+ if (DECL_DECLARED_INLINE_P (decl)

18689

+ || DECL_ARTIFICIAL (decl)

18690

+ || MAIN_NAME_P (DECL_NAME (decl)))

18691

+ {

18692

+ /* - Explicitly inlined functions cannot be hotpatched.

18693

+ - Artificial functions need not be hotpatched.

18694

+ - Making the main function hotpatchable is useless. */

18695

+ return -1;

18696

+ }

18697

+ attr = lookup_attribute ("hotpatch", DECL_ATTRIBUTES (decl));

18698

+ if (attr || s390_hotpatch_trampoline_halfwords >= 0)

18699

+ {

18700

+ if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl)))

18701

+ {

18702

+ if (do_warn)

18703

+ warning (OPT_Wattributes, "function %qE with the %qs attribute"

18704

+ " is not hotpatchable", DECL_NAME (decl), "always_inline");

18705

+ return -1;

18706

+ }

18707

+ else

18708

+ {

18709

+ return (attr) ?

18710

+ get_hotpatch_attribute (attr) : s390_hotpatch_trampoline_halfwords;

18711

+ }

18712

+ }

18713

+

18714

+ return -1;

18715

+}

18716

+

18717

+/* Hook to determine if one function can safely inline another. */

18718

+

18719

+static bool

18720

+s390_can_inline_p (tree caller, tree callee)

18721

+{

18722

+ if (s390_function_num_hotpatch_trampoline_halfwords (callee, false) >= 0)

18723

+ return false;

18724

+

18725

+ return default_target_can_inline_p (caller, callee);

18726

+}

18727

+

18728

+/* Write the extra assembler code needed to declare a function properly. */

18729

+

18730

+void

18731

+s390_asm_output_function_label (FILE *asm_out_file, const char *fname,

18732

+ tree decl)

18733

+{

18734

+ int hotpatch_trampoline_halfwords = -1;

18735

+

18736

+ if (decl)

18737

+ {

18738

+ hotpatch_trampoline_halfwords =

18739

+ s390_function_num_hotpatch_trampoline_halfwords (decl, true);

18740

+ if (hotpatch_trampoline_halfwords >= 0

18741

+ && decl_function_context (decl) != NULL_TREE)

18742

+ {

18743

+ warning_at (0, DECL_SOURCE_LOCATION (decl),

18744

+ "hotpatch_prologue is not compatible with nested"

18745

+ " function");

18746

+ hotpatch_trampoline_halfwords = -1;

18747

+ }

18748

+ }

18749

+

18750

+ if (hotpatch_trampoline_halfwords > 0)

18751

+ {

18752

+ int i;

18753

+

18754

+ /* Add a trampoline code area before the function label and initialize it

18755

+ with two-byte nop instructions. This area can be overwritten with code

18756

+ that jumps to a patched version of the function. */

18757

+ for (i = 0; i < hotpatch_trampoline_halfwords; i++)

18758

+ asm_fprintf (asm_out_file, "\tnopr\t%%r7\n");

18759

+ /* Note: The function label must be aligned so that (a) the bytes of the

18760

+ following nop do not cross a cacheline boundary, and (b) a jump address

18761

+ (eight bytes for 64 bit targets, 4 bytes for 32 bit targets) can be

18762

+ stored directly before the label without crossing a cacheline

18763

+ boundary. All this is necessary to make sure the trampoline code can

18764

+ be changed atomically. */

18765

+ }

18766

+

18767

+ ASM_OUTPUT_LABEL (asm_out_file, fname);

18768

+

18769

+ /* Output a four-byte nop if hotpatching is enabled. This can be overwritten

18770

+ atomically with a relative backwards jump to the trampoline area. */

18771

+ if (hotpatch_trampoline_halfwords >= 0)

18772

+ asm_fprintf (asm_out_file, "\tnop\t0\n");

18773

+}

18774

+

18775

/* Output machine-dependent UNSPECs occurring in address constant X

18776

in assembler syntax to stdio stream FILE. Returns true if the

18777

constant X could be recognized, false otherwise. */

18778

@@ -7846,6 +8042,9 @@

18779

{

18780

bb = BASIC_BLOCK (bb_index);

18781

18782

+ if (!bb)

18783

+ continue;

18784

+

18785

FOR_BB_INSNS (bb, insn)

18786

{

18787

rtx ite, cc, pat, target;

18788

@@ -7959,7 +8158,10 @@

18789

if (!result)

18790

return;

18791

18792

- PATTERN (tbegin_insn) = XVECEXP (PATTERN (tbegin_insn), 0, 0);

18793

+ PATTERN (tbegin_insn) = gen_rtx_PARALLEL (VOIDmode,

18794

+ gen_rtvec (2,

18795

+ XVECEXP (PATTERN (tbegin_insn), 0, 0),

18796

+ XVECEXP (PATTERN (tbegin_insn), 0, 1)));

18797

INSN_CODE (tbegin_insn) = -1;

18798

df_insn_rescan (tbegin_insn);

18799

18800

@@ -9568,61 +9770,47 @@

18801

void

18802

s390_expand_tbegin (rtx dest, rtx tdb, rtx retry, bool clobber_fprs_p)

18803

{

18804

- const int CC0 = 1 << 3;

18805

- const int CC1 = 1 << 2;

18806

- const int CC3 = 1 << 0;

18807

- rtx abort_label = gen_label_rtx ();

18808

- rtx leave_label = gen_label_rtx ();

18809

+ rtx retry_plus_two = gen_reg_rtx (SImode);

18810

rtx retry_reg = gen_reg_rtx (SImode);

18811

rtx retry_label = NULL_RTX;

18812

- rtx jump;

18813

- rtx very_unlikely = GEN_INT (REG_BR_PROB_BASE / 100 - 1);

18814

18815

if (retry != NULL_RTX)

18816

{

18817

emit_move_insn (retry_reg, retry);

18818

+ emit_insn (gen_addsi3 (retry_plus_two, retry_reg, const2_rtx));

18819

+ emit_insn (gen_addsi3 (retry_reg, retry_reg, const1_rtx));

18820

retry_label = gen_label_rtx ();

18821

emit_label (retry_label);

18822

}

18823

18824

if (clobber_fprs_p)

18825

- emit_insn (gen_tbegin_1 (tdb,

18826

- gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK)));

18827

+ emit_insn (gen_tbegin_1 (gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK), tdb));

18828

else

18829

- emit_insn (gen_tbegin_nofloat_1 (tdb,

18830

- gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK)));

18831

+ emit_insn (gen_tbegin_nofloat_1 (gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK),

18832

+ tdb));

18833

18834

- jump = s390_emit_jump (abort_label,

18835

- gen_rtx_NE (VOIDmode,

18836

- gen_rtx_REG (CCRAWmode, CC_REGNUM),

18837

- gen_rtx_CONST_INT (VOIDmode, CC0)));

18838

-

18839

- JUMP_LABEL (jump) = abort_label;

18840

- LABEL_NUSES (abort_label) = 1;

18841

- add_reg_note (jump, REG_BR_PROB, very_unlikely);

18842

-

18843

- /* Initialize CC return value. */

18844

- emit_move_insn (dest, const0_rtx);

18845

-

18846

- s390_emit_jump (leave_label, NULL_RTX);

18847

- LABEL_NUSES (leave_label) = 1;

18848

- emit_barrier ();

18849

-

18850

- /* Abort handler code. */

18851

-

18852

- emit_label (abort_label);

18853

+ emit_move_insn (dest, gen_rtx_UNSPEC (SImode,

18854

+ gen_rtvec (1, gen_rtx_REG (CCRAWmode,

18855

+ CC_REGNUM)),

18856

+ UNSPEC_CC_TO_INT));

18857

if (retry != NULL_RTX)

18858

{

18859

+ const int CC0 = 1 << 3;

18860

+ const int CC1 = 1 << 2;

18861

+ const int CC3 = 1 << 0;

18862

+ rtx jump;

18863

rtx count = gen_reg_rtx (SImode);

18864

+ rtx leave_label = gen_label_rtx ();

18865

+

18866

+ /* Exit for success and permanent failures. */

18867

jump = s390_emit_jump (leave_label,

18868

gen_rtx_EQ (VOIDmode,

18869

gen_rtx_REG (CCRAWmode, CC_REGNUM),

18870

- gen_rtx_CONST_INT (VOIDmode, CC1 | CC3)));

18871

- LABEL_NUSES (leave_label) = 2;

18872

- add_reg_note (jump, REG_BR_PROB, very_unlikely);

18873

+ gen_rtx_CONST_INT (VOIDmode, CC0 | CC1 | CC3)));

18874

+ LABEL_NUSES (leave_label) = 1;

18875

18876

/* CC2 - transient failure. Perform retry with ppa. */

18877

- emit_move_insn (count, retry);

18878

+ emit_move_insn (count, retry_plus_two);

18879

emit_insn (gen_subsi3 (count, count, retry_reg));

18880

emit_insn (gen_tx_assist (count));

18881

jump = emit_jump_insn (gen_doloop_si64 (retry_label,

18882

@@ -9630,13 +9818,8 @@

18883

retry_reg));

18884

JUMP_LABEL (jump) = retry_label;

18885

LABEL_NUSES (retry_label) = 1;

18886

+ emit_label (leave_label);

18887

}

18888

-

18889

- emit_move_insn (dest, gen_rtx_UNSPEC (SImode,

18890

- gen_rtvec (1, gen_rtx_REG (CCRAWmode,

18891

- CC_REGNUM)),

18892

- UNSPEC_CC_TO_INT));

18893

- emit_label (leave_label);

18894

}

18895

18896

/* Builtins. */

18897

@@ -9674,6 +9857,9 @@

18898

s390_init_builtins (void)

18899

{

18900

tree ftype, uint64_type;

18901

+ tree returns_twice_attr = tree_cons (get_identifier ("returns_twice"),

18902

+ NULL, NULL);

18903

+ tree noreturn_attr = tree_cons (get_identifier ("noreturn"), NULL, NULL);

18904

18905

/* void foo (void) */

18906

ftype = build_function_type_list (void_type_node, NULL_TREE);

18907

@@ -9684,17 +9870,17 @@

18908

ftype = build_function_type_list (void_type_node, integer_type_node,

18909

NULL_TREE);

18910

add_builtin_function ("__builtin_tabort", ftype,

18911

- S390_BUILTIN_TABORT, BUILT_IN_MD, NULL, NULL_TREE);

18912

+ S390_BUILTIN_TABORT, BUILT_IN_MD, NULL, noreturn_attr);

18913

add_builtin_function ("__builtin_tx_assist", ftype,

18914

S390_BUILTIN_TX_ASSIST, BUILT_IN_MD, NULL, NULL_TREE);

18915

18916

/* int foo (void *) */

18917

ftype = build_function_type_list (integer_type_node, ptr_type_node, NULL_TREE);

18918

add_builtin_function ("__builtin_tbegin", ftype, S390_BUILTIN_TBEGIN,

18919

- BUILT_IN_MD, NULL, NULL_TREE);

18920

+ BUILT_IN_MD, NULL, returns_twice_attr);

18921

add_builtin_function ("__builtin_tbegin_nofloat", ftype,

18922

S390_BUILTIN_TBEGIN_NOFLOAT,

18923

- BUILT_IN_MD, NULL, NULL_TREE);

18924

+ BUILT_IN_MD, NULL, returns_twice_attr);

18925

18926

/* int foo (void *, int) */

18927

ftype = build_function_type_list (integer_type_node, ptr_type_node,

18928

@@ -9702,11 +9888,11 @@

18929

add_builtin_function ("__builtin_tbegin_retry", ftype,

18930

S390_BUILTIN_TBEGIN_RETRY,

18931

BUILT_IN_MD,

18932

- NULL, NULL_TREE);

18933

+ NULL, returns_twice_attr);

18934

add_builtin_function ("__builtin_tbegin_retry_nofloat", ftype,

18935

S390_BUILTIN_TBEGIN_RETRY_NOFLOAT,

18936

BUILT_IN_MD,

18937

- NULL, NULL_TREE);

18938

+ NULL, returns_twice_attr);

18939

18940

/* int foo (void) */

18941

ftype = build_function_type_list (integer_type_node, NULL_TREE);

18942

@@ -11622,6 +11808,12 @@

18943

#undef TARGET_CANONICALIZE_COMPARISON

18944

#define TARGET_CANONICALIZE_COMPARISON s390_canonicalize_comparison

18945

18946

+#undef TARGET_ATTRIBUTE_TABLE

18947

+#define TARGET_ATTRIBUTE_TABLE s390_attribute_table

18948

+

18949

+#undef TARGET_CAN_INLINE_P

18950

+#define TARGET_CAN_INLINE_P s390_can_inline_p

18951

+

18952

struct gcc_target targetm = TARGET_INITIALIZER;

18953

18954

#include "gt-s390.h"

18955

Index: gcc/config/s390/s390.h

18956

===================================================================

18957

--- a/src/gcc/config/s390/s390.h (.../tags/gcc_4_8_2_release)

18958

+++ b/src/gcc/config/s390/s390.h (.../branches/gcc-4_8-branch)

18959

@@ -217,7 +217,7 @@

18960

#define STACK_BOUNDARY 64

18961

18962

/* Allocation boundary (in *bits*) for the code of a function. */

18963

-#define FUNCTION_BOUNDARY 32

18964

+#define FUNCTION_BOUNDARY 64

18965

18966

/* There is no point aligning anything to a rounder boundary than this. */

18967

#define BIGGEST_ALIGNMENT 64

18968

@@ -878,6 +878,9 @@

18969

fputc ('\n', (FILE)); \

18970

} while (0)

18971

18972

+#undef ASM_OUTPUT_FUNCTION_LABEL

18973

+#define ASM_OUTPUT_FUNCTION_LABEL(FILE, NAME, DECL) \

18974

+ s390_asm_output_function_label (FILE, NAME, DECL)

18975

18976

/* Miscellaneous parameters. */

18977

18978

Index: gcc/config/s390/s390.md

18979

===================================================================

18980

--- a/src/gcc/config/s390/s390.md (.../tags/gcc_4_8_2_release)

18981

+++ b/src/gcc/config/s390/s390.md (.../branches/gcc-4_8-branch)

18982

@@ -147,6 +147,7 @@

18983

18984

; Transactional Execution support

18985

UNSPECV_TBEGIN

18986

+ UNSPECV_TBEGIN_TDB

18987

UNSPECV_TBEGINC

18988

UNSPECV_TEND

18989

UNSPECV_TABORT

18990

@@ -9896,9 +9897,10 @@

18991

18992

(define_insn "tbegin_1"

18993

[(set (reg:CCRAW CC_REGNUM)

18994

- (unspec_volatile:CCRAW [(match_operand:BLK 0 "memory_operand" "=Q")

18995

- (match_operand 1 "const_int_operand" " D")]

18996

+ (unspec_volatile:CCRAW [(match_operand 0 "const_int_operand" "D")]

18997

UNSPECV_TBEGIN))

18998

+ (set (match_operand:BLK 1 "memory_operand" "=Q")

18999

+ (unspec_volatile:BLK [(match_dup 0)] UNSPECV_TBEGIN_TDB))

19000

(clobber (reg:DF 16))

19001

(clobber (reg:DF 17))

19002

(clobber (reg:DF 18))

19003

@@ -9917,18 +9919,19 @@

19004

(clobber (reg:DF 31))]

19005

; CONST_OK_FOR_CONSTRAINT_P does not work with D constraint since D is

19006

; not supposed to be used for immediates (see genpreds.c).

19007

- "TARGET_HTM && INTVAL (operands[1]) >= 0 && INTVAL (operands[1]) <= 0xffff"

19008

- "tbegin\t%0,%x1"

19009

+ "TARGET_HTM && INTVAL (operands[0]) >= 0 && INTVAL (operands[0]) <= 0xffff"

19010

+ "tbegin\t%1,%x0"

19011

[(set_attr "op_type" "SIL")])

19012

19013

; Same as above but without the FPR clobbers

19014

(define_insn "tbegin_nofloat_1"

19015

[(set (reg:CCRAW CC_REGNUM)

19016

- (unspec_volatile:CCRAW [(match_operand:BLK 0 "memory_operand" "=Q")

19017

- (match_operand 1 "const_int_operand" " D")]

19018

- UNSPECV_TBEGIN))]

19019

- "TARGET_HTM && INTVAL (operands[1]) >= 0 && INTVAL (operands[1]) <= 0xffff"

19020

- "tbegin\t%0,%x1"

19021

+ (unspec_volatile:CCRAW [(match_operand 0 "const_int_operand" "D")]

19022

+ UNSPECV_TBEGIN))

19023

+ (set (match_operand:BLK 1 "memory_operand" "=Q")

19024

+ (unspec_volatile:BLK [(match_dup 0)] UNSPECV_TBEGIN_TDB))]

19025

+ "TARGET_HTM && INTVAL (operands[0]) >= 0 && INTVAL (operands[0]) <= 0xffff"

19026

+ "tbegin\t%1,%x0"

19027

[(set_attr "op_type" "SIL")])

19028

19029

19030

@@ -10012,15 +10015,12 @@

19031

; Transaction perform processor assist

19032

19033

(define_expand "tx_assist"

19034

- [(set (match_dup 1) (const_int 0))

19035

- (unspec_volatile [(match_operand:SI 0 "register_operand" "")

19036

- (match_dup 1)

19037

+ [(unspec_volatile [(match_operand:SI 0 "register_operand" "")

19038

+ (reg:SI GPR0_REGNUM)

19039

(const_int 1)]

19040

UNSPECV_PPA)]

19041

"TARGET_HTM"

19042

-{

19043

- operands[1] = gen_reg_rtx (SImode);

19044

-})

19045

+ "")

19046

19047

(define_insn "*ppa"

19048

[(unspec_volatile [(match_operand:SI 0 "register_operand" "d")

19049

@@ -10028,5 +10028,5 @@

19050

(match_operand 2 "const_int_operand" "I")]

19051

UNSPECV_PPA)]

19052

"TARGET_HTM && INTVAL (operands[2]) < 16"

19053

- "ppa\t%0,%1,1"

19054

+ "ppa\t%0,%1,%2"

19055

[(set_attr "op_type" "RRF")])

19056

Index: gcc/config/s390/s390.opt

19057

===================================================================

19058

--- a/src/gcc/config/s390/s390.opt (.../tags/gcc_4_8_2_release)

19059

+++ b/src/gcc/config/s390/s390.opt (.../branches/gcc-4_8-branch)

19060

@@ -96,6 +96,14 @@

19061

Target Report RejectNegative Negative(msoft-float) InverseMask(SOFT_FLOAT, HARD_FLOAT)

19062

Enable hardware floating point

19063

19064

+mhotpatch

19065

+Target Report Var(s390_deferred_options) Defer

19066

+Prepend the function label with 12 two-byte Nop instructions, and add a four byte Nop instruction after the label for hotpatching.

19067

+

19068

+mhotpatch=

19069

+Target RejectNegative Report Joined Var(s390_deferred_options) Defer

19070

+Prepend the function label with the given number of two-byte Nop instructions, and add a four byte Nop instruction after the label for hotpatching.

19071

+

19072

mlong-double-128

19073

Target Report RejectNegative Negative(mlong-double-64) Mask(LONG_DOUBLE_128)

19074

Use 128-bit long double

19075

Index: gcc/config/s390/htmxlintrin.h

19076

===================================================================

19077

--- a/src/gcc/config/s390/htmxlintrin.h (.../tags/gcc_4_8_2_release)

19078

+++ b/src/gcc/config/s390/htmxlintrin.h (.../branches/gcc-4_8-branch)

19079

@@ -33,13 +33,20 @@

19080

the IBM XL compiler. For documentation please see the "z/OS XL

19081

C/C++ Programming Guide" publically available on the web. */

19082

19083

-extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

19084

+/* FIXME: __TM_simple_begin and __TM_begin should be marked

19085

+ __always_inline__ as well but this currently produces an error

19086

+ since the tbegin builtins are "returns_twice" and setjmp_call_p

19087

+ (calls.c) therefore identifies the functions as calling setjmp.

19088

+ The tree inliner currently refuses to inline functions calling

19089

+ setjmp. */

19090

+

19091

+long

19092

__TM_simple_begin ()

19093

{

19094

return __builtin_tbegin_nofloat (0);

19095

}

19096

19097

-extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

19098

+long

19099

__TM_begin (void* const tdb)

19100

{

19101

return __builtin_tbegin_nofloat (tdb);

19102

@@ -78,7 +85,7 @@

19103

if (depth != 0)

19104

return depth;

19105

19106

- if (tdb->format == 0)

19107

+ if (tdb->format != 1)

19108

return 0;

19109

return tdb->nesting_depth;

19110

}

19111

@@ -90,7 +97,7 @@

19112

{

19113

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19114

19115

- if (tdb->format == 0)

19116

+ if (tdb->format != 1)

19117

return 0;

19118

19119

return !!(tdb->abort_code >= _HTM_FIRST_USER_ABORT_CODE);

19120

@@ -101,7 +108,7 @@

19121

{

19122

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19123

19124

- if (tdb->format == 0)

19125

+ if (tdb->format != 1)

19126

return 0;

19127

19128

if (tdb->abort_code >= _HTM_FIRST_USER_ABORT_CODE)

19129

@@ -117,7 +124,7 @@

19130

{

19131

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19132

19133

- return (tdb->format == 0

19134

+ return (tdb->format == 1

19135

&& (tdb->abort_code == 4 /* unfiltered program interruption */

19136

|| tdb->abort_code == 11 /* restricted instruction */));

19137

}

19138

@@ -127,7 +134,7 @@

19139

{

19140

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19141

19142

- return (tdb->format == 0

19143

+ return (tdb->format == 1

19144

&& (tdb->abort_code == 7 /* fetch overflow */

19145

|| tdb->abort_code == 8 /* store overflow */));

19146

}

19147

@@ -137,7 +144,7 @@

19148

{

19149

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19150

19151

- return tdb->format == 0 && tdb->abort_code == 13; /* depth exceeded */

19152

+ return tdb->format == 1 && tdb->abort_code == 13; /* depth exceeded */

19153

}

19154

19155

extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

19156

@@ -145,7 +152,7 @@

19157

{

19158

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19159

19160

- return (tdb->format == 0

19161

+ return (tdb->format == 1

19162

&& (tdb->abort_code == 9 /* fetch conflict */

19163

|| tdb->abort_code == 10 /* store conflict */));

19164

}

19165

Index: gcc/config/s390/s390-protos.h

19166

===================================================================

19167

--- a/src/gcc/config/s390/s390-protos.h (.../tags/gcc_4_8_2_release)

19168

+++ b/src/gcc/config/s390/s390-protos.h (.../branches/gcc-4_8-branch)

19169

@@ -110,5 +110,6 @@

19170

extern int s390_branch_condition_mask (rtx);

19171

extern int s390_compare_and_branch_condition_mask (rtx);

19172

extern bool s390_extzv_shift_ok (int, int, unsigned HOST_WIDE_INT);

19173

+extern void s390_asm_output_function_label (FILE *, const char *, tree);

19174

19175

#endif /* RTX_CODE */

19176

Index: gcc/config/sparc/t-rtems

19177

===================================================================

19178

--- a/src/gcc/config/sparc/t-rtems (.../tags/gcc_4_8_2_release)

19179

+++ b/src/gcc/config/sparc/t-rtems (.../branches/gcc-4_8-branch)

19180

@@ -17,6 +17,6 @@

19181

# <http://www.gnu.org/licenses/>.

19182

#

19183

19184

-MULTILIB_OPTIONS = msoft-float mcpu=v8

19185

-MULTILIB_DIRNAMES = soft v8

19186

+MULTILIB_OPTIONS = msoft-float mcpu=v8/mcpu=leon3

19187

+MULTILIB_DIRNAMES = soft v8 leon3

19188

MULTILIB_MATCHES = msoft-float=mno-fpu

19189

Index: gcc/config/sparc/sparc.md

19190

===================================================================

19191

--- a/src/gcc/config/sparc/sparc.md (.../tags/gcc_4_8_2_release)

19192

+++ b/src/gcc/config/sparc/sparc.md (.../branches/gcc-4_8-branch)

19193

@@ -206,7 +206,7 @@

19194

;; 'f' for all DF/TFmode values, including those that are specific to the v8.

19195

19196

;; Attribute for cpu type.

19197

-;; These must match the values for enum processor_type in sparc.h.

19198

+;; These must match the values of the enum processor_type in sparc-opts.h.

19199

(define_attr "cpu"

19200

"v7,

19201

cypress,

19202

@@ -214,6 +214,7 @@

19203

supersparc,

19204

hypersparc,

19205

leon,

19206

+ leon3,

19207

sparclite,

19208

f930,

19209

f934,

19210

@@ -5548,7 +5549,7 @@

19211

[(set (match_operand:DF 0 "register_operand" "=e")

19212

(mult:DF (float_extend:DF (match_operand:SF 1 "register_operand" "f"))

19213

(float_extend:DF (match_operand:SF 2 "register_operand" "f"))))]

19214

- "(TARGET_V8 || TARGET_V9) && TARGET_FPU"

19215

+ "(TARGET_V8 || TARGET_V9) && TARGET_FPU && !sparc_fix_ut699"

19216

"fsmuld\t%1, %2, %0"

19217

[(set_attr "type" "fpmul")

19218

(set_attr "fptype" "double")])

19219

@@ -5577,20 +5578,37 @@

19220

"fdivq\t%1, %2, %0"

19221

[(set_attr "type" "fpdivd")])

19222

19223

-(define_insn "divdf3"

19224

+(define_expand "divdf3"

19225

[(set (match_operand:DF 0 "register_operand" "=e")

19226

(div:DF (match_operand:DF 1 "register_operand" "e")

19227

(match_operand:DF 2 "register_operand" "e")))]

19228

"TARGET_FPU"

19229

+ "")

19230

+

19231

+(define_insn "*divdf3_nofix"

19232

+ [(set (match_operand:DF 0 "register_operand" "=e")

19233

+ (div:DF (match_operand:DF 1 "register_operand" "e")

19234

+ (match_operand:DF 2 "register_operand" "e")))]

19235

+ "TARGET_FPU && !sparc_fix_ut699"

19236

"fdivd\t%1, %2, %0"

19237

[(set_attr "type" "fpdivd")

19238

(set_attr "fptype" "double")])

19239

19240

+(define_insn "*divdf3_fix"

19241

+ [(set (match_operand:DF 0 "register_operand" "=e")

19242

+ (div:DF (match_operand:DF 1 "register_operand" "e")

19243

+ (match_operand:DF 2 "register_operand" "e")))]

19244

+ "TARGET_FPU && sparc_fix_ut699"

19245

+ "fdivd\t%1, %2, %0\n\tstd\t%0, [%%sp-8]"

19246

+ [(set_attr "type" "fpdivd")

19247

+ (set_attr "fptype" "double")

19248

+ (set_attr "length" "2")])

19249

+

19250

(define_insn "divsf3"

19251

[(set (match_operand:SF 0 "register_operand" "=f")

19252

(div:SF (match_operand:SF 1 "register_operand" "f")

19253

(match_operand:SF 2 "register_operand" "f")))]

19254

- "TARGET_FPU"

19255

+ "TARGET_FPU && !sparc_fix_ut699"

19256

"fdivs\t%1, %2, %0"

19257

[(set_attr "type" "fpdivs")])

19258

19259

@@ -5791,18 +5809,33 @@

19260

"fsqrtq\t%1, %0"

19261

[(set_attr "type" "fpsqrtd")])

19262

19263

-(define_insn "sqrtdf2"

19264

+(define_expand "sqrtdf2"

19265

[(set (match_operand:DF 0 "register_operand" "=e")

19266

(sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

19267

"TARGET_FPU"

19268

+ "")

19269

+

19270

+(define_insn "*sqrtdf2_nofix"

19271

+ [(set (match_operand:DF 0 "register_operand" "=e")

19272

+ (sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

19273

+ "TARGET_FPU && !sparc_fix_ut699"

19274

"fsqrtd\t%1, %0"

19275

[(set_attr "type" "fpsqrtd")

19276

(set_attr "fptype" "double")])

19277

19278

+(define_insn "*sqrtdf2_fix"

19279

+ [(set (match_operand:DF 0 "register_operand" "=e")

19280

+ (sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

19281

+ "TARGET_FPU && sparc_fix_ut699"

19282

+ "fsqrtd\t%1, %0\n\tstd\t%0, [%%sp-8]"

19283

+ [(set_attr "type" "fpsqrtd")

19284

+ (set_attr "fptype" "double")

19285

+ (set_attr "length" "2")])

19286

+

19287

(define_insn "sqrtsf2"

19288

[(set (match_operand:SF 0 "register_operand" "=f")

19289

(sqrt:SF (match_operand:SF 1 "register_operand" "f")))]

19290

- "TARGET_FPU"

19291

+ "TARGET_FPU && !sparc_fix_ut699"

19292

"fsqrts\t%1, %0"

19293

[(set_attr "type" "fpsqrts")])

19294

19295

Index: gcc/config/sparc/t-sparc

19296

===================================================================

19297

--- a/src/gcc/config/sparc/t-sparc (.../tags/gcc_4_8_2_release)

19298

+++ b/src/gcc/config/sparc/t-sparc (.../branches/gcc-4_8-branch)

19299

@@ -23,7 +23,7 @@

19300

insn-codes.h conditions.h output.h $(INSN_ATTR_H) $(FLAGS_H) \

19301

$(FUNCTION_H) $(EXCEPT_H) $(EXPR_H) $(OPTABS_H) $(RECOG_H) \

19302

$(DIAGNOSTIC_CORE_H) $(GGC_H) $(TM_P_H) debug.h $(TARGET_H) \

19303

- $(TARGET_DEF_H) $(COMMON_TARGET_H) $(GIMPLE_H) \

19304

+ $(TARGET_DEF_H) $(COMMON_TARGET_H) $(GIMPLE_H) $(TREE_PASS_H) \

19305

langhooks.h reload.h $(PARAMS_H) $(DF_H) $(OPTS_H) \

19306

gt-sparc.h

19307

19308

Index: gcc/config/sparc/sparc.opt

19309

===================================================================

19310

--- a/src/gcc/config/sparc/sparc.opt (.../tags/gcc_4_8_2_release)

19311

+++ b/src/gcc/config/sparc/sparc.opt (.../branches/gcc-4_8-branch)

19312

@@ -146,6 +146,9 @@

19313

Enum(sparc_processor_type) String(leon) Value(PROCESSOR_LEON)

19314

19315

EnumValue

19316

+Enum(sparc_processor_type) String(leon3) Value(PROCESSOR_LEON3)

19317

+

19318

+EnumValue

19319

Enum(sparc_processor_type) String(sparclite) Value(PROCESSOR_SPARCLITE)

19320

19321

EnumValue

19322

@@ -201,9 +204,19 @@

19323

Enable workaround for single erratum of AT697F processor

19324

(corresponding to erratum #13 of AT697E processor)

19325

19326

+mfix-ut699

19327

+Target Report RejectNegative Var(sparc_fix_ut699)

19328

+Enable workarounds for the errata of the UT699 processor

19329

+

19330

Mask(LONG_DOUBLE_128)

19331

;; Use 128-bit long double

19332

19333

+Mask(LEON)

19334

+;; Generate code for LEON

19335

+

19336

+Mask(LEON3)

19337

+;; Generate code for LEON3

19338

+

19339

Mask(SPARCLITE)

19340

;; Generate code for SPARClite

19341

19342

Index: gcc/config/sparc/sync.md

19343

===================================================================

19344

--- a/src/gcc/config/sparc/sync.md (.../tags/gcc_4_8_2_release)

19345

+++ b/src/gcc/config/sparc/sync.md (.../branches/gcc-4_8-branch)

19346

@@ -161,7 +161,8 @@

19347

(match_operand:SI 5 "const_int_operand" "") ;; is_weak

19348

(match_operand:SI 6 "const_int_operand" "") ;; mod_s

19349

(match_operand:SI 7 "const_int_operand" "")] ;; mod_f

19350

- "TARGET_V9 && (<MODE>mode != DImode || TARGET_ARCH64 || TARGET_V8PLUS)"

19351

+ "(TARGET_V9 || TARGET_LEON3)

19352

+ && (<MODE>mode != DImode || TARGET_ARCH64 || TARGET_V8PLUS)"

19353

{

19354

sparc_expand_compare_and_swap (operands);

19355

DONE;

19356

@@ -176,7 +177,7 @@

19357

[(match_operand:I48MODE 2 "register_operand" "")

19358

(match_operand:I48MODE 3 "register_operand" "")]

19359

UNSPECV_CAS))])]

19360

- "TARGET_V9"

19361

+ "TARGET_V9 || TARGET_LEON3"

19362

"")

19363

19364

(define_insn "*atomic_compare_and_swap<mode>_1"

19365

@@ -187,7 +188,7 @@

19366

[(match_operand:I48MODE 2 "register_operand" "r")

19367

(match_operand:I48MODE 3 "register_operand" "0")]

19368

UNSPECV_CAS))]

19369

- "TARGET_V9 && (<MODE>mode == SImode || TARGET_ARCH64)"

19370

+ "(TARGET_V9 || TARGET_LEON3) && (<MODE>mode != DImode || TARGET_ARCH64)"

19371

"cas<modesuffix>\t%1, %2, %0"

19372

[(set_attr "type" "multi")])

19373

19374

@@ -220,7 +221,7 @@

19375

(match_operand:SI 1 "memory_operand" "")

19376

(match_operand:SI 2 "register_operand" "")

19377

(match_operand:SI 3 "const_int_operand" "")]

19378

- "TARGET_V8 || TARGET_V9"

19379

+ "(TARGET_V8 || TARGET_V9) && !sparc_fix_ut699"

19380

{

19381

enum memmodel model = (enum memmodel) INTVAL (operands[3]);

19382

19383

@@ -236,7 +237,7 @@

19384

UNSPECV_SWAP))

19385

(set (match_dup 1)

19386

(match_operand:SI 2 "register_operand" "0"))]

19387

- "TARGET_V8 || TARGET_V9"

19388

+ "(TARGET_V8 || TARGET_V9) && !sparc_fix_ut699"

19389

"swap\t%1, %0"

19390

[(set_attr "type" "multi")])

19391

19392

@@ -244,7 +245,7 @@

19393

[(match_operand:QI 0 "register_operand" "")

19394

(match_operand:QI 1 "memory_operand" "")

19395

(match_operand:SI 2 "const_int_operand" "")]

19396

- ""

19397

+ "!sparc_fix_ut699"

19398

{

19399

enum memmodel model = (enum memmodel) INTVAL (operands[2]);

19400

rtx ret;

19401

@@ -268,6 +269,6 @@

19402

(unspec_volatile:QI [(match_operand:QI 1 "memory_operand" "+m")]

19403

UNSPECV_LDSTUB))

19404

(set (match_dup 1) (const_int -1))]

19405

- ""

19406

+ "!sparc_fix_ut699"

19407

"ldstub\t%1, %0"

19408

[(set_attr "type" "multi")])

19409

Index: gcc/config/sparc/sparc-opts.h

19410

===================================================================

19411

--- a/src/gcc/config/sparc/sparc-opts.h (.../tags/gcc_4_8_2_release)

19412

+++ b/src/gcc/config/sparc/sparc-opts.h (.../branches/gcc-4_8-branch)

19413

@@ -30,6 +30,7 @@

19414

PROCESSOR_SUPERSPARC,

19415

PROCESSOR_HYPERSPARC,

19416

PROCESSOR_LEON,

19417

+ PROCESSOR_LEON3,

19418

PROCESSOR_SPARCLITE,

19419

PROCESSOR_F930,

19420

PROCESSOR_F934,

19421

Index: gcc/config/sparc/sparc.c

19422

===================================================================

19423

--- a/src/gcc/config/sparc/sparc.c (.../tags/gcc_4_8_2_release)

19424

+++ b/src/gcc/config/sparc/sparc.c (.../branches/gcc-4_8-branch)

19425

@@ -52,6 +52,7 @@

19426

#include "params.h"

19427

#include "df.h"

19428

#include "opts.h"

19429

+#include "tree-pass.h"

19430

19431

/* Processor costs */

19432

19433

@@ -226,6 +227,30 @@

19434

};

19435

19436

static const

19437

+struct processor_costs leon3_costs = {

19438

+ COSTS_N_INSNS (1), /* int load */

19439

+ COSTS_N_INSNS (1), /* int signed load */

19440

+ COSTS_N_INSNS (1), /* int zeroed load */

19441

+ COSTS_N_INSNS (1), /* float load */

19442

+ COSTS_N_INSNS (1), /* fmov, fneg, fabs */

19443

+ COSTS_N_INSNS (1), /* fadd, fsub */

19444

+ COSTS_N_INSNS (1), /* fcmp */

19445

+ COSTS_N_INSNS (1), /* fmov, fmovr */

19446

+ COSTS_N_INSNS (1), /* fmul */

19447

+ COSTS_N_INSNS (14), /* fdivs */

19448

+ COSTS_N_INSNS (15), /* fdivd */

19449

+ COSTS_N_INSNS (22), /* fsqrts */

19450

+ COSTS_N_INSNS (23), /* fsqrtd */

19451

+ COSTS_N_INSNS (5), /* imul */

19452

+ COSTS_N_INSNS (5), /* imulX */

19453

+ 0, /* imul bit factor */

19454

+ COSTS_N_INSNS (35), /* idiv */

19455

+ COSTS_N_INSNS (35), /* idivX */

19456

+ COSTS_N_INSNS (1), /* movcc/movr */

19457

+ 0, /* shift penalty */

19458

+};

19459

+

19460

+static const

19461

struct processor_costs sparclet_costs = {

19462

COSTS_N_INSNS (3), /* int load */

19463

COSTS_N_INSNS (3), /* int signed load */

19464

@@ -538,7 +563,6 @@

19465

HOST_WIDE_INT, tree);

19466

static bool sparc_can_output_mi_thunk (const_tree, HOST_WIDE_INT,

19467

HOST_WIDE_INT, const_tree);

19468

-static void sparc_reorg (void);

19469

static struct machine_function * sparc_init_machine_status (void);

19470

static bool sparc_cannot_force_const_mem (enum machine_mode, rtx);

19471

static rtx sparc_tls_get_addr (void);

19472

@@ -680,9 +704,6 @@

19473

#undef TARGET_ASM_CAN_OUTPUT_MI_THUNK

19474

#define TARGET_ASM_CAN_OUTPUT_MI_THUNK sparc_can_output_mi_thunk

19475

19476

-#undef TARGET_MACHINE_DEPENDENT_REORG

19477

-#define TARGET_MACHINE_DEPENDENT_REORG sparc_reorg

19478

-

19479

#undef TARGET_RTX_COSTS

19480

#define TARGET_RTX_COSTS sparc_rtx_costs

19481

#undef TARGET_ADDRESS_COST

19482

@@ -804,6 +825,206 @@

19483

19484

struct gcc_target targetm = TARGET_INITIALIZER;

19485

19486

+/* Return the memory reference contained in X if any, zero otherwise. */

19487

+

19488

+static rtx

19489

+mem_ref (rtx x)

19490

+{

19491

+ if (GET_CODE (x) == SIGN_EXTEND || GET_CODE (x) == ZERO_EXTEND)

19492

+ x = XEXP (x, 0);

19493

+

19494

+ if (MEM_P (x))

19495

+ return x;

19496

+

19497

+ return NULL_RTX;

19498

+}

19499

+

19500

+/* We use a machine specific pass to enable workarounds for errata.

19501

+ We need to have the (essentially) final form of the insn stream in order

19502

+ to properly detect the various hazards. Therefore, this machine specific

19503

+ pass runs as late as possible. The pass is inserted in the pass pipeline

19504

+ at the end of sparc_option_override. */

19505

+

19506

+static bool

19507

+sparc_gate_work_around_errata (void)

19508

+{

19509

+ /* The only errata we handle are those of the AT697F and UT699. */

19510

+ return sparc_fix_at697f != 0 || sparc_fix_ut699 != 0;

19511

+}

19512

+

19513

+static unsigned int

19514

+sparc_do_work_around_errata (void)

19515

+{

19516

+ rtx insn, next;

19517

+

19518

+ /* Force all instructions to be split into their final form. */

19519

+ split_all_insns_noflow ();

19520

+

19521

+ /* Now look for specific patterns in the insn stream. */

19522

+ for (insn = get_insns (); insn; insn = next)

19523

+ {

19524

+ bool insert_nop = false;

19525

+ rtx set;

19526

+

19527

+ /* Look into the instruction in a delay slot. */

19528

+ if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)

19529

+ insn = XVECEXP (PATTERN (insn), 0, 1);

19530

+

19531

+ /* Look for a single-word load into an odd-numbered FP register. */

19532

+ if (sparc_fix_at697f

19533

+ && NONJUMP_INSN_P (insn)

19534

+ && (set = single_set (insn)) != NULL_RTX

19535

+ && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) == 4

19536

+ && MEM_P (SET_SRC (set))

19537

+ && REG_P (SET_DEST (set))

19538

+ && REGNO (SET_DEST (set)) > 31

19539

+ && REGNO (SET_DEST (set)) % 2 != 0)

19540

+ {

19541

+ /* The wrong dependency is on the enclosing double register. */

19542

+ unsigned int x = REGNO (SET_DEST (set)) - 1;

19543

+ unsigned int src1, src2, dest;

19544

+ int code;

19545

+

19546

+ /* If the insn has a delay slot, then it cannot be problematic. */

19547

+ next = next_active_insn (insn);

19548

+ if (!next)

19549

+ break;

19550

+ if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

19551

+ continue;

19552

+

19553

+ extract_insn (next);

19554

+ code = INSN_CODE (next);

19555

+

19556

+ switch (code)

19557

+ {

19558

+ case CODE_FOR_adddf3:

19559

+ case CODE_FOR_subdf3:

19560

+ case CODE_FOR_muldf3:

19561

+ case CODE_FOR_divdf3:

19562

+ dest = REGNO (recog_data.operand[0]);

19563

+ src1 = REGNO (recog_data.operand[1]);

19564

+ src2 = REGNO (recog_data.operand[2]);

19565

+ if (src1 != src2)

19566

+ {

19567

+ /* Case [1-4]:

19568

+ ld [address], %fx+1

19569

+ FPOPd %f{x,y}, %f{y,x}, %f{x,y} */

19570

+ if ((src1 == x || src2 == x)

19571

+ && (dest == src1 || dest == src2))

19572

+ insert_nop = true;

19573

+ }

19574

+ else

19575

+ {

19576

+ /* Case 5:

19577

+ ld [address], %fx+1

19578

+ FPOPd %fx, %fx, %fx */

19579

+ if (src1 == x

19580

+ && dest == src1

19581

+ && (code == CODE_FOR_adddf3 || code == CODE_FOR_muldf3))

19582

+ insert_nop = true;

19583

+ }

19584

+ break;

19585

+

19586

+ case CODE_FOR_sqrtdf2:

19587

+ dest = REGNO (recog_data.operand[0]);

19588

+ src1 = REGNO (recog_data.operand[1]);

19589

+ /* Case 6:

19590

+ ld [address], %fx+1

19591

+ fsqrtd %fx, %fx */

19592

+ if (src1 == x && dest == src1)

19593

+ insert_nop = true;

19594

+ break;

19595

+

19596

+ default:

19597

+ break;

19598

+ }

19599

+ }

19600

+

19601

+ /* Look for a single-word load into an integer register. */

19602

+ else if (sparc_fix_ut699

19603

+ && NONJUMP_INSN_P (insn)

19604

+ && (set = single_set (insn)) != NULL_RTX

19605

+ && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) <= 4

19606

+ && mem_ref (SET_SRC (set)) != NULL_RTX

19607

+ && REG_P (SET_DEST (set))

19608

+ && REGNO (SET_DEST (set)) < 32)

19609

+ {

19610

+ /* There is no problem if the second memory access has a data

19611

+ dependency on the first single-cycle load. */

19612

+ rtx x = SET_DEST (set);

19613

+

19614

+ /* If the insn has a delay slot, then it cannot be problematic. */

19615

+ next = next_active_insn (insn);

19616

+ if (!next)

19617

+ break;

19618

+ if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

19619

+ continue;

19620

+

19621

+ /* Look for a second memory access to/from an integer register. */

19622

+ if ((set = single_set (next)) != NULL_RTX)

19623

+ {

19624

+ rtx src = SET_SRC (set);

19625

+ rtx dest = SET_DEST (set);

19626

+ rtx mem;

19627

+

19628

+ /* LDD is affected. */

19629

+ if ((mem = mem_ref (src)) != NULL_RTX

19630

+ && REG_P (dest)

19631

+ && REGNO (dest) < 32

19632

+ && !reg_mentioned_p (x, XEXP (mem, 0)))

19633

+ insert_nop = true;

19634

+

19635

+ /* STD is *not* affected. */

19636

+ else if ((mem = mem_ref (dest)) != NULL_RTX

19637

+ && GET_MODE_SIZE (GET_MODE (mem)) <= 4

19638

+ && (src == const0_rtx

19639

+ || (REG_P (src)

19640

+ && REGNO (src) < 32

19641

+ && REGNO (src) != REGNO (x)))

19642

+ && !reg_mentioned_p (x, XEXP (mem, 0)))

19643

+ insert_nop = true;

19644

+ }

19645

+ }

19646

+

19647

+ else

19648

+ next = NEXT_INSN (insn);

19649

+

19650

+ if (insert_nop)

19651

+ emit_insn_before (gen_nop (), next);

19652

+ }

19653

+

19654

+ return 0;

19655

+}

19656

+

19657

+struct rtl_opt_pass pass_work_around_errata =

19658

+{

19659

+ {

19660

+ RTL_PASS,

19661

+ "errata", /* name */

19662

+ OPTGROUP_NONE, /* optinfo_flags */

19663

+ sparc_gate_work_around_errata, /* gate */

19664

+ sparc_do_work_around_errata, /* execute */

19665

+ NULL, /* sub */

19666

+ NULL, /* next */

19667

+ 0, /* static_pass_number */

19668

+ TV_MACH_DEP, /* tv_id */

19669

+ 0, /* properties_required */

19670

+ 0, /* properties_provided */

19671

+ 0, /* properties_destroyed */

19672

+ 0, /* todo_flags_start */

19673

+ TODO_verify_rtl_sharing, /* todo_flags_finish */

19674

+ }

19675

+};

19676

+

19677

+struct register_pass_info insert_pass_work_around_errata =

19678

+{

19679

+ &pass_work_around_errata.pass, /* pass */

19680

+ "dbr", /* reference_pass_name */

19681

+ 1, /* ref_pass_instance_number */

19682

+ PASS_POS_INSERT_AFTER /* po_op */

19683

+};

19684

+

19685

+/* Helpers for TARGET_DEBUG_OPTIONS. */

19686

static void

19687

dump_target_flag_bits (const int flags)

19688

{

19689

@@ -888,6 +1109,7 @@

19690

{ TARGET_CPU_supersparc, PROCESSOR_SUPERSPARC },

19691

{ TARGET_CPU_hypersparc, PROCESSOR_HYPERSPARC },

19692

{ TARGET_CPU_leon, PROCESSOR_LEON },

19693

+ { TARGET_CPU_leon3, PROCESSOR_LEON3 },

19694

{ TARGET_CPU_sparclite, PROCESSOR_F930 },

19695

{ TARGET_CPU_sparclite86x, PROCESSOR_SPARCLITE86X },

19696

{ TARGET_CPU_sparclet, PROCESSOR_TSC701 },

19697

@@ -902,7 +1124,7 @@

19698

};

19699

const struct cpu_default *def;

19700

/* Table of values for -m{cpu,tune}=. This must match the order of

19701

- the PROCESSOR_* enumeration. */

19702

+ the enum processor_type in sparc-opts.h. */

19703

static struct cpu_table {

19704

const char *const name;

19705

const int disable;

19706

@@ -914,8 +1136,8 @@

19707

/* TI TMS390Z55 supersparc */

19708

{ "supersparc", MASK_ISA, MASK_V8 },

19709

{ "hypersparc", MASK_ISA, MASK_V8|MASK_FPU },

19710

- /* LEON */

19711

- { "leon", MASK_ISA, MASK_V8|MASK_FPU },

19712

+ { "leon", MASK_ISA, MASK_V8|MASK_LEON|MASK_FPU },

19713

+ { "leon3", MASK_ISA, MASK_V8|MASK_LEON3|MASK_FPU },

19714

{ "sparclite", MASK_ISA, MASK_SPARCLITE },

19715

/* The Fujitsu MB86930 is the original sparclite chip, with no FPU. */

19716

{ "f930", MASK_ISA|MASK_FPU, MASK_SPARCLITE },

19717

@@ -1075,6 +1297,9 @@

19718

#ifndef HAVE_AS_SPARC4

19719

& ~MASK_CBCOND

19720

#endif

19721

+#ifndef HAVE_AS_LEON

19722

+ & ~(MASK_LEON | MASK_LEON3)

19723

+#endif

19724

);

19725

19726

/* If -mfpu or -mno-fpu was explicitly used, don't override with

19727

@@ -1164,6 +1389,9 @@

19728

case PROCESSOR_LEON:

19729

sparc_costs = &leon_costs;

19730

break;

19731

+ case PROCESSOR_LEON3:

19732

+ sparc_costs = &leon3_costs;

19733

+ break;

19734

case PROCESSOR_SPARCLET:

19735

case PROCESSOR_TSC701:

19736

sparc_costs = &sparclet_costs;

19737

@@ -1200,6 +1428,10 @@

19738

/* Choose the most relaxed model for the processor. */

19739

else if (TARGET_V9)

19740

sparc_memory_model = SMM_RMO;

19741

+ else if (TARGET_LEON3)

19742

+ sparc_memory_model = SMM_TSO;

19743

+ else if (TARGET_LEON)

19744

+ sparc_memory_model = SMM_SC;

19745

else if (TARGET_V8)

19746

sparc_memory_model = SMM_PSO;

19747

else

19748

@@ -1241,6 +1473,13 @@

19749

pessimizes for double floating-point registers. */

19750

if (!global_options_set.x_flag_ira_share_save_slots)

19751

flag_ira_share_save_slots = 0;

19752

+

19753

+ /* We register a machine specific pass to work around errata, if any.

19754

+ The pass mut be scheduled as late as possible so that we have the

19755

+ (essentially) final form of the insn stream to work on.

19756

+ Registering the pass must be done at start up. It's convenient to

19757

+ do it here. */

19758

+ register_pass (&insert_pass_work_around_errata);

19759

}

19760

19761

/* Miscellaneous utilities. */

19762

@@ -10355,7 +10594,8 @@

19763

tmp = e0.add_with_sign (tmp, false, &add1_ovf);

19764

if (tmp.is_negative ())

19765

tmp = tmp.neg_with_overflow (&neg2_ovf);

19766

-

19767

+ else

19768

+ neg2_ovf = false;

19769

result = result.add_with_sign (tmp, false, &add2_ovf);

19770

overflow |= neg1_ovf | neg2_ovf | add1_ovf | add2_ovf;

19771

}

19772

@@ -10897,107 +11137,6 @@

19773

return (vcall_offset >= -32768 || ! fixed_regs[5]);

19774

}

19775

19776

-/* We use the machine specific reorg pass to enable workarounds for errata. */

19777

-

19778

-static void

19779

-sparc_reorg (void)

19780

-{

19781

- rtx insn, next;

19782

-

19783

- /* The only erratum we handle for now is that of the AT697F processor. */

19784

- if (!sparc_fix_at697f)

19785

- return;

19786

-

19787

- /* We need to have the (essentially) final form of the insn stream in order

19788

- to properly detect the various hazards. Run delay slot scheduling. */

19789

- if (optimize > 0 && flag_delayed_branch)

19790

- {

19791

- cleanup_barriers ();

19792

- dbr_schedule (get_insns ());

19793

- }

19794

-

19795

- /* Now look for specific patterns in the insn stream. */

19796

- for (insn = get_insns (); insn; insn = next)

19797

- {

19798

- bool insert_nop = false;

19799

- rtx set;

19800

-

19801

- /* Look for a single-word load into an odd-numbered FP register. */

19802

- if (NONJUMP_INSN_P (insn)

19803

- && (set = single_set (insn)) != NULL_RTX

19804

- && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) == 4

19805

- && MEM_P (SET_SRC (set))

19806

- && REG_P (SET_DEST (set))

19807

- && REGNO (SET_DEST (set)) > 31

19808

- && REGNO (SET_DEST (set)) % 2 != 0)

19809

- {

19810

- /* The wrong dependency is on the enclosing double register. */

19811

- unsigned int x = REGNO (SET_DEST (set)) - 1;

19812

- unsigned int src1, src2, dest;

19813

- int code;

19814

-

19815

- /* If the insn has a delay slot, then it cannot be problematic. */

19816

- next = next_active_insn (insn);

19817

- if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

19818

- code = -1;

19819

- else

19820

- {

19821

- extract_insn (next);

19822

- code = INSN_CODE (next);

19823

- }

19824

-

19825

- switch (code)

19826

- {

19827

- case CODE_FOR_adddf3:

19828

- case CODE_FOR_subdf3:

19829

- case CODE_FOR_muldf3:

19830

- case CODE_FOR_divdf3:

19831

- dest = REGNO (recog_data.operand[0]);

19832

- src1 = REGNO (recog_data.operand[1]);

19833

- src2 = REGNO (recog_data.operand[2]);

19834

- if (src1 != src2)

19835

- {

19836

- /* Case [1-4]:

19837

- ld [address], %fx+1

19838

- FPOPd %f{x,y}, %f{y,x}, %f{x,y} */

19839

- if ((src1 == x || src2 == x)

19840

- && (dest == src1 || dest == src2))

19841

- insert_nop = true;

19842

- }

19843

- else

19844

- {

19845

- /* Case 5:

19846

- ld [address], %fx+1

19847

- FPOPd %fx, %fx, %fx */

19848

- if (src1 == x

19849

- && dest == src1

19850

- && (code == CODE_FOR_adddf3 || code == CODE_FOR_muldf3))

19851

- insert_nop = true;

19852

- }

19853

- break;

19854

-

19855

- case CODE_FOR_sqrtdf2:

19856

- dest = REGNO (recog_data.operand[0]);

19857

- src1 = REGNO (recog_data.operand[1]);

19858

- /* Case 6:

19859

- ld [address], %fx+1

19860

- fsqrtd %fx, %fx */

19861

- if (src1 == x && dest == src1)

19862

- insert_nop = true;

19863

- break;

19864

-

19865

- default:

19866

- break;

19867

- }

19868

- }

19869

- else

19870

- next = NEXT_INSN (insn);

19871

-

19872

- if (insert_nop)

19873

- emit_insn_after (gen_nop (), insn);

19874

- }

19875

-}

19876

-

19877

/* How to allocate a 'struct machine_function'. */

19878

19879

static struct machine_function *

19880

Index: gcc/config/sparc/leon.md

19881

===================================================================

19882

--- a/src/gcc/config/sparc/leon.md (.../tags/gcc_4_8_2_release)

19883

+++ b/src/gcc/config/sparc/leon.md (.../branches/gcc-4_8-branch)

19884

@@ -17,40 +17,48 @@

19885

;; along with GCC; see the file COPYING3. If not see

19886

;; <http://www.gnu.org/licenses/>.

19887

19888

+;; Leon is a single-issue processor.

19889

19890

(define_automaton "leon")

19891

19892

-(define_cpu_unit "leon_memory, leon_fpalu" "leon")

19893

-(define_cpu_unit "leon_fpmds" "leon")

19894

-(define_cpu_unit "write_buf" "leon")

19895

+(define_cpu_unit "leon_memory" "leon")

19896

19897

(define_insn_reservation "leon_load" 1

19898

- (and (eq_attr "cpu" "leon")

19899

- (eq_attr "type" "load,sload,fpload"))

19900

+ (and (eq_attr "cpu" "leon") (eq_attr "type" "load,sload"))

19901

"leon_memory")

19902

19903

-(define_insn_reservation "leon_store" 1

19904

- (and (eq_attr "cpu" "leon")

19905

- (eq_attr "type" "store,fpstore"))

19906

- "leon_memory+write_buf")

19907

-

19908

-(define_insn_reservation "leon_fp_alu" 1

19909

- (and (eq_attr "cpu" "leon")

19910

- (eq_attr "type" "fp,fpmove"))

19911

- "leon_fpalu, nothing")

19912

+;; Use a double reservation to work around the load pipeline hazard on UT699.

19913

+(define_insn_reservation "leon3_load" 1

19914

+ (and (eq_attr "cpu" "leon3") (eq_attr "type" "load,sload"))

19915

+ "leon_memory*2")

19916

19917

-(define_insn_reservation "leon_fp_mult" 1

19918

- (and (eq_attr "cpu" "leon")

19919

- (eq_attr "type" "fpmul"))

19920

- "leon_fpmds, nothing")

19921

+(define_insn_reservation "leon_store" 2

19922

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "store"))

19923

+ "leon_memory*2")

19924

19925

-(define_insn_reservation "leon_fp_div" 16

19926

- (and (eq_attr "cpu" "leon")

19927

- (eq_attr "type" "fpdivs,fpdivd"))

19928

- "leon_fpmds, nothing*15")

19929

+;; This describes Gaisler Research's FPU

19930

19931

-(define_insn_reservation "leon_fp_sqrt" 23

19932

- (and (eq_attr "cpu" "leon")

19933

- (eq_attr "type" "fpsqrts,fpsqrtd"))

19934

- "leon_fpmds, nothing*21")

19935

+(define_automaton "grfpu")

19936

19937

+(define_cpu_unit "grfpu_alu" "grfpu")

19938

+(define_cpu_unit "grfpu_ds" "grfpu")

19939

+

19940

+(define_insn_reservation "leon_fp_alu" 4

19941

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fp,fpcmp,fpmul"))

19942

+ "grfpu_alu, nothing*3")

19943

+

19944

+(define_insn_reservation "leon_fp_divs" 16

19945

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpdivs"))

19946

+ "grfpu_ds*14, nothing*2")

19947

+

19948

+(define_insn_reservation "leon_fp_divd" 17

19949

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpdivd"))

19950

+ "grfpu_ds*15, nothing*2")

19951

+

19952

+(define_insn_reservation "leon_fp_sqrts" 24

19953

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpsqrts"))

19954

+ "grfpu_ds*22, nothing*2")

19955

+

19956

+(define_insn_reservation "leon_fp_sqrtd" 25

19957

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpsqrtd"))

19958

+ "grfpu_ds*23, nothing*2")

19959

Index: gcc/config/sparc/sparc.h

19960

===================================================================

19961

--- a/src/gcc/config/sparc/sparc.h (.../tags/gcc_4_8_2_release)

19962

+++ b/src/gcc/config/sparc/sparc.h (.../branches/gcc-4_8-branch)

19963

@@ -136,21 +136,22 @@

19964

#define TARGET_CPU_supersparc 2

19965

#define TARGET_CPU_hypersparc 3

19966

#define TARGET_CPU_leon 4

19967

-#define TARGET_CPU_sparclite 5

19968

-#define TARGET_CPU_f930 5 /* alias */

19969

-#define TARGET_CPU_f934 5 /* alias */

19970

-#define TARGET_CPU_sparclite86x 6

19971

-#define TARGET_CPU_sparclet 7

19972

-#define TARGET_CPU_tsc701 7 /* alias */

19973

-#define TARGET_CPU_v9 8 /* generic v9 implementation */

19974

-#define TARGET_CPU_sparcv9 8 /* alias */

19975

-#define TARGET_CPU_sparc64 8 /* alias */

19976

-#define TARGET_CPU_ultrasparc 9

19977

-#define TARGET_CPU_ultrasparc3 10

19978

-#define TARGET_CPU_niagara 11

19979

-#define TARGET_CPU_niagara2 12

19980

-#define TARGET_CPU_niagara3 13

19981

-#define TARGET_CPU_niagara4 14

19982

+#define TARGET_CPU_leon3 5

19983

+#define TARGET_CPU_sparclite 6

19984

+#define TARGET_CPU_f930 6 /* alias */

19985

+#define TARGET_CPU_f934 6 /* alias */

19986

+#define TARGET_CPU_sparclite86x 7

19987

+#define TARGET_CPU_sparclet 8

19988

+#define TARGET_CPU_tsc701 8 /* alias */

19989

+#define TARGET_CPU_v9 9 /* generic v9 implementation */

19990

+#define TARGET_CPU_sparcv9 9 /* alias */

19991

+#define TARGET_CPU_sparc64 9 /* alias */

19992

+#define TARGET_CPU_ultrasparc 10

19993

+#define TARGET_CPU_ultrasparc3 11

19994

+#define TARGET_CPU_niagara 12

19995

+#define TARGET_CPU_niagara2 13

19996

+#define TARGET_CPU_niagara3 14

19997

+#define TARGET_CPU_niagara4 15

19998

19999

#if TARGET_CPU_DEFAULT == TARGET_CPU_v9 \

20000

|| TARGET_CPU_DEFAULT == TARGET_CPU_ultrasparc \

20001

@@ -232,9 +233,10 @@

20002

#define ASM_CPU32_DEFAULT_SPEC ""

20003

#endif

20004

20005

-#if TARGET_CPU_DEFAULT == TARGET_CPU_leon

20006

+#if TARGET_CPU_DEFAULT == TARGET_CPU_leon \

20007

+ || TARGET_CPU_DEFAULT == TARGET_CPU_leon3

20008

#define CPP_CPU32_DEFAULT_SPEC "-D__leon__ -D__sparc_v8__"

20009

-#define ASM_CPU32_DEFAULT_SPEC ""

20010

+#define ASM_CPU32_DEFAULT_SPEC AS_LEON_FLAG

20011

#endif

20012

20013

#endif

20014

@@ -282,6 +284,7 @@

20015

%{mcpu=supersparc:-D__supersparc__ -D__sparc_v8__} \

20016

%{mcpu=hypersparc:-D__hypersparc__ -D__sparc_v8__} \

20017

%{mcpu=leon:-D__leon__ -D__sparc_v8__} \

20018

+%{mcpu=leon3:-D__leon__ -D__sparc_v8__} \

20019

%{mcpu=v9:-D__sparc_v9__} \

20020

%{mcpu=ultrasparc:-D__sparc_v9__} \

20021

%{mcpu=ultrasparc3:-D__sparc_v9__} \

20022

@@ -329,7 +332,8 @@

20023

%{mcpu=v8:-Av8} \

20024

%{mcpu=supersparc:-Av8} \

20025

%{mcpu=hypersparc:-Av8} \

20026

-%{mcpu=leon:-Av8} \

20027

+%{mcpu=leon:" AS_LEON_FLAG "} \

20028

+%{mcpu=leon3:" AS_LEON_FLAG "} \

20029

%{mv8plus:-Av8plus} \

20030

%{mcpu=v9:-Av9} \

20031

%{mcpu=ultrasparc:%{!mv8plus:-Av9a}} \

20032

@@ -1754,6 +1758,12 @@

20033

#define AS_NIAGARA4_FLAG "-Av9" AS_NIAGARA3_FLAG

20034

#endif

20035

20036

+#ifdef HAVE_AS_LEON

20037

+#define AS_LEON_FLAG "-Aleon"

20038

+#else

20039

+#define AS_LEON_FLAG "-Av8"

20040

+#endif

20041

+

20042

/* We use gcc _mcount for profiling. */

20043

#define NO_PROFILE_COUNTERS 0

20044

20045

Index: gcc/config/i386/i386.h

20046

===================================================================

20047

--- a/src/gcc/config/i386/i386.h (.../tags/gcc_4_8_2_release)

20048

+++ b/src/gcc/config/i386/i386.h (.../branches/gcc-4_8-branch)

20049

@@ -197,10 +197,10 @@

20050

20051

/* Macros used in the machine description to test the flags. */

20052

20053

-/* configure can arrange to make this 2, to force a 486. */

20054

+/* configure can arrange to change it. */

20055

20056

#ifndef TARGET_CPU_DEFAULT

20057

-#define TARGET_CPU_DEFAULT TARGET_CPU_DEFAULT_generic

20058

+#define TARGET_CPU_DEFAULT PROCESSOR_GENERIC32

20059

#endif

20060

20061

#ifndef TARGET_FPMATH_DEFAULT

20062

@@ -591,43 +591,6 @@

20063

/* Target Pragmas. */

20064

#define REGISTER_TARGET_PRAGMAS() ix86_register_pragmas ()

20065

20066

-enum target_cpu_default

20067

-{

20068

- TARGET_CPU_DEFAULT_generic = 0,

20069

-

20070

- TARGET_CPU_DEFAULT_i386,

20071

- TARGET_CPU_DEFAULT_i486,

20072

- TARGET_CPU_DEFAULT_pentium,

20073

- TARGET_CPU_DEFAULT_pentium_mmx,

20074

- TARGET_CPU_DEFAULT_pentiumpro,

20075

- TARGET_CPU_DEFAULT_pentium2,

20076

- TARGET_CPU_DEFAULT_pentium3,

20077

- TARGET_CPU_DEFAULT_pentium4,

20078

- TARGET_CPU_DEFAULT_pentium_m,

20079

- TARGET_CPU_DEFAULT_prescott,

20080

- TARGET_CPU_DEFAULT_nocona,

20081

- TARGET_CPU_DEFAULT_core2,

20082

- TARGET_CPU_DEFAULT_corei7,

20083

- TARGET_CPU_DEFAULT_haswell,

20084

- TARGET_CPU_DEFAULT_atom,

20085

-

20086

- TARGET_CPU_DEFAULT_geode,

20087

- TARGET_CPU_DEFAULT_k6,

20088

- TARGET_CPU_DEFAULT_k6_2,

20089

- TARGET_CPU_DEFAULT_k6_3,

20090

- TARGET_CPU_DEFAULT_athlon,

20091

- TARGET_CPU_DEFAULT_athlon_sse,

20092

- TARGET_CPU_DEFAULT_k8,

20093

- TARGET_CPU_DEFAULT_amdfam10,

20094

- TARGET_CPU_DEFAULT_bdver1,

20095

- TARGET_CPU_DEFAULT_bdver2,

20096

- TARGET_CPU_DEFAULT_bdver3,

20097

- TARGET_CPU_DEFAULT_btver1,

20098

- TARGET_CPU_DEFAULT_btver2,

20099

-

20100

- TARGET_CPU_DEFAULT_max

20101

-};

20102

-

20103

#ifndef CC1_SPEC

20104

#define CC1_SPEC "%(cc1_cpu) "

20105

#endif

20106

@@ -2089,32 +2052,33 @@

20107

with x86-64 medium memory model */

20108

#define DEFAULT_LARGE_SECTION_THRESHOLD 65536

20109

20110

-/* Which processor to tune code generation for. */

20111

+/* Which processor to tune code generation for. These must be in sync

20112

+ with processor_target_table in i386.c. */

20113

20114

enum processor_type

20115

{

20116

- PROCESSOR_I386 = 0, /* 80386 */

20117

+ PROCESSOR_GENERIC32 = 0,

20118

+ PROCESSOR_GENERIC64,

20119

+ PROCESSOR_I386, /* 80386 */

20120

PROCESSOR_I486, /* 80486DX, 80486SX, 80486DX[24] */

20121

PROCESSOR_PENTIUM,

20122

PROCESSOR_PENTIUMPRO,

20123

- PROCESSOR_GEODE,

20124

- PROCESSOR_K6,

20125

- PROCESSOR_ATHLON,

20126

PROCESSOR_PENTIUM4,

20127

- PROCESSOR_K8,

20128

PROCESSOR_NOCONA,

20129

PROCESSOR_CORE2,

20130

PROCESSOR_COREI7,

20131

PROCESSOR_HASWELL,

20132

- PROCESSOR_GENERIC32,

20133

- PROCESSOR_GENERIC64,

20134

+ PROCESSOR_ATOM,

20135

+ PROCESSOR_GEODE,

20136

+ PROCESSOR_K6,

20137

+ PROCESSOR_ATHLON,

20138

+ PROCESSOR_K8,

20139

PROCESSOR_AMDFAM10,

20140

PROCESSOR_BDVER1,

20141

PROCESSOR_BDVER2,

20142

PROCESSOR_BDVER3,

20143

PROCESSOR_BTVER1,

20144

PROCESSOR_BTVER2,

20145

- PROCESSOR_ATOM,

20146

PROCESSOR_max

20147

};

20148

20149

Index: gcc/config/i386/i386.md

20150

===================================================================

20151

--- a/src/gcc/config/i386/i386.md (.../tags/gcc_4_8_2_release)

20152

+++ b/src/gcc/config/i386/i386.md (.../branches/gcc-4_8-branch)

20153

@@ -363,6 +363,13 @@

20154

(const_string "unknown")]

20155

(const_string "integer")))

20156

20157

+;; The minimum required alignment of vector mode memory operands of the SSE

20158

+;; (non-VEX/EVEX) instruction in bits, if it is different from

20159

+;; GET_MODE_ALIGNMENT of the operand, otherwise 0. If an instruction has

20160

+;; multiple alternatives, this should be conservative maximum of those minimum

20161

+;; required alignments.

20162

+(define_attr "ssememalign" "" (const_int 0))

20163

+

20164

;; The (bounding maximum) length of an instruction immediate.

20165

(define_attr "length_immediate" ""

20166

(cond [(eq_attr "type" "incdec,setcc,icmov,str,lea,other,multi,idiv,leave,

20167

@@ -1570,7 +1577,7 @@

20168

split_double_mode (DImode, &operands[1], 1, &operands[2], &operands[3]);

20169

20170

operands[1] = gen_lowpart (DImode, operands[2]);

20171

- operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (DImode, stack_pointer_rtx,

20172

+ operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (Pmode, stack_pointer_rtx,

20173

GEN_INT (4)));

20174

})

20175

20176

@@ -1587,7 +1594,7 @@

20177

split_double_mode (DImode, &operands[1], 1, &operands[2], &operands[3]);

20178

20179

operands[1] = gen_lowpart (DImode, operands[2]);

20180

- operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (DImode, stack_pointer_rtx,

20181

+ operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (Pmode, stack_pointer_rtx,

20182

GEN_INT (4)));

20183

})

20184

20185

@@ -6589,7 +6596,7 @@

20186

(set_attr "use_carry" "1")

20187

(set_attr "mode" "<MODE>")])

20188

20189

-;; Overflow setting add and subtract instructions

20190

+;; Overflow setting add instructions

20191

20192

(define_insn "*add<mode>3_cconly_overflow"

20193

[(set (reg:CCC FLAGS_REG)

20194

@@ -6604,43 +6611,31 @@

20195

[(set_attr "type" "alu")

20196

(set_attr "mode" "<MODE>")])

20197

20198

-(define_insn "*sub<mode>3_cconly_overflow"

20199

+(define_insn "*add<mode>3_cc_overflow"

20200

[(set (reg:CCC FLAGS_REG)

20201

(compare:CCC

20202

- (minus:SWI

20203

- (match_operand:SWI 0 "nonimmediate_operand" "<r>m,<r>")

20204

- (match_operand:SWI 1 "<general_operand>" "<r><i>,<r>m"))

20205

- (match_dup 0)))]

20206

- ""

20207

- "cmp{<imodesuffix>}\t{%1, %0|%0, %1}"

20208

- [(set_attr "type" "icmp")

20209

- (set_attr "mode" "<MODE>")])

20210

-

20211

-(define_insn "*<plusminus_insn><mode>3_cc_overflow"

20212

- [(set (reg:CCC FLAGS_REG)

20213

- (compare:CCC

20214

- (plusminus:SWI

20215

- (match_operand:SWI 1 "nonimmediate_operand" "<comm>0,0")

20216

+ (plus:SWI

20217

+ (match_operand:SWI 1 "nonimmediate_operand" "%0,0")

20218

(match_operand:SWI 2 "<general_operand>" "<r><i>,<r>m"))

20219

(match_dup 1)))

20220

(set (match_operand:SWI 0 "nonimmediate_operand" "=<r>m,<r>")

20221

- (plusminus:SWI (match_dup 1) (match_dup 2)))]

20222

- "ix86_binary_operator_ok (<CODE>, <MODE>mode, operands)"

20223

- "<plusminus_mnemonic>{<imodesuffix>}\t{%2, %0|%0, %2}"

20224

+ (plus:SWI (match_dup 1) (match_dup 2)))]

20225

+ "ix86_binary_operator_ok (PLUS, <MODE>mode, operands)"

20226

+ "add{<imodesuffix>}\t{%2, %0|%0, %2}"

20227

[(set_attr "type" "alu")

20228

(set_attr "mode" "<MODE>")])

20229

20230

-(define_insn "*<plusminus_insn>si3_zext_cc_overflow"

20231

+(define_insn "*addsi3_zext_cc_overflow"

20232

[(set (reg:CCC FLAGS_REG)

20233

(compare:CCC

20234

- (plusminus:SI

20235

- (match_operand:SI 1 "nonimmediate_operand" "<comm>0")

20236

+ (plus:SI

20237

+ (match_operand:SI 1 "nonimmediate_operand" "%0")

20238

(match_operand:SI 2 "x86_64_general_operand" "rme"))

20239

(match_dup 1)))

20240

(set (match_operand:DI 0 "register_operand" "=r")

20241

- (zero_extend:DI (plusminus:SI (match_dup 1) (match_dup 2))))]

20242

- "TARGET_64BIT && ix86_binary_operator_ok (<CODE>, SImode, operands)"

20243

- "<plusminus_mnemonic>{l}\t{%2, %k0|%k0, %2}"

20244

+ (zero_extend:DI (plus:SI (match_dup 1) (match_dup 2))))]

20245

+ "TARGET_64BIT && ix86_binary_operator_ok (PLUS, SImode, operands)"

20246

+ "add{l}\t{%2, %k0|%k0, %2}"

20247

[(set_attr "type" "alu")

20248

(set_attr "mode" "SI")])

20249

20250

@@ -8012,7 +8007,18 @@

20251

(const_int 0)))

20252

(set (match_operand:DI 0 "nonimmediate_operand" "=r,r,rm")

20253

(and:DI (match_dup 1) (match_dup 2)))]

20254

- "TARGET_64BIT && ix86_match_ccmode (insn, CCNOmode)

20255

+ "TARGET_64BIT

20256

+ && ix86_match_ccmode

20257

+ (insn,

20258

+ /* If we are going to emit andl instead of andq, and the operands[2]

20259

+ constant might have the SImode sign bit set, make sure the sign

20260

+ flag isn't tested, because the instruction will set the sign flag

20261

+ based on bit 31 rather than bit 63. If it isn't CONST_INT,

20262

+ conservatively assume it might have bit 31 set. */

20263

+ (satisfies_constraint_Z (operands[2])

20264

+ && (!CONST_INT_P (operands[2])

20265

+ || val_signbit_known_set_p (SImode, INTVAL (operands[2]))))

20266

+ ? CCZmode : CCNOmode)

20267

&& ix86_binary_operator_ok (AND, DImode, operands)"

20268

"@

20269

and{l}\t{%k2, %k0|%k0, %k2}

20270

Index: gcc/config/i386/t-rtems

20271

===================================================================

20272

--- a/src/gcc/config/i386/t-rtems (.../tags/gcc_4_8_2_release)

20273

+++ b/src/gcc/config/i386/t-rtems (.../branches/gcc-4_8-branch)

20274

@@ -17,11 +17,10 @@

20275

# <http://www.gnu.org/licenses/>.

20276

#

20277

20278

-MULTILIB_OPTIONS = mtune=i486/mtune=pentium/mtune=pentiumpro \

20279

-msoft-float

20280

+MULTILIB_OPTIONS = mtune=i486/mtune=pentium/mtune=pentiumpro msoft-float

20281

MULTILIB_DIRNAMES= m486 mpentium mpentiumpro soft-float

20282

-MULTILIB_MATCHES = msoft-float=mno-m80387

20283

-MULTILIB_MATCHES += mtune?pentium=mtune?k6 mtune?pentiumpro=mtune?mathlon

20284

+MULTILIB_MATCHES = msoft-float=mno-80387

20285

+MULTILIB_MATCHES += mtune?pentium=mtune?k6 mtune?pentiumpro=mtune?athlon

20286

MULTILIB_EXCEPTIONS = \

20287

mtune=pentium/*msoft-float* \

20288

mtune=pentiumpro/*msoft-float*

20289

Index: gcc/config/i386/winnt.c

20290

===================================================================

20291

--- a/src/gcc/config/i386/winnt.c (.../tags/gcc_4_8_2_release)

20292

+++ b/src/gcc/config/i386/winnt.c (.../branches/gcc-4_8-branch)

20293

@@ -547,8 +547,9 @@

20294

sets 'discard' characteristic, rather than telling linker

20295

to warn of size or content mismatch, so do the same. */

20296

bool discard = (flags & SECTION_CODE)

20297

- || lookup_attribute ("selectany",

20298

- DECL_ATTRIBUTES (decl));

20299

+ || (TREE_CODE (decl) != IDENTIFIER_NODE

20300

+ && lookup_attribute ("selectany",

20301

+ DECL_ATTRIBUTES (decl)));

20302

fprintf (asm_out_file, "\t.linkonce %s\n",

20303

(discard ? "discard" : "same_size"));

20304

}

20305

Index: gcc/config/i386/sse.md

20306

===================================================================

20307

--- a/src/gcc/config/i386/sse.md (.../tags/gcc_4_8_2_release)

20308

+++ b/src/gcc/config/i386/sse.md (.../branches/gcc-4_8-branch)

20309

@@ -605,6 +605,7 @@

20310

}

20311

[(set_attr "type" "ssemov")

20312

(set_attr "movu" "1")

20313

+ (set_attr "ssememalign" "8")

20314

(set_attr "prefix" "maybe_vex")

20315

(set (attr "mode")

20316

(cond [(match_test "TARGET_SSE_PACKED_SINGLE_INSN_OPTIMAL")

20317

@@ -634,6 +635,7 @@

20318

}

20319

[(set_attr "type" "ssemov")

20320

(set_attr "movu" "1")

20321

+ (set_attr "ssememalign" "8")

20322

(set_attr "prefix" "maybe_vex")

20323

(set (attr "mode")

20324

(cond [(ior (match_test "TARGET_SSE_PACKED_SINGLE_INSN_OPTIMAL")

20325

@@ -663,6 +665,7 @@

20326

}

20327

[(set_attr "type" "ssemov")

20328

(set_attr "movu" "1")

20329

+ (set_attr "ssememalign" "8")

20330

(set (attr "prefix_data16")

20331

(if_then_else

20332

(match_test "TARGET_AVX")

20333

@@ -696,6 +699,7 @@

20334

}

20335

[(set_attr "type" "ssemov")

20336

(set_attr "movu" "1")

20337

+ (set_attr "ssememalign" "8")

20338

(set (attr "prefix_data16")

20339

(if_then_else

20340

(match_test "TARGET_AVX")

20341

@@ -721,6 +725,7 @@

20342

"%vlddqu\t{%1, %0|%0, %1}"

20343

[(set_attr "type" "ssemov")

20344

(set_attr "movu" "1")

20345

+ (set_attr "ssememalign" "8")

20346

(set (attr "prefix_data16")

20347

(if_then_else

20348

(match_test "TARGET_AVX")

20349

@@ -1001,6 +1006,7 @@

20350

vrcpss\t{%1, %2, %0|%0, %2, %1}"

20351

[(set_attr "isa" "noavx,avx")

20352

(set_attr "type" "sse")

20353

+ (set_attr "ssememalign" "32")

20354

(set_attr "atom_sse_attr" "rcp")

20355

(set_attr "btver2_sse_attr" "rcp")

20356

(set_attr "prefix" "orig,vex")

20357

@@ -1089,6 +1095,7 @@

20358

vrsqrtss\t{%1, %2, %0|%0, %2, %1}"

20359

[(set_attr "isa" "noavx,avx")

20360

(set_attr "type" "sse")

20361

+ (set_attr "ssememalign" "32")

20362

(set_attr "prefix" "orig,vex")

20363

(set_attr "mode" "SF")])

20364

20365

@@ -2844,6 +2851,7 @@

20366

"%vcvtdq2pd\t{%1, %0|%0, %q1}"

20367

[(set_attr "type" "ssecvt")

20368

(set_attr "prefix" "maybe_vex")

20369

+ (set_attr "ssememalign" "64")

20370

(set_attr "mode" "V2DF")])

20371

20372

(define_insn "avx_cvtpd2dq256"

20373

@@ -3572,6 +3580,7 @@

20374

%vmovhps\t{%2, %0|%0, %2}"

20375

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20376

(set_attr "type" "ssemov")

20377

+ (set_attr "ssememalign" "64")

20378

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20379

(set_attr "mode" "V4SF,V4SF,V2SF,V2SF,V2SF")])

20380

20381

@@ -3617,6 +3626,7 @@

20382

%vmovlps\t{%2, %H0|%H0, %2}"

20383

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20384

(set_attr "type" "ssemov")

20385

+ (set_attr "ssememalign" "64")

20386

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20387

(set_attr "mode" "V4SF,V4SF,V2SF,V2SF,V2SF")])

20388

20389

@@ -3941,6 +3951,7 @@

20390

%vmovhlps\t{%1, %d0|%d0, %1}

20391

%vmovlps\t{%H1, %d0|%d0, %H1}"

20392

[(set_attr "type" "ssemov")

20393

+ (set_attr "ssememalign" "64")

20394

(set_attr "prefix" "maybe_vex")

20395

(set_attr "mode" "V2SF,V4SF,V2SF")])

20396

20397

@@ -3980,6 +3991,7 @@

20398

%vmovlps\t{%2, %H0|%H0, %2}"

20399

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20400

(set_attr "type" "ssemov")

20401

+ (set_attr "ssememalign" "64")

20402

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20403

(set_attr "mode" "V2SF,V2SF,V4SF,V4SF,V2SF")])

20404

20405

@@ -4033,6 +4045,7 @@

20406

%vmovlps\t{%2, %0|%0, %2}"

20407

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20408

(set_attr "type" "sseshuf,sseshuf,ssemov,ssemov,ssemov")

20409

+ (set_attr "ssememalign" "64")

20410

(set_attr "length_immediate" "1,1,*,*,*")

20411

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20412

(set_attr "mode" "V4SF,V4SF,V2SF,V2SF,V2SF")])

20413

@@ -4642,7 +4655,8 @@

20414

vmovlpd\t{%H1, %2, %0|%0, %2, %H1}

20415

%vmovhpd\t{%1, %0|%0, %1}"

20416

[(set_attr "isa" "noavx,avx,sse3,noavx,avx,*")

20417

- (set_attr "type" "sselog,sselog,sselog,ssemov,ssemov,ssemov")

20418

+ (set_attr "type" "sselog,sselog,sselog,ssemov,ssemov,ssemov")

20419

+ (set_attr "ssememalign" "64")

20420

(set_attr "prefix_data16" "*,*,*,1,*,1")

20421

(set_attr "prefix" "orig,vex,maybe_vex,orig,vex,maybe_vex")

20422

(set_attr "mode" "V2DF,V2DF,DF,V1DF,V1DF,V1DF")])

20423

@@ -4744,6 +4758,7 @@

20424

%vmovlpd\t{%2, %H0|%H0, %2}"

20425

[(set_attr "isa" "noavx,avx,sse3,noavx,avx,*")

20426

(set_attr "type" "sselog,sselog,sselog,ssemov,ssemov,ssemov")

20427

+ (set_attr "ssememalign" "64")

20428

(set_attr "prefix_data16" "*,*,*,1,*,1")

20429

(set_attr "prefix" "orig,vex,maybe_vex,orig,vex,maybe_vex")

20430

(set_attr "mode" "V2DF,V2DF,DF,V1DF,V1DF,V1DF")])

20431

@@ -4982,6 +4997,7 @@

20432

movhlps\t{%1, %0|%0, %1}

20433

movlps\t{%H1, %0|%0, %H1}"

20434

[(set_attr "type" "ssemov")

20435

+ (set_attr "ssememalign" "64")

20436

(set_attr "mode" "V2SF,V4SF,V2SF")])

20437

20438

;; Avoid combining registers from different units in a single alternative,

20439

@@ -5077,6 +5093,7 @@

20440

#"

20441

[(set_attr "isa" "noavx,avx,noavx,avx,*,*,*")

20442

(set_attr "type" "ssemov,ssemov,sselog,sselog,ssemov,fmov,imov")

20443

+ (set_attr "ssememalign" "64")

20444

(set_attr "prefix_data16" "1,*,*,*,*,*,*")

20445

(set_attr "prefix" "orig,vex,orig,vex,*,*,*")

20446

(set_attr "mode" "V1DF,V1DF,V2DF,V2DF,DF,DF,DF")])

20447

@@ -5145,6 +5162,7 @@

20448

(const_string "imov")

20449

]

20450

(const_string "ssemov")))

20451

+ (set_attr "ssememalign" "64")

20452

(set_attr "prefix_data16" "*,1,*,*,*,*,1,*,*,*,*")

20453

(set_attr "length_immediate" "*,*,*,*,*,1,*,*,*,*,*")

20454

(set_attr "prefix" "maybe_vex,orig,vex,orig,vex,orig,orig,vex,*,*,*")

20455

@@ -5189,6 +5207,7 @@

20456

(const_string "1")

20457

(const_string "*")))

20458

(set_attr "length_immediate" "*,*,*,*,*,1,*,*,*")

20459

+ (set_attr "ssememalign" "64")

20460

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex,orig,orig,vex,maybe_vex")

20461

(set_attr "mode" "DF,DF,V1DF,V1DF,V1DF,V2DF,V1DF,V1DF,V1DF")])

20462

20463

@@ -8736,6 +8755,7 @@

20464

"TARGET_SSE4_1"

20465

"%vpmov<extsuffix>bw\t{%1, %0|%0, %q1}"

20466

[(set_attr "type" "ssemov")

20467

+ (set_attr "ssememalign" "64")

20468

(set_attr "prefix_extra" "1")

20469

(set_attr "prefix" "maybe_vex")

20470

(set_attr "mode" "TI")])

20471

@@ -8766,6 +8786,7 @@

20472

"TARGET_SSE4_1"

20473

"%vpmov<extsuffix>bd\t{%1, %0|%0, %k1}"

20474

[(set_attr "type" "ssemov")

20475

+ (set_attr "ssememalign" "32")

20476

(set_attr "prefix_extra" "1")

20477

(set_attr "prefix" "maybe_vex")

20478

(set_attr "mode" "TI")])

20479

@@ -8791,6 +8812,7 @@

20480

"TARGET_SSE4_1"

20481

"%vpmov<extsuffix>wd\t{%1, %0|%0, %q1}"

20482

[(set_attr "type" "ssemov")

20483

+ (set_attr "ssememalign" "64")

20484

(set_attr "prefix_extra" "1")

20485

(set_attr "prefix" "maybe_vex")

20486

(set_attr "mode" "TI")])

20487

@@ -8818,6 +8840,7 @@

20488

"TARGET_SSE4_1"

20489

"%vpmov<extsuffix>bq\t{%1, %0|%0, %w1}"

20490

[(set_attr "type" "ssemov")

20491

+ (set_attr "ssememalign" "16")

20492

(set_attr "prefix_extra" "1")

20493

(set_attr "prefix" "maybe_vex")

20494

(set_attr "mode" "TI")])

20495

@@ -8845,6 +8868,7 @@

20496

"TARGET_SSE4_1"

20497

"%vpmov<extsuffix>wq\t{%1, %0|%0, %k1}"

20498

[(set_attr "type" "ssemov")

20499

+ (set_attr "ssememalign" "32")

20500

(set_attr "prefix_extra" "1")

20501

(set_attr "prefix" "maybe_vex")

20502

(set_attr "mode" "TI")])

20503

@@ -8868,6 +8892,7 @@

20504

"TARGET_SSE4_1"

20505

"%vpmov<extsuffix>dq\t{%1, %0|%0, %q1}"

20506

[(set_attr "type" "ssemov")

20507

+ (set_attr "ssememalign" "64")

20508

(set_attr "prefix_extra" "1")

20509

(set_attr "prefix" "maybe_vex")

20510

(set_attr "mode" "TI")])

20511

@@ -9151,6 +9176,7 @@

20512

[(set_attr "type" "sselog")

20513

(set_attr "prefix_data16" "1")

20514

(set_attr "prefix_extra" "1")

20515

+ (set_attr "ssememalign" "8")

20516

(set_attr "length_immediate" "1")

20517

(set_attr "memory" "none,load")

20518

(set_attr "mode" "TI")])

20519

@@ -9213,6 +9239,7 @@

20520

[(set_attr "type" "sselog")

20521

(set_attr "prefix_data16" "1")

20522

(set_attr "prefix_extra" "1")

20523

+ (set_attr "ssememalign" "8")

20524

(set_attr "length_immediate" "1")

20525

(set_attr "memory" "load")

20526

(set_attr "mode" "TI")])

20527

@@ -9240,6 +9267,7 @@

20528

(set_attr "prefix_data16" "1")

20529

(set_attr "prefix_extra" "1")

20530

(set_attr "prefix" "maybe_vex")

20531

+ (set_attr "ssememalign" "8")

20532

(set_attr "length_immediate" "1")

20533

(set_attr "btver2_decode" "vector")

20534

(set_attr "memory" "none,load")

20535

@@ -9267,6 +9295,7 @@

20536

[(set_attr "type" "sselog")

20537

(set_attr "prefix_data16" "1")

20538

(set_attr "prefix_extra" "1")

20539

+ (set_attr "ssememalign" "8")

20540

(set_attr "length_immediate" "1")

20541

(set_attr "prefix" "maybe_vex")

20542

(set_attr "btver2_decode" "vector")

20543

@@ -9293,6 +9322,7 @@

20544

[(set_attr "type" "sselog")

20545

(set_attr "prefix_data16" "1")

20546

(set_attr "prefix_extra" "1")

20547

+ (set_attr "ssememalign" "8")

20548

(set_attr "length_immediate" "1")

20549

(set_attr "memory" "none,load,none,load")

20550

(set_attr "btver2_decode" "vector,vector,vector,vector")

20551

@@ -9346,6 +9376,7 @@

20552

[(set_attr "type" "sselog")

20553

(set_attr "prefix_data16" "1")

20554

(set_attr "prefix_extra" "1")

20555

+ (set_attr "ssememalign" "8")

20556

(set_attr "length_immediate" "1")

20557

(set_attr "memory" "none,load")

20558

(set_attr "mode" "TI")])

20559

@@ -9399,6 +9430,7 @@

20560

[(set_attr "type" "sselog")

20561

(set_attr "prefix_data16" "1")

20562

(set_attr "prefix_extra" "1")

20563

+ (set_attr "ssememalign" "8")

20564

(set_attr "length_immediate" "1")

20565

(set_attr "memory" "load")

20566

(set_attr "mode" "TI")])

20567

@@ -9421,6 +9453,7 @@

20568

[(set_attr "type" "sselog")

20569

(set_attr "prefix_data16" "1")

20570

(set_attr "prefix_extra" "1")

20571

+ (set_attr "ssememalign" "8")

20572

(set_attr "length_immediate" "1")

20573

(set_attr "prefix" "maybe_vex")

20574

(set_attr "memory" "none,load")

20575

@@ -9445,6 +9478,7 @@

20576

[(set_attr "type" "sselog")

20577

(set_attr "prefix_data16" "1")

20578

(set_attr "prefix_extra" "1")

20579

+ (set_attr "ssememalign" "8")

20580

(set_attr "length_immediate" "1")

20581

(set_attr "prefix" "maybe_vex")

20582

(set_attr "memory" "none,load")

20583

@@ -9469,6 +9503,7 @@

20584

[(set_attr "type" "sselog")

20585

(set_attr "prefix_data16" "1")

20586

(set_attr "prefix_extra" "1")

20587

+ (set_attr "ssememalign" "8")

20588

(set_attr "length_immediate" "1")

20589

(set_attr "memory" "none,load,none,load")

20590

(set_attr "prefix" "maybe_vex")

20591

@@ -10213,7 +10248,6 @@

20592

[(set_attr "type" "ssecvt1")

20593

(set_attr "mode" "<MODE>")])

20594

20595

-;; scalar insns

20596

(define_expand "xop_vmfrcz<mode>2"

20597

[(set (match_operand:VF_128 0 "register_operand")

20598

(vec_merge:VF_128

20599

@@ -10223,11 +10257,9 @@

20600

(match_dup 3)

20601

(const_int 1)))]

20602

"TARGET_XOP"

20603

-{

20604

- operands[3] = CONST0_RTX (<MODE>mode);

20605

-})

20606

+ "operands[3] = CONST0_RTX (<MODE>mode);")

20607

20608

-(define_insn "*xop_vmfrcz_<mode>"

20609

+(define_insn "*xop_vmfrcz<mode>2"

20610

[(set (match_operand:VF_128 0 "register_operand" "=x")

20611

(vec_merge:VF_128

20612

(unspec:VF_128

20613

Index: gcc/config/i386/xopintrin.h

20614

===================================================================

20615

--- a/src/gcc/config/i386/xopintrin.h (.../tags/gcc_4_8_2_release)

20616

+++ b/src/gcc/config/i386/xopintrin.h (.../branches/gcc-4_8-branch)

20617

@@ -745,13 +745,17 @@

20618

extern __inline __m128 __attribute__((__gnu_inline__, __always_inline__, __artificial__))

20619

_mm_frcz_ss (__m128 __A, __m128 __B)

20620

{

20621

- return (__m128) __builtin_ia32_vfrczss ((__v4sf)__A, (__v4sf)__B);

20622

+ return (__m128) __builtin_ia32_movss ((__v4sf)__A,

20623

+ (__v4sf)

20624

+ __builtin_ia32_vfrczss ((__v4sf)__B));

20625

}

20626

20627

extern __inline __m128d __attribute__((__gnu_inline__, __always_inline__, __artificial__))

20628

_mm_frcz_sd (__m128d __A, __m128d __B)

20629

{

20630

- return (__m128d) __builtin_ia32_vfrczsd ((__v2df)__A, (__v2df)__B);

20631

+ return (__m128d) __builtin_ia32_movsd ((__v2df)__A,

20632

+ (__v2df)

20633

+ __builtin_ia32_vfrczsd ((__v2df)__B));

20634

}

20635

20636

extern __inline __m256 __attribute__((__gnu_inline__, __always_inline__, __artificial__))

20637

Index: gcc/config/i386/driver-i386.c

20638

===================================================================

20639

--- a/src/gcc/config/i386/driver-i386.c (.../tags/gcc_4_8_2_release)

20640

+++ b/src/gcc/config/i386/driver-i386.c (.../branches/gcc-4_8-branch)

20641

@@ -126,6 +126,18 @@

20642

case 0x0c:

20643

level1->sizekb = 16; level1->assoc = 4; level1->line = 32;

20644

break;

20645

+ case 0x0d:

20646

+ level1->sizekb = 16; level1->assoc = 4; level1->line = 64;

20647

+ break;

20648

+ case 0x0e:

20649

+ level1->sizekb = 24; level1->assoc = 6; level1->line = 64;

20650

+ break;

20651

+ case 0x21:

20652

+ level2->sizekb = 256; level2->assoc = 8; level2->line = 64;

20653

+ break;

20654

+ case 0x24:

20655

+ level2->sizekb = 1024; level2->assoc = 16; level2->line = 64;

20656

+ break;

20657

case 0x2c:

20658

level1->sizekb = 32; level1->assoc = 8; level1->line = 64;

20659

break;

20660

@@ -162,6 +174,9 @@

20661

case 0x45:

20662

level2->sizekb = 2048; level2->assoc = 4; level2->line = 32;

20663

break;

20664

+ case 0x48:

20665

+ level2->sizekb = 3072; level2->assoc = 12; level2->line = 64;

20666

+ break;

20667

case 0x49:

20668

if (xeon_mp)

20669

break;

20670

@@ -203,6 +218,9 @@

20671

case 0x7f:

20672

level2->sizekb = 512; level2->assoc = 2; level2->line = 64;

20673

break;

20674

+ case 0x80:

20675

+ level2->sizekb = 512; level2->assoc = 8; level2->line = 64;

20676

+ break;

20677

case 0x82:

20678

level2->sizekb = 256; level2->assoc = 8; level2->line = 32;

20679

break;

20680

Index: gcc/config/i386/i386.c

20681

===================================================================

20682

--- a/src/gcc/config/i386/i386.c (.../tags/gcc_4_8_2_release)

20683

+++ b/src/gcc/config/i386/i386.c (.../branches/gcc-4_8-branch)

20684

@@ -1378,7 +1378,7 @@

20685

8, /* MMX or SSE register to integer */

20686

8, /* size of l1 cache. */

20687

1024, /* size of l2 cache. */

20688

- 128, /* size of prefetch block */

20689

+ 64, /* size of prefetch block */

20690

8, /* number of parallel prefetches */

20691

1, /* Branch cost */

20692

COSTS_N_INSNS (6), /* cost of FADD and FSUB insns. */

20693

@@ -1894,10 +1894,10 @@

20694

20695

20696

/* X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL */

20697

- m_COREI7 | m_AMDFAM10 | m_BDVER | m_BTVER,

20698

+ m_COREI7 | m_HASWELL | m_AMDFAM10 | m_BDVER | m_BTVER,

20699

20700

/* X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL */

20701

- m_COREI7 | m_BDVER,

20702

+ m_COREI7 | m_HASWELL| m_BDVER,

20703

20704

/* X86_TUNE_SSE_PACKED_SINGLE_INSN_OPTIMAL */

20705

m_BDVER ,

20706

@@ -2409,6 +2409,7 @@

20707

/* Processor target table, indexed by processor number */

20708

struct ptt

20709

{

20710

+ const char *const name; /* processor name */

20711

const struct processor_costs *cost; /* Processor costs */

20712

const int align_loop; /* Default alignments. */

20713

const int align_loop_max_skip;

20714

@@ -2417,67 +2418,32 @@

20715

const int align_func;

20716

};

20717

20718

+/* This table must be in sync with enum processor_type in i386.h. */

20719

static const struct ptt processor_target_table[PROCESSOR_max] =

20720

{

20721

- {&i386_cost, 4, 3, 4, 3, 4},

20722

- {&i486_cost, 16, 15, 16, 15, 16},

20723

- {&pentium_cost, 16, 7, 16, 7, 16},

20724

- {&pentiumpro_cost, 16, 15, 16, 10, 16},

20725

- {&geode_cost, 0, 0, 0, 0, 0},

20726

- {&k6_cost, 32, 7, 32, 7, 32},

20727

- {&athlon_cost, 16, 7, 16, 7, 16},

20728

- {&pentium4_cost, 0, 0, 0, 0, 0},

20729

- {&k8_cost, 16, 7, 16, 7, 16},

20730

- {&nocona_cost, 0, 0, 0, 0, 0},

20731

- /* Core 2 */

20732

- {&core_cost, 16, 10, 16, 10, 16},

20733

- /* Core i7 */

20734

- {&core_cost, 16, 10, 16, 10, 16},

20735

- /* Core avx2 */

20736

- {&core_cost, 16, 10, 16, 10, 16},

20737

- {&generic32_cost, 16, 7, 16, 7, 16},

20738

- {&generic64_cost, 16, 10, 16, 10, 16},

20739

- {&amdfam10_cost, 32, 24, 32, 7, 32},

20740

- {&bdver1_cost, 16, 10, 16, 7, 11},

20741

- {&bdver2_cost, 16, 10, 16, 7, 11},

20742

- {&bdver3_cost, 16, 10, 16, 7, 11},

20743

- {&btver1_cost, 16, 10, 16, 7, 11},

20744

- {&btver2_cost, 16, 10, 16, 7, 11},

20745

- {&atom_cost, 16, 15, 16, 7, 16}

20746

+ {"generic", &generic32_cost, 16, 7, 16, 7, 16},

20747

+ {"generic", &generic64_cost, 16, 10, 16, 10, 16},

20748

+ {"i386", &i386_cost, 4, 3, 4, 3, 4},

20749

+ {"i486", &i486_cost, 16, 15, 16, 15, 16},

20750

+ {"pentium", &pentium_cost, 16, 7, 16, 7, 16},

20751

+ {"pentiumpro", &pentiumpro_cost, 16, 15, 16, 10, 16},

20752

+ {"pentium4", &pentium4_cost, 0, 0, 0, 0, 0},

20753

+ {"nocona", &nocona_cost, 0, 0, 0, 0, 0},

20754

+ {"core2", &core_cost, 16, 10, 16, 10, 16},

20755

+ {"corei7", &core_cost, 16, 10, 16, 10, 16},

20756

+ {"core-avx2", &core_cost, 16, 10, 16, 10, 16},

20757

+ {"atom", &atom_cost, 16, 15, 16, 7, 16},

20758

+ {"geode", &geode_cost, 0, 0, 0, 0, 0},

20759

+ {"k6", &k6_cost, 32, 7, 32, 7, 32},

20760

+ {"athlon", &athlon_cost, 16, 7, 16, 7, 16},

20761

+ {"k8", &k8_cost, 16, 7, 16, 7, 16},

20762

+ {"amdfam10", &amdfam10_cost, 32, 24, 32, 7, 32},

20763

+ {"bdver1", &bdver1_cost, 16, 10, 16, 7, 11},

20764

+ {"bdver2", &bdver2_cost, 16, 10, 16, 7, 11},

20765

+ {"bdver3", &bdver3_cost, 16, 10, 16, 7, 11},

20766

+ {"btver1", &btver1_cost, 16, 10, 16, 7, 11},

20767

+ {"btver2", &btver2_cost, 16, 10, 16, 7, 11}

20768

};

20769

-

20770

-static const char *const cpu_names[TARGET_CPU_DEFAULT_max] =

20771

-{

20772

- "generic",

20773

- "i386",

20774

- "i486",

20775

- "pentium",

20776

- "pentium-mmx",

20777

- "pentiumpro",

20778

- "pentium2",

20779

- "pentium3",

20780

- "pentium4",

20781

- "pentium-m",

20782

- "prescott",

20783

- "nocona",

20784

- "core2",

20785

- "corei7",

20786

- "core-avx2",

20787

- "atom",

20788

- "geode",

20789

- "k6",

20790

- "k6-2",

20791

- "k6-3",

20792

- "athlon",

20793

- "athlon-4",

20794

- "k8",

20795

- "amdfam10",

20796

- "bdver1",

20797

- "bdver2",

20798

- "bdver3",

20799

- "btver1",

20800

- "btver2"

20801

-};

20802

20803

static bool

20804

gate_insert_vzeroupper (void)

20805

@@ -2983,7 +2949,7 @@

20806

{"bdver3", PROCESSOR_BDVER3, CPU_BDVER3,

20807

PTA_64BIT | PTA_MMX | PTA_SSE | PTA_SSE2 | PTA_SSE3

20808

20809

- | PTA_SSE4_2 | PTA_AES | PTA_PCLMUL | PTA_AVX

20810

20811

20812

| PTA_FMA | PTA_PRFCHW | PTA_FXSR | PTA_XSAVE

20813

| PTA_XSAVEOPT},

20814

@@ -3125,7 +3091,8 @@

20815

ix86_tune_string = ix86_arch_string;

20816

if (!ix86_tune_string)

20817

{

20818

- ix86_tune_string = cpu_names[TARGET_CPU_DEFAULT];

20819

+ ix86_tune_string

20820

+ = processor_target_table[TARGET_CPU_DEFAULT].name;

20821

ix86_tune_defaulted = 1;

20822

}

20823

20824

@@ -4078,19 +4045,15 @@

20825

= ix86_target_string (ptr->x_ix86_isa_flags, ptr->x_target_flags,

20826

NULL, NULL, ptr->x_ix86_fpmath, false);

20827

20828

+ gcc_assert (ptr->arch < PROCESSOR_max);

20829

fprintf (file, "%*sarch = %d (%s)\n",

20830

indent, "",

20831

- ptr->arch,

20832

- ((ptr->arch < TARGET_CPU_DEFAULT_max)

20833

- ? cpu_names[ptr->arch]

20834

- : "<unknown>"));

20835

+ ptr->arch, processor_target_table[ptr->arch].name);

20836

20837

+ gcc_assert (ptr->tune < PROCESSOR_max);

20838

fprintf (file, "%*stune = %d (%s)\n",

20839

indent, "",

20840

- ptr->tune,

20841

- ((ptr->tune < TARGET_CPU_DEFAULT_max)

20842

- ? cpu_names[ptr->tune]

20843

- : "<unknown>"));

20844

+ ptr->tune, processor_target_table[ptr->tune].name);

20845

20846

fprintf (file, "%*sbranch_cost = %d\n", indent, "", ptr->branch_cost);

20847

20848

@@ -5409,6 +5372,17 @@

20849

bool win;

20850

int j;

20851

20852

+ /* For pre-AVX disallow unaligned loads/stores where the

20853

+ instructions don't support it. */

20854

+ if (!TARGET_AVX

20855

+ && VECTOR_MODE_P (GET_MODE (op))

20856

+ && misaligned_operand (op, GET_MODE (op)))

20857

+ {

20858

+ int min_align = get_attr_ssememalign (insn);

20859

+ if (min_align == 0)

20860

+ return false;

20861

+ }

20862

+

20863

/* A unary operator may be accepted by the predicate, but it

20864

is irrelevant for matching constraints. */

20865

if (UNARY_P (op))

20866

@@ -5830,7 +5804,8 @@

20867

}

20868

return TYPE_MODE (type);

20869

}

20870

- else if ((size == 8 || size == 16) && !TARGET_SSE)

20871

+ else if (((size == 8 && TARGET_64BIT) || size == 16)

20872

+ && !TARGET_SSE)

20873

{

20874

static bool warnedsse;

20875

20876

@@ -5842,10 +5817,21 @@

20877

warning (0, "SSE vector argument without SSE "

20878

"enabled changes the ABI");

20879

}

20880

- return mode;

20881

}

20882

- else

20883

- return mode;

20884

+ else if ((size == 8 && !TARGET_64BIT) && !TARGET_MMX)

20885

+ {

20886

+ static bool warnedmmx;

20887

+

20888

+ if (cum

20889

+ && !warnedmmx

20890

+ && cum->warn_mmx)

20891

+ {

20892

+ warnedmmx = true;

20893

+ warning (0, "MMX vector argument without MMX "

20894

+ "enabled changes the ABI");

20895

+ }

20896

+ }

20897

+ return mode;

20898

}

20899

20900

gcc_unreachable ();

20901

@@ -7235,9 +7221,15 @@

20902

switch (regno)

20903

{

20904

case AX_REG:

20905

+ case DX_REG:

20906

return true;

20907

+ case DI_REG:

20908

+ case SI_REG:

20909

+ return TARGET_64BIT && ix86_abi != MS_ABI;

20910

20911

- case FIRST_FLOAT_REG:

20912

+ /* Complex values are returned in %st(0)/%st(1) pair. */

20913

+ case ST0_REG:

20914

+ case ST1_REG:

20915

/* TODO: The function should depend on current function ABI but

20916

builtins.c would need updating then. Therefore we use the

20917

default ABI. */

20918

@@ -7245,10 +7237,12 @@

20919

return false;

20920

return TARGET_FLOAT_RETURNS_IN_80387;

20921

20922

- case FIRST_SSE_REG:

20923

+ /* Complex values are returned in %xmm0/%xmm1 pair. */

20924

+ case XMM0_REG:

20925

+ case XMM1_REG:

20926

return TARGET_SSE;

20927

20928

- case FIRST_MMX_REG:

20929

+ case MM0_REG:

20930

if (TARGET_MACHO || TARGET_64BIT)

20931

return false;

20932

return TARGET_MMX;

20933

@@ -10560,18 +10554,21 @@

20934

}

20935

m->fs.sp_offset += allocate;

20936

20937

+ /* Use stack_pointer_rtx for relative addressing so that code

20938

+ works for realigned stack, too. */

20939

if (r10_live && eax_live)

20940

{

20941

- t = choose_baseaddr (m->fs.sp_offset - allocate);

20942

+ t = plus_constant (Pmode, stack_pointer_rtx, allocate);

20943

emit_move_insn (gen_rtx_REG (word_mode, R10_REG),

20944

gen_frame_mem (word_mode, t));

20945

- t = choose_baseaddr (m->fs.sp_offset - allocate - UNITS_PER_WORD);

20946

+ t = plus_constant (Pmode, stack_pointer_rtx,

20947

+ allocate - UNITS_PER_WORD);

20948

emit_move_insn (gen_rtx_REG (word_mode, AX_REG),

20949

gen_frame_mem (word_mode, t));

20950

}

20951

else if (eax_live || r10_live)

20952

{

20953

- t = choose_baseaddr (m->fs.sp_offset - allocate);

20954

+ t = plus_constant (Pmode, stack_pointer_rtx, allocate);

20955

emit_move_insn (gen_rtx_REG (word_mode,

20956

(eax_live ? AX_REG : R10_REG)),

20957

gen_frame_mem (word_mode, t));

20958

@@ -11561,30 +11558,6 @@

20959

}

20960

}

20961

20962

-/* Determine if op is suitable SUBREG RTX for address. */

20963

-

20964

-static bool

20965

-ix86_address_subreg_operand (rtx op)

20966

-{

20967

- enum machine_mode mode;

20968

-

20969

- if (!REG_P (op))

20970

- return false;

20971

-

20972

- mode = GET_MODE (op);

20973

-

20974

- if (GET_MODE_CLASS (mode) != MODE_INT)

20975

- return false;

20976

-

20977

- /* Don't allow SUBREGs that span more than a word. It can lead to spill

20978

- failures when the register is one word out of a two word structure. */

20979

- if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)

20980

- return false;

20981

-

20982

- /* Allow only SUBREGs of non-eliminable hard registers. */

20983

- return register_no_elim_operand (op, mode);

20984

-}

20985

-

20986

/* Extract the parts of an RTL expression that is a valid memory address

20987

for an instruction. Return 0 if the structure of the address is

20988

grossly off. Return -1 if the address contains ASHIFT, so it is not

20989

@@ -11641,7 +11614,7 @@

20990

base = addr;

20991

else if (GET_CODE (addr) == SUBREG)

20992

{

20993

- if (ix86_address_subreg_operand (SUBREG_REG (addr)))

20994

+ if (REG_P (SUBREG_REG (addr)))

20995

base = addr;

20996

else

20997

return 0;

20998

@@ -11705,7 +11678,7 @@

20999

break;

21000

21001

case SUBREG:

21002

- if (!ix86_address_subreg_operand (SUBREG_REG (op)))

21003

+ if (!REG_P (SUBREG_REG (op)))

21004

return 0;

21005

/* FALLTHRU */

21006

21007

@@ -11750,19 +11723,6 @@

21008

scale = 1 << scale;

21009

retval = -1;

21010

}

21011

- else if (CONST_INT_P (addr))

21012

- {

21013

- if (!x86_64_immediate_operand (addr, VOIDmode))

21014

- return 0;

21015

-

21016

- /* Constant addresses are sign extended to 64bit, we have to

21017

- prevent addresses from 0x80000000 to 0xffffffff in x32 mode. */

21018

- if (TARGET_X32

21019

- && val_signbit_known_set_p (SImode, INTVAL (addr)))

21020

- return 0;

21021

-

21022

- disp = addr;

21023

- }

21024

else

21025

disp = addr; /* displacement */

21026

21027

@@ -11771,18 +11731,12 @@

21028

if (REG_P (index))

21029

;

21030

else if (GET_CODE (index) == SUBREG

21031

- && ix86_address_subreg_operand (SUBREG_REG (index)))

21032

+ && REG_P (SUBREG_REG (index)))

21033

;

21034

else

21035

return 0;

21036

}

21037

21038

-/* Address override works only on the (%reg) part of %fs:(%reg). */

21039

- if (seg != SEG_DEFAULT

21040

- && ((base && GET_MODE (base) != word_mode)

21041

- || (index && GET_MODE (index) != word_mode)))

21042

- return 0;

21043

-

21044

/* Extract the integral value of scale. */

21045

if (scale_rtx)

21046

{

21047

@@ -12258,6 +12212,45 @@

21048

return false;

21049

}

21050

21051

+/* Determine if op is suitable RTX for an address register.

21052

+ Return naked register if a register or a register subreg is

21053

+ found, otherwise return NULL_RTX. */

21054

+

21055

+static rtx

21056

+ix86_validate_address_register (rtx op)

21057

+{

21058

+ enum machine_mode mode = GET_MODE (op);

21059

+

21060

+ /* Only SImode or DImode registers can form the address. */

21061

+ if (mode != SImode && mode != DImode)

21062

+ return NULL_RTX;

21063

+

21064

+ if (REG_P (op))

21065

+ return op;

21066

+ else if (GET_CODE (op) == SUBREG)

21067

+ {

21068

+ rtx reg = SUBREG_REG (op);

21069

+

21070

+ if (!REG_P (reg))

21071

+ return NULL_RTX;

21072

+

21073

+ mode = GET_MODE (reg);

21074

+

21075

+ /* Don't allow SUBREGs that span more than a word. It can

21076

+ lead to spill failures when the register is one word out

21077

+ of a two word structure. */

21078

+ if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)

21079

+ return NULL_RTX;

21080

+

21081

+ /* Allow only SUBREGs of non-eliminable hard registers. */

21082

+ if (register_no_elim_operand (reg, mode))

21083

+ return reg;

21084

+ }

21085

+

21086

+ /* Op is not a register. */

21087

+ return NULL_RTX;

21088

+}

21089

+

21090

/* Recognizes RTL expressions that are valid memory addresses for an

21091

instruction. The MODE argument is the machine mode for the MEM

21092

expression that wants to use this address.

21093

@@ -12273,6 +12266,7 @@

21094

struct ix86_address parts;

21095

rtx base, index, disp;

21096

HOST_WIDE_INT scale;

21097

+ enum ix86_address_seg seg;

21098

21099

if (ix86_decompose_address (addr, &parts) <= 0)

21100

/* Decomposition failed. */

21101

@@ -12282,23 +12276,16 @@

21102

index = parts.index;

21103

disp = parts.disp;

21104

scale = parts.scale;

21105

+ seg = parts.seg;

21106

21107

/* Validate base register. */

21108

if (base)

21109

{

21110

- rtx reg;

21111

+ rtx reg = ix86_validate_address_register (base);

21112

21113

- if (REG_P (base))

21114

- reg = base;

21115

- else if (GET_CODE (base) == SUBREG && REG_P (SUBREG_REG (base)))

21116

- reg = SUBREG_REG (base);

21117

- else

21118

- /* Base is not a register. */

21119

+ if (reg == NULL_RTX)

21120

return false;

21121

21122

- if (GET_MODE (base) != SImode && GET_MODE (base) != DImode)

21123

- return false;

21124

-

21125

if ((strict && ! REG_OK_FOR_BASE_STRICT_P (reg))

21126

|| (! strict && ! REG_OK_FOR_BASE_NONSTRICT_P (reg)))

21127

/* Base is not valid. */

21128

@@ -12308,19 +12295,11 @@

21129

/* Validate index register. */

21130

if (index)

21131

{

21132

- rtx reg;

21133

+ rtx reg = ix86_validate_address_register (index);

21134

21135

- if (REG_P (index))

21136

- reg = index;

21137

- else if (GET_CODE (index) == SUBREG && REG_P (SUBREG_REG (index)))

21138

- reg = SUBREG_REG (index);

21139

- else

21140

- /* Index is not a register. */

21141

+ if (reg == NULL_RTX)

21142

return false;

21143

21144

- if (GET_MODE (index) != SImode && GET_MODE (index) != DImode)

21145

- return false;

21146

-

21147

if ((strict && ! REG_OK_FOR_INDEX_STRICT_P (reg))

21148

|| (! strict && ! REG_OK_FOR_INDEX_NONSTRICT_P (reg)))

21149

/* Index is not valid. */

21150

@@ -12332,6 +12311,12 @@

21151

&& GET_MODE (base) != GET_MODE (index))

21152

return false;

21153

21154

+ /* Address override works only on the (%reg) part of %fs:(%reg). */

21155

+ if (seg != SEG_DEFAULT

21156

+ && ((base && GET_MODE (base) != word_mode)

21157

+ || (index && GET_MODE (index) != word_mode)))

21158

+ return false;

21159

+

21160

/* Validate scale factor. */

21161

if (scale != 1)

21162

{

21163

@@ -12453,6 +12438,12 @@

21164

&& !x86_64_immediate_operand (disp, VOIDmode))

21165

/* Displacement is out of range. */

21166

return false;

21167

+ /* In x32 mode, constant addresses are sign extended to 64bit, so

21168

+ we have to prevent addresses from 0x80000000 to 0xffffffff. */

21169

+ else if (TARGET_X32 && !(index || base)

21170

+ && CONST_INT_P (disp)

21171

+ && val_signbit_known_set_p (SImode, INTVAL (disp)))

21172

+ return false;

21173

}

21174

21175

/* Everything looks valid. */

21176

@@ -13817,8 +13808,6 @@

21177

Those same assemblers have the same but opposite lossage on cmov. */

21178

if (mode == CCmode)

21179

suffix = fp ? "nbe" : "a";

21180

- else if (mode == CCCmode)

21181

- suffix = "b";

21182

else

21183

gcc_unreachable ();

21184

break;

21185

@@ -13840,8 +13829,12 @@

21186

}

21187

break;

21188

case LTU:

21189

- gcc_assert (mode == CCmode || mode == CCCmode);

21190

- suffix = "b";

21191

+ if (mode == CCmode)

21192

+ suffix = "b";

21193

+ else if (mode == CCCmode)

21194

+ suffix = "c";

21195

+ else

21196

+ gcc_unreachable ();

21197

break;

21198

case GE:

21199

switch (mode)

21200

@@ -13861,20 +13854,20 @@

21201

}

21202

break;

21203

case GEU:

21204

- /* ??? As above. */

21205

- gcc_assert (mode == CCmode || mode == CCCmode);

21206

- suffix = fp ? "nb" : "ae";

21207

+ if (mode == CCmode)

21208

+ suffix = fp ? "nb" : "ae";

21209

+ else if (mode == CCCmode)

21210

+ suffix = "nc";

21211

+ else

21212

+ gcc_unreachable ();

21213

break;

21214

case LE:

21215

gcc_assert (mode == CCmode || mode == CCGCmode || mode == CCNOmode);

21216

suffix = "le";

21217

break;

21218

case LEU:

21219

- /* ??? As above. */

21220

if (mode == CCmode)

21221

suffix = "be";

21222

- else if (mode == CCCmode)

21223

- suffix = fp ? "nb" : "ae";

21224

else

21225

gcc_unreachable ();

21226

break;

21227

@@ -15340,7 +15333,7 @@

21228

rtx arg = XEXP (XEXP (link, 0), 0);

21229

21230

if (ix86_check_avx256_register (&arg, NULL))

21231

- return AVX_U128_ANY;

21232

+ return AVX_U128_DIRTY;

21233

}

21234

}

21235

21236

@@ -15460,8 +15453,8 @@

21237

{

21238

bool avx_reg256_found = false;

21239

note_stores (pat, ix86_check_avx256_stores, &avx_reg256_found);

21240

- if (!avx_reg256_found)

21241

- return AVX_U128_CLEAN;

21242

+

21243

+ return avx_reg256_found ? AVX_U128_DIRTY : AVX_U128_CLEAN;

21244

}

21245

21246

/* Otherwise, return current mode. Remember that if insn

21247

@@ -18486,12 +18479,7 @@

21248

return CCmode;

21249

case GTU: /* CF=0 & ZF=0 */

21250

case LEU: /* CF=1 | ZF=1 */

21251

- /* Detect overflow checks. They need just the carry flag. */

21252

- if (GET_CODE (op0) == MINUS

21253

- && rtx_equal_p (op1, XEXP (op0, 0)))

21254

- return CCCmode;

21255

- else

21256

- return CCmode;

21257

+ return CCmode;

21258

/* Codes possibly doable only with sign flag when

21259

comparing against zero. */

21260

case GE: /* SF=OF or SF=0 */

21261

@@ -21740,6 +21728,21 @@

21262

return SImode;

21263

}

21264

21265

+/* Copy the address to a Pmode register. This is used for x32 to

21266

+ truncate DImode TLS address to a SImode register. */

21267

+

21268

+static rtx

21269

+ix86_copy_addr_to_reg (rtx addr)

21270

+{

21271

+ if (GET_MODE (addr) == Pmode)

21272

+ return copy_addr_to_reg (addr);

21273

+ else

21274

+ {

21275

+ gcc_assert (GET_MODE (addr) == DImode && Pmode == SImode);

21276

+ return gen_rtx_SUBREG (SImode, copy_to_mode_reg (DImode, addr), 0);

21277

+ }

21278

+}

21279

+

21280

/* When SRCPTR is non-NULL, output simple loop to move memory

21281

pointer to SRCPTR to DESTPTR via chunks of MODE unrolled UNROLL times,

21282

overall size is COUNT specified in bytes. When SRCPTR is NULL, output the

21283

@@ -22728,8 +22731,8 @@

21284

gcc_assert (alg != no_stringop);

21285

if (!count)

21286

count_exp = copy_to_mode_reg (GET_MODE (count_exp), count_exp);

21287

- destreg = copy_addr_to_reg (XEXP (dst, 0));

21288

- srcreg = copy_addr_to_reg (XEXP (src, 0));

21289

+ destreg = ix86_copy_addr_to_reg (XEXP (dst, 0));

21290

+ srcreg = ix86_copy_addr_to_reg (XEXP (src, 0));

21291

switch (alg)

21292

{

21293

case libcall:

21294

@@ -23119,7 +23122,7 @@

21295

gcc_assert (alg != no_stringop);

21296

if (!count)

21297

count_exp = copy_to_mode_reg (counter_mode (count_exp), count_exp);

21298

- destreg = copy_addr_to_reg (XEXP (dst, 0));

21299

+ destreg = ix86_copy_addr_to_reg (XEXP (dst, 0));

21300

switch (alg)

21301

{

21302

case libcall:

21303

@@ -24988,8 +24991,17 @@

21304

int

21305

ix86_data_alignment (tree type, int align)

21306

{

21307

- int max_align = optimize_size ? BITS_PER_WORD : MIN (256, MAX_OFILE_ALIGNMENT);

21308

+ /* A data structure, equal or greater than the size of a cache line

21309

+ (64 bytes in the Pentium 4 and other recent Intel processors, including

21310

+ processors based on Intel Core microarchitecture) should be aligned

21311

+ so that its base address is a multiple of a cache line size. */

21312

21313

+ int max_align

21314

+ = MIN ((unsigned) ix86_tune_cost->prefetch_block * 8, MAX_OFILE_ALIGNMENT);

21315

+

21316

+ if (max_align < BITS_PER_WORD)

21317

+ max_align = BITS_PER_WORD;

21318

+

21319

if (AGGREGATE_TYPE_P (type)

21320

&& TYPE_SIZE (type)

21321

&& TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST

21322

@@ -27984,8 +27996,8 @@

21323

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_shlv8hi3, "__builtin_ia32_vpshlw", IX86_BUILTIN_VPSHLW, UNKNOWN, (int)MULTI_ARG_2_HI },

21324

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_shlv16qi3, "__builtin_ia32_vpshlb", IX86_BUILTIN_VPSHLB, UNKNOWN, (int)MULTI_ARG_2_QI },

21325

21326

- { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv4sf2, "__builtin_ia32_vfrczss", IX86_BUILTIN_VFRCZSS, UNKNOWN, (int)MULTI_ARG_2_SF },

21327

- { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv2df2, "__builtin_ia32_vfrczsd", IX86_BUILTIN_VFRCZSD, UNKNOWN, (int)MULTI_ARG_2_DF },

21328

+ { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv4sf2, "__builtin_ia32_vfrczss", IX86_BUILTIN_VFRCZSS, UNKNOWN, (int)MULTI_ARG_1_SF },

21329

+ { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv2df2, "__builtin_ia32_vfrczsd", IX86_BUILTIN_VFRCZSD, UNKNOWN, (int)MULTI_ARG_1_DF },

21330

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv4sf2, "__builtin_ia32_vfrczps", IX86_BUILTIN_VFRCZPS, UNKNOWN, (int)MULTI_ARG_1_SF },

21331

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv2df2, "__builtin_ia32_vfrczpd", IX86_BUILTIN_VFRCZPD, UNKNOWN, (int)MULTI_ARG_1_DF },

21332

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv8sf2, "__builtin_ia32_vfrczps256", IX86_BUILTIN_VFRCZPS256, UNKNOWN, (int)MULTI_ARG_1_SF2 },

21333

@@ -31245,11 +31257,12 @@

21334

21335

static rtx

21336

ix86_expand_special_args_builtin (const struct builtin_description *d,

21337

- tree exp, rtx target)

21338

+ tree exp, rtx target)

21339

{

21340

tree arg;

21341

rtx pat, op;

21342

unsigned int i, nargs, arg_adjust, memory;

21343

+ bool aligned_mem = false;

21344

struct

21345

{

21346

rtx op;

21347

@@ -31295,6 +31308,15 @@

21348

nargs = 1;

21349

klass = load;

21350

memory = 0;

21351

+ switch (icode)

21352

+ {

21353

+ case CODE_FOR_sse4_1_movntdqa:

21354

+ case CODE_FOR_avx2_movntdqa:

21355

+ aligned_mem = true;

21356

+ break;

21357

+ default:

21358

+ break;

21359

+ }

21360

break;

21361

case VOID_FTYPE_PV2SF_V4SF:

21362

case VOID_FTYPE_PV4DI_V4DI:

21363

@@ -31312,6 +31334,26 @@

21364

klass = store;

21365

/* Reserve memory operand for target. */

21366

memory = ARRAY_SIZE (args);

21367

+ switch (icode)

21368

+ {

21369

+ /* These builtins and instructions require the memory

21370

+ to be properly aligned. */

21371

+ case CODE_FOR_avx_movntv4di:

21372

+ case CODE_FOR_sse2_movntv2di:

21373

+ case CODE_FOR_avx_movntv8sf:

21374

+ case CODE_FOR_sse_movntv4sf:

21375

+ case CODE_FOR_sse4a_vmmovntv4sf:

21376

+ case CODE_FOR_avx_movntv4df:

21377

+ case CODE_FOR_sse2_movntv2df:

21378

+ case CODE_FOR_sse4a_vmmovntv2df:

21379

+ case CODE_FOR_sse2_movntidi:

21380

+ case CODE_FOR_sse_movntq:

21381

+ case CODE_FOR_sse2_movntisi:

21382

+ aligned_mem = true;

21383

+ break;

21384

+ default:

21385

+ break;

21386

+ }

21387

break;

21388

case V4SF_FTYPE_V4SF_PCV2SF:

21389

case V2DF_FTYPE_V2DF_PCDOUBLE:

21390

@@ -31368,6 +31410,17 @@

21391

{

21392

op = force_reg (Pmode, convert_to_mode (Pmode, op, 1));

21393

target = gen_rtx_MEM (tmode, op);

21394

+ /* target at this point has just BITS_PER_UNIT MEM_ALIGN

21395

+ on it. Try to improve it using get_pointer_alignment,

21396

+ and if the special builtin is one that requires strict

21397

+ mode alignment, also from it's GET_MODE_ALIGNMENT.

21398

+ Failure to do so could lead to ix86_legitimate_combined_insn

21399

+ rejecting all changes to such insns. */

21400

+ unsigned int align = get_pointer_alignment (arg);

21401

+ if (aligned_mem && align < GET_MODE_ALIGNMENT (tmode))

21402

+ align = GET_MODE_ALIGNMENT (tmode);

21403

+ if (MEM_ALIGN (target) < align)

21404

+ set_mem_align (target, align);

21405

}

21406

else

21407

target = force_reg (tmode, op);

21408

@@ -31413,8 +31466,17 @@

21409

/* This must be the memory operand. */

21410

op = force_reg (Pmode, convert_to_mode (Pmode, op, 1));

21411

op = gen_rtx_MEM (mode, op);

21412

- gcc_assert (GET_MODE (op) == mode

21413

- || GET_MODE (op) == VOIDmode);

21414

+ /* op at this point has just BITS_PER_UNIT MEM_ALIGN

21415

+ on it. Try to improve it using get_pointer_alignment,

21416

+ and if the special builtin is one that requires strict

21417

+ mode alignment, also from it's GET_MODE_ALIGNMENT.

21418

+ Failure to do so could lead to ix86_legitimate_combined_insn

21419

+ rejecting all changes to such insns. */

21420

+ unsigned int align = get_pointer_alignment (arg);

21421

+ if (aligned_mem && align < GET_MODE_ALIGNMENT (mode))

21422

+ align = GET_MODE_ALIGNMENT (mode);

21423

+ if (MEM_ALIGN (op) < align)

21424

+ set_mem_align (op, align);

21425

}

21426

else

21427

{

21428

@@ -35232,7 +35294,10 @@

21429

The smallest offset in the page INSN can start is the case where START

21430

ends on the offset 0. Offset of INSN is then NBYTES - sizeof (INSN).

21431

We add p2align to 16byte window with maxskip 15 - NBYTES + sizeof (INSN).

21432

- */

21433

+

21434

+ Don't consider asm goto as jump, while it can contain a jump, it doesn't

21435

+ have to, control transfer to label(s) can be performed through other

21436

+ means, and also we estimate minimum length of all asm stmts as 0. */

21437

for (insn = start; insn; insn = NEXT_INSN (insn))

21438

{

21439

int min_size;

21440

@@ -35260,6 +35325,7 @@

21441

{

21442

start = NEXT_INSN (start);

21443

if ((JUMP_P (start)

21444

+ && asm_noperands (PATTERN (start)) < 0

21445

&& GET_CODE (PATTERN (start)) != ADDR_VEC

21446

&& GET_CODE (PATTERN (start)) != ADDR_DIFF_VEC)

21447

|| CALL_P (start))

21448

@@ -35278,6 +35344,7 @@

21449

fprintf (dump_file, "Insn %i estimated to %i bytes\n",

21450

INSN_UID (insn), min_size);

21451

if ((JUMP_P (insn)

21452

+ && asm_noperands (PATTERN (insn)) < 0

21453

&& GET_CODE (PATTERN (insn)) != ADDR_VEC

21454

&& GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)

21455

|| CALL_P (insn))

21456

@@ -35289,6 +35356,7 @@

21457

{

21458

start = NEXT_INSN (start);

21459

if ((JUMP_P (start)

21460

+ && asm_noperands (PATTERN (start)) < 0

21461

&& GET_CODE (PATTERN (start)) != ADDR_VEC

21462

&& GET_CODE (PATTERN (start)) != ADDR_DIFF_VEC)

21463

|| CALL_P (start))

21464

Index: gcc/config/sh/predicates.md

21465

===================================================================

21466

--- a/src/gcc/config/sh/predicates.md (.../tags/gcc_4_8_2_release)

21467

+++ b/src/gcc/config/sh/predicates.md (.../branches/gcc-4_8-branch)

21468

@@ -389,6 +389,12 @@

21469

XEXP (XEXP (op, 0), 1),

21470

TARGET_SH2A, true)")))

21471

21472

+;; Returns true if OP is a displacement address that can fit into a

21473

+;; 16 bit (non-SH2A) memory load / store insn.

21474

+(define_predicate "short_displacement_mem_operand"

21475

+ (match_test "sh_disp_addr_displacement (op)

21476

+ <= sh_max_mov_insn_displacement (GET_MODE (op), false)"))

21477

+

21478

;; Returns 1 if the operand can be used in an SH2A movu.{b|w} insn.

21479

(define_predicate "zero_extend_movu_operand"

21480

(and (match_operand 0 "displacement_mem_operand")

21481

@@ -413,6 +419,11 @@

21482

if (t_reg_operand (op, mode))

21483

return 0;

21484

21485

+ /* Disallow PC relative QImode loads, since these is no insn to do that

21486

+ and an imm8 load should be used instead. */

21487

+ if (IS_PC_RELATIVE_LOAD_ADDR_P (op) && GET_MODE (op) == QImode)

21488

+ return false;

21489

+

21490

if (MEM_P (op))

21491

{

21492

rtx inside = XEXP (op, 0);

21493

Index: gcc/config/sh/sh-protos.h

21494

===================================================================

21495

--- a/src/gcc/config/sh/sh-protos.h (.../tags/gcc_4_8_2_release)

21496

+++ b/src/gcc/config/sh/sh-protos.h (.../branches/gcc-4_8-branch)

21497

@@ -159,6 +159,8 @@

21498

extern bool sh_cfun_trap_exit_p (void);

21499

extern rtx sh_find_equiv_gbr_addr (rtx cur_insn, rtx mem);

21500

extern int sh_eval_treg_value (rtx op);

21501

+extern HOST_WIDE_INT sh_disp_addr_displacement (rtx mem_op);

21502

+extern int sh_max_mov_insn_displacement (machine_mode mode, bool consider_sh2a);

21503

21504

/* Result value of sh_find_set_of_reg. */

21505

struct set_of_reg

21506

Index: gcc/config/sh/sh.c

21507

===================================================================

21508

--- a/src/gcc/config/sh/sh.c (.../tags/gcc_4_8_2_release)

21509

+++ b/src/gcc/config/sh/sh.c (.../branches/gcc-4_8-branch)

21510

@@ -310,9 +310,7 @@

21511

static void sh_conditional_register_usage (void);

21512

static bool sh_legitimate_constant_p (enum machine_mode, rtx);

21513

static int mov_insn_size (enum machine_mode, bool);

21514

-static int max_mov_insn_displacement (enum machine_mode, bool);

21515

static int mov_insn_alignment_mask (enum machine_mode, bool);

21516

-static HOST_WIDE_INT disp_addr_displacement (rtx);

21517

static bool sequence_insn_p (rtx);

21518

static void sh_canonicalize_comparison (int *, rtx *, rtx *, bool);

21519

static void sh_canonicalize_comparison (enum rtx_code&, rtx&, rtx&,

21520

@@ -3628,8 +3626,8 @@

21521

21522

/* Determine the maximum possible displacement for a move insn for the

21523

specified mode. */

21524

-static int

21525

-max_mov_insn_displacement (enum machine_mode mode, bool consider_sh2a)

21526

+int

21527

+sh_max_mov_insn_displacement (machine_mode mode, bool consider_sh2a)

21528

{

21529

/* The 4 byte displacement move insns are the same as the 2 byte

21530

versions but take a 12 bit displacement. All we need to do is to

21531

@@ -3665,8 +3663,8 @@

21532

}

21533

21534

/* Return the displacement value of a displacement address. */

21535

-static inline HOST_WIDE_INT

21536

-disp_addr_displacement (rtx x)

21537

+HOST_WIDE_INT

21538

+sh_disp_addr_displacement (rtx x)

21539

{

21540

gcc_assert (satisfies_constraint_Sdd (x));

21541

return INTVAL (XEXP (XEXP (x, 0), 1));

21542

@@ -3703,12 +3701,12 @@

21543

HImode and QImode loads/stores with displacement put pressure on

21544

R0 which will most likely require another reg copy. Thus account

21545

a higher cost for that. */

21546

- if (offset > 0 && offset <= max_mov_insn_displacement (mode, false))

21547

+ if (offset > 0 && offset <= sh_max_mov_insn_displacement (mode, false))

21548

return (mode == HImode || mode == QImode) ? 2 : 1;

21549

21550

/* The displacement would fit into a 4 byte move insn (SH2A). */

21551

if (TARGET_SH2A

21552

- && offset > 0 && offset <= max_mov_insn_displacement (mode, true))

21553

+ && offset > 0 && offset <= sh_max_mov_insn_displacement (mode, true))

21554

return 2;

21555

21556

/* The displacement is probably out of range and will require extra

21557

@@ -10218,7 +10216,7 @@

21558

else

21559

{

21560

const HOST_WIDE_INT offset = INTVAL (op);

21561

- const int max_disp = max_mov_insn_displacement (mode, consider_sh2a);

21562

+ const int max_disp = sh_max_mov_insn_displacement (mode, consider_sh2a);

21563

const int align_mask = mov_insn_alignment_mask (mode, consider_sh2a);

21564

21565

/* If the mode does not support any displacement always return false.

21566

@@ -10404,7 +10402,7 @@

21567

effectively disable the small displacement insns. */

21568

const int mode_sz = GET_MODE_SIZE (mode);

21569

const int mov_insn_sz = mov_insn_size (mode, false);

21570

- const int max_disp = max_mov_insn_displacement (mode, false);

21571

+ const int max_disp = sh_max_mov_insn_displacement (mode, false);

21572

const int max_disp_next = max_disp + mov_insn_sz;

21573

HOST_WIDE_INT align_modifier = offset > 127 ? mov_insn_sz : 0;

21574

HOST_WIDE_INT offset_adjust;

21575

@@ -13165,7 +13163,8 @@

21576

the insns must have the appropriate alternatives. */

21577

if ((mode == QImode || mode == HImode) && rclass != R0_REGS

21578

&& satisfies_constraint_Sdd (x)

21579

- && disp_addr_displacement (x) <= max_mov_insn_displacement (mode, false))

21580

+ && sh_disp_addr_displacement (x)

21581

+ <= sh_max_mov_insn_displacement (mode, false))

21582

return R0_REGS;

21583

21584

/* When reload is trying to address a QImode or HImode subreg on the stack,

21585

Index: gcc/config/sh/constraints.md

21586

===================================================================

21587

--- a/src/gcc/config/sh/constraints.md (.../tags/gcc_4_8_2_release)

21588

+++ b/src/gcc/config/sh/constraints.md (.../branches/gcc-4_8-branch)

21589

@@ -221,6 +221,7 @@

21590

(define_constraint "Q"

21591

"A pc relative load operand."

21592

(and (match_code "mem")

21593

+ (match_test "GET_MODE (op) != QImode")

21594

(match_test "IS_PC_RELATIVE_LOAD_ADDR_P (XEXP (op, 0))")))

21595

21596

(define_constraint "Bsc"

21597

@@ -295,13 +296,15 @@

21598

21599

(define_memory_constraint "Sdd"

21600

"A memory reference that uses displacement addressing."

21601

- (and (match_test "MEM_P (op) && GET_CODE (XEXP (op, 0)) == PLUS")

21602

+ (and (match_code "mem")

21603

+ (match_test "GET_CODE (XEXP (op, 0)) == PLUS")

21604

(match_test "REG_P (XEXP (XEXP (op, 0), 0))")

21605

(match_test "CONST_INT_P (XEXP (XEXP (op, 0), 1))")))

21606

21607

(define_memory_constraint "Snd"

21608

"A memory reference that excludes displacement addressing."

21609

- (match_test "! satisfies_constraint_Sdd (op)"))

21610

+ (and (match_code "mem")

21611

+ (match_test "! satisfies_constraint_Sdd (op)")))

21612

21613

(define_memory_constraint "Sbv"

21614

"A memory reference, as used in SH2A bclr.b, bset.b, etc."

21615

Index: gcc/config/sh/sh.md

21616

===================================================================

21617

--- a/src/gcc/config/sh/sh.md (.../tags/gcc_4_8_2_release)

21618

+++ b/src/gcc/config/sh/sh.md (.../branches/gcc-4_8-branch)

21619

@@ -6831,34 +6831,9 @@

21620

prepare_move_operands (operands, QImode);

21621

})

21622

21623

-;; If movqi_reg_reg is specified as an alternative of movqi, movqi will be

21624

-;; selected to copy QImode regs. If one of them happens to be allocated

21625

-;; on the stack, reload will stick to movqi insn and generate wrong

21626

-;; displacement addressing because of the generic m alternatives.

21627

-;; With the movqi_reg_reg being specified before movqi it will be initially

21628

-;; picked to load/store regs. If the regs regs are on the stack reload

21629

-;; try other insns and not stick to movqi_reg_reg, unless there were spilled

21630

-;; pseudos in which case 'm' constraints pertain.

21631

-;; The same applies to the movhi variants.

21632

-;;

21633

-;; Notice, that T bit is not allowed as a mov src operand here. This is to

21634

-;; avoid things like (set (reg:QI) (subreg:QI (reg:SI T_REG) 0)), which

21635

-;; introduces zero extensions after T bit stores and redundant reg copies.

21636

-;;

21637

-;; FIXME: We can't use 'arith_reg_operand' (which disallows T_REG) as a

21638

-;; predicate for the mov src operand because reload will have trouble

21639

-;; reloading MAC subregs otherwise. For that probably special patterns

21640

-;; would be required.

21641

-(define_insn "*mov<mode>_reg_reg"

21642

- [(set (match_operand:QIHI 0 "arith_reg_dest" "=r,m,*z")

21643

- (match_operand:QIHI 1 "register_operand" "r,*z,m"))]

21644

- "TARGET_SH1 && !t_reg_operand (operands[1], VOIDmode)"

21645

- "@

21646

- mov %1,%0

21647

- mov.<bw> %1,%0

21648

- mov.<bw> %1,%0"

21649

- [(set_attr "type" "move,store,load")])

21650

-

21651

+;; Specifying the displacement addressing load / store patterns separately

21652

+;; before the generic movqi / movhi pattern allows controlling the order

21653

+;; in which load / store insns are selected in a more fine grained way.

21654

;; FIXME: The non-SH2A and SH2A variants should be combined by adding

21655

;; "enabled" attribute as it is done in other targets.

21656

(define_insn "*mov<mode>_store_mem_disp04"

21657

@@ -6908,38 +6883,44 @@

21658

[(set_attr "type" "load")

21659

(set_attr "length" "2,2,4")])

21660

21661

-;; The m constraints basically allow any kind of addresses to be used with any

21662

-;; source/target register as the other operand. This is not true for

21663

-;; displacement addressing modes on anything but SH2A. That's why the

21664

-;; specialized load/store insns are specified above.

21665

-(define_insn "*movqi"

21666

- [(set (match_operand:QI 0 "general_movdst_operand" "=r,r,m,r,l")

21667

- (match_operand:QI 1 "general_movsrc_operand" "i,m,r,l,r"))]

21668

+;; The order of the constraint alternatives is important here.

21669

+;; Q/r has to come first, otherwise PC relative loads might wrongly get

21670

+;; placed into delay slots. Since there is no QImode PC relative load, the

21671

+;; Q constraint and general_movsrc_operand will reject it for QImode.

21672

+;; The Snd alternatives should come before Sdd in order to avoid a preference

21673

+;; of using r0 als the register operand for addressing modes other than

21674

+;; displacement addressing.

21675

+;; The Sdd alternatives allow only r0 as register operand, even though on

21676

+;; SH2A any register could be allowed by switching to a 32 bit insn.

21677

+;; Generally sticking to the r0 is preferrable, since it generates smaller

21678

+;; code. Obvious r0 reloads can then be eliminated with a peephole on SH2A.

21679

+(define_insn "*mov<mode>"

21680

+ [(set (match_operand:QIHI 0 "general_movdst_operand"

21681

+ "=r,r,r,Snd,r, Sdd,z, r,l")

21682

+ (match_operand:QIHI 1 "general_movsrc_operand"

21683

+ "Q,r,i,r, Snd,z, Sdd,l,r"))]

21684

"TARGET_SH1

21685

- && (arith_reg_operand (operands[0], QImode)

21686

- || arith_reg_operand (operands[1], QImode))"

21687

+ && (arith_reg_operand (operands[0], <MODE>mode)

21688

+ || arith_reg_operand (operands[1], <MODE>mode))"

21689

"@

21690

+ mov.<bw> %1,%0

21691

mov %1,%0

21692

- mov.b %1,%0

21693

- mov.b %1,%0

21694

- sts %1,%0

21695

- lds %1,%0"

21696

- [(set_attr "type" "movi8,load,store,prget,prset")])

21697

-

21698

-(define_insn "*movhi"

21699

- [(set (match_operand:HI 0 "general_movdst_operand" "=r,r,r,m,r,l")

21700

- (match_operand:HI 1 "general_movsrc_operand" "Q,i,m,r,l,r"))]

21701

- "TARGET_SH1

21702

- && (arith_reg_operand (operands[0], HImode)

21703

- || arith_reg_operand (operands[1], HImode))"

21704

- "@

21705

- mov.w %1,%0

21706

mov %1,%0

21707

- mov.w %1,%0

21708

- mov.w %1,%0

21709

+ mov.<bw> %1,%0

21710

+ mov.<bw> %1,%0

21711

+ mov.<bw> %1,%0

21712

+ mov.<bw> %1,%0

21713

sts %1,%0

21714

lds %1,%0"

21715

- [(set_attr "type" "pcload,movi8,load,store,prget,prset")])

21716

+ [(set_attr "type" "pcload,move,movi8,store,load,store,load,prget,prset")

21717

+ (set (attr "length")

21718

+ (cond [(and (match_operand 0 "displacement_mem_operand")

21719

+ (not (match_operand 0 "short_displacement_mem_operand")))

21720

+ (const_int 4)

21721

+ (and (match_operand 1 "displacement_mem_operand")

21722

+ (not (match_operand 1 "short_displacement_mem_operand")))

21723

+ (const_int 4)]

21724

+ (const_int 2)))])

21725

21726

(define_insn "*movqi_media"

21727

[(set (match_operand:QI 0 "general_movdst_operand" "=r,r,r,m")

21728

@@ -8427,11 +8408,9 @@

21729

21730

while (true)

21731

{

21732

- /* It's not safe to go beyond the current basic block after reload. */

21733

set_of_reg s1 = sh_find_set_of_reg (tested_reg, s0.insn,

21734

- reload_completed

21735

- ? prev_nonnote_insn_bb

21736

- : prev_nonnote_insn);

21737

+ prev_nonnote_insn);

21738

+

21739

if (s1.set_src == NULL_RTX)

21740

break;

21741

21742

@@ -8449,15 +8428,25 @@

21743

continue;

21744

}

21745

21746

- /* It's only safe to remove the testing insn if the T bit is not

21747

- modified between the testing insn and the insn that stores the

21748

- T bit. Notice that some T bit stores such as negc also modify

21749

- the T bit. */

21750

- if (modified_between_p (get_t_reg_rtx (), s1.insn, testing_insn)

21751

- || modified_in_p (get_t_reg_rtx (), s1.insn))

21752

- operands[2] = NULL_RTX;

21753

+ /* It's only safe to remove the testing insn if the T bit is not

21754

+ modified between the testing insn and the insn that stores the

21755

+ T bit. Notice that some T bit stores such as negc also modify

21756

+ the T bit. */

21757

+ if (modified_between_p (get_t_reg_rtx (), s1.insn, testing_insn)

21758

+ || modified_in_p (get_t_reg_rtx (), s1.insn)

21759

+ || !no_labels_between_p (s1.insn, testing_insn))

21760

+ operands[2] = NULL_RTX;

21761

+ else

21762

+ {

21763

+ /* If the insn that sets the tested reg has a REG_DEAD note on

21764

+ the T bit remove that note since we're extending the usage

21765

+ of the T bit. */

21766

+ rtx n = find_regno_note (s1.insn, REG_DEAD, T_REG);

21767

+ if (n != NULL_RTX)

21768

+ remove_note (s1.insn, n);

21769

+ }

21770

21771

- break;

21772

+ break;

21773

}

21774

21775

if (operands[2] == NULL_RTX)

21776

Index: gcc/config/sh/sh.opt

21777

===================================================================

21778

--- a/src/gcc/config/sh/sh.opt (.../tags/gcc_4_8_2_release)

21779

+++ b/src/gcc/config/sh/sh.opt (.../branches/gcc-4_8-branch)

21780

@@ -21,7 +21,7 @@

21781

;; Used for various architecture options.

21782

Mask(SH_E)

21783

21784

-;; Set if the default precision of th FPU is single.

21785

+;; Set if the default precision of the FPU is single.

21786

Mask(FPU_SINGLE)

21787

21788

;; Set if the a double-precision FPU is present but is restricted to

21789

Index: gcc/config/cris/cris.md

21790

===================================================================

21791

--- a/src/gcc/config/cris/cris.md (.../tags/gcc_4_8_2_release)

21792

+++ b/src/gcc/config/cris/cris.md (.../branches/gcc-4_8-branch)

21793

@@ -758,7 +758,7 @@

21794

(match_operand:SI 1 "const_int_operand" ""))

21795

(match_operand:SI 2 "register_operand" ""))])

21796

(match_operand 3 "register_operand" ""))

21797

- (set (match_operand:SI 4 "register_operand" "")

21798

+ (set (match_operand:SI 4 "cris_nonsp_register_operand" "")

21799

(plus:SI (mult:SI (match_dup 0)

21800

(match_dup 1))

21801

(match_dup 2)))])]

21802

@@ -859,7 +859,7 @@

21803

(match_operand:SI 0 "cris_bdap_operand" "")

21804

(match_operand:SI 1 "cris_bdap_operand" ""))])

21805

(match_operand 2 "register_operand" ""))

21806

- (set (match_operand:SI 3 "register_operand" "")

21807

+ (set (match_operand:SI 3 "cris_nonsp_register_operand" "")

21808

(plus:SI (match_dup 0) (match_dup 1)))])]

21809

"reload_completed && reg_overlap_mentioned_p (operands[3], operands[2])"

21810

[(set (match_dup 4) (match_dup 2))

21811

@@ -3960,7 +3960,7 @@

21812

;; up.

21813

21814

(define_split

21815

- [(set (match_operand 0 "register_operand" "")

21816

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21817

(match_operator

21818

4 "cris_operand_extend_operator"

21819

[(match_operand 1 "register_operand" "")

21820

@@ -3990,7 +3990,7 @@

21821

;; Call this op-extend-split-rx=rz

21822

21823

(define_split

21824

- [(set (match_operand 0 "register_operand" "")

21825

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21826

(match_operator

21827

4 "cris_plus_or_bound_operator"

21828

[(match_operand 1 "register_operand" "")

21829

@@ -4018,7 +4018,7 @@

21830

;; Call this op-extend-split-swapped

21831

21832

(define_split

21833

- [(set (match_operand 0 "register_operand" "")

21834

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21835

(match_operator

21836

4 "cris_plus_or_bound_operator"

21837

[(match_operator

21838

@@ -4044,7 +4044,7 @@

21839

;; bound. Call this op-extend-split-swapped-rx=rz.

21840

21841

(define_split

21842

- [(set (match_operand 0 "register_operand" "")

21843

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21844

(match_operator

21845

4 "cris_plus_or_bound_operator"

21846

[(match_operator

21847

@@ -4075,7 +4075,7 @@

21848

;; Call this op-extend.

21849

21850

(define_split

21851

- [(set (match_operand 0 "register_operand" "")

21852

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21853

(match_operator

21854

3 "cris_orthogonal_operator"

21855

[(match_operand 1 "register_operand" "")

21856

@@ -4099,7 +4099,7 @@

21857

;; Call this op-split-rx=rz

21858

21859

(define_split

21860

- [(set (match_operand 0 "register_operand" "")

21861

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21862

(match_operator

21863

3 "cris_commutative_orth_op"

21864

[(match_operand 2 "memory_operand" "")

21865

@@ -4123,7 +4123,7 @@

21866

;; Call this op-split-swapped.

21867

21868

(define_split

21869

- [(set (match_operand 0 "register_operand" "")

21870

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21871

(match_operator

21872

3 "cris_commutative_orth_op"

21873

[(match_operand 1 "register_operand" "")

21874

@@ -4146,7 +4146,7 @@

21875

;; Call this op-split-swapped-rx=rz.

21876

21877

(define_split

21878

- [(set (match_operand 0 "register_operand" "")

21879

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21880

(match_operator

21881

3 "cris_orthogonal_operator"

21882

[(match_operand 2 "memory_operand" "")

21883

@@ -4555,10 +4555,11 @@

21884

;; We're not allowed to generate copies of registers with different mode

21885

;; until after reload; copying pseudos upsets reload. CVS as of

21886

;; 2001-08-24, unwind-dw2-fde.c, _Unwind_Find_FDE ICE in

21887

-;; cselib_invalidate_regno.

21888

+;; cselib_invalidate_regno. Also, don't do this for the stack-pointer,

21889

+;; as we don't want it set temporarily to an invalid value.

21890

21891

(define_split ; indir_to_reg_split

21892

- [(set (match_operand 0 "register_operand" "")

21893

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21894

(match_operand 1 "indirect_operand" ""))]

21895

"reload_completed

21896

&& REG_P (operands[0])

21897

@@ -4574,7 +4575,7 @@

21898

;; As the above, but MOVS and MOVU.

21899

21900

(define_split

21901

- [(set (match_operand 0 "register_operand" "")

21902

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21903

(match_operator

21904

4 "cris_extend_operator"

21905

[(match_operand 1 "indirect_operand" "")]))]

21906

Index: gcc/config/cris/predicates.md

21907

===================================================================

21908

--- a/src/gcc/config/cris/predicates.md (.../tags/gcc_4_8_2_release)

21909

+++ b/src/gcc/config/cris/predicates.md (.../branches/gcc-4_8-branch)

21910

@@ -76,6 +76,10 @@

21911

(match_test "cris_simple_address_operand (XEXP (op, 0),

21912

Pmode)"))))

21913

21914

+(define_predicate "cris_nonsp_register_operand"

21915

+ (and (match_operand 0 "register_operand")

21916

+ (match_test "op != stack_pointer_rtx")))

21917

+

21918

;; The caller needs to use :SI.

21919

(define_predicate "cris_bdap_sign_extend_operand"

21920

; Disabled until <URL:http://gcc.gnu.org/ml/gcc-patches/2005-10/msg01376.html>

21921

Index: gcc/config/m68k/m68k.c

21922

===================================================================

21923

--- a/src/gcc/config/m68k/m68k.c (.../tags/gcc_4_8_2_release)

21924

+++ b/src/gcc/config/m68k/m68k.c (.../branches/gcc-4_8-branch)

21925

@@ -3325,12 +3325,12 @@

21926

latehalf[1] = adjust_address (operands[1], SImode, 0);

21927

}

21928

21929

- /* If insn is effectively movd N(sp),-(sp) then we will do the

21930

- high word first. We should use the adjusted operand 1 (which is N+4(sp))

21931

- for the low word as well, to compensate for the first decrement of sp. */

21932

+ /* If insn is effectively movd N(REG),-(REG) then we will do the high

21933

+ word first. We should use the adjusted operand 1 (which is N+4(REG))

21934

+ for the low word as well, to compensate for the first decrement of

21935

+ REG. */

21936

if (optype0 == PUSHOP

21937

- && REGNO (XEXP (XEXP (operands[0], 0), 0)) == STACK_POINTER_REGNUM

21938

- && reg_overlap_mentioned_p (stack_pointer_rtx, operands[1]))

21939

+ && reg_overlap_mentioned_p (XEXP (XEXP (operands[0], 0), 0), operands[1]))

21940

operands[1] = middlehalf[1] = latehalf[1];

21941

21942

/* For (set (reg:DI N) (mem:DI ... (reg:SI N) ...)),

21943

Index: gcc/config/aarch64/aarch64-simd.md

21944

===================================================================

21945

--- a/src/gcc/config/aarch64/aarch64-simd.md (.../tags/gcc_4_8_2_release)

21946

+++ b/src/gcc/config/aarch64/aarch64-simd.md (.../branches/gcc-4_8-branch)

21947

@@ -21,7 +21,7 @@

21948

21949

; Main data types used by the insntructions

21950

21951

-(define_attr "simd_mode" "unknown,none,V8QI,V16QI,V4HI,V8HI,V2SI,V4SI,V2DI,V2SF,V4SF,V2DF,OI,CI,XI,DI,DF,SI,HI,QI"

21952

+(define_attr "simd_mode" "unknown,none,V8QI,V16QI,V4HI,V8HI,V2SI,V4SI,V2DI,V2SF,V4SF,V2DF,OI,CI,XI,DI,DF,SI,SF,HI,QI"

21953

(const_string "unknown"))

21954

21955

21956

@@ -1548,12 +1548,12 @@

21957

21958

case LTU:

21959

case GEU:

21960

- emit_insn (gen_aarch64_cmhs<mode> (mask, operands[4], operands[5]));

21961

+ emit_insn (gen_aarch64_cmgeu<mode> (mask, operands[4], operands[5]));

21962

break;

21963

21964

case LEU:

21965

case GTU:

21966

- emit_insn (gen_aarch64_cmhi<mode> (mask, operands[4], operands[5]));

21967

+ emit_insn (gen_aarch64_cmgtu<mode> (mask, operands[4], operands[5]));

21968

break;

21969

21970

case NE:

21971

@@ -3034,48 +3034,181 @@

21972

)

21973

21974

21975

-;; cm(eq|ge|le|lt|gt)

21976

+;; cm(eq|ge|gt|lt|le)

21977

+;; Note, we have constraints for Dz and Z as different expanders

21978

+;; have different ideas of what should be passed to this pattern.

21979

21980

-(define_insn "aarch64_cm<cmp><mode>"

21981

+(define_insn "aarch64_cm<optab><mode>"

21982

[(set (match_operand:<V_cmp_result> 0 "register_operand" "=w,w")

21983

- (unspec:<V_cmp_result>

21984

- [(match_operand:VSDQ_I_DI 1 "register_operand" "w,w")

21985

- (match_operand:VSDQ_I_DI 2 "aarch64_simd_reg_or_zero" "w,Z")]

21986

- VCMP_S))]

21987

+ (neg:<V_cmp_result>

21988

+ (COMPARISONS:<V_cmp_result>

21989

+ (match_operand:VDQ 1 "register_operand" "w,w")

21990

+ (match_operand:VDQ 2 "aarch64_simd_reg_or_zero" "w,ZDz")

21991

+ )))]

21992

"TARGET_SIMD"

21993

"@

21994

- cm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>

21995

- cm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, #0"

21996

+ cm<n_optab>\t%<v>0<Vmtype>, %<v><cmp_1><Vmtype>, %<v><cmp_2><Vmtype>

21997

+ cm<optab>\t%<v>0<Vmtype>, %<v>1<Vmtype>, #0"

21998

[(set_attr "simd_type" "simd_cmp")

21999

(set_attr "simd_mode" "<MODE>")]

22000

)

22001

22002

-;; cm(hs|hi|tst)

22003

+(define_insn_and_split "aarch64_cm<optab>di"

22004

+ [(set (match_operand:DI 0 "register_operand" "=w,w,r")

22005

+ (neg:DI

22006

+ (COMPARISONS:DI

22007

+ (match_operand:DI 1 "register_operand" "w,w,r")

22008

+ (match_operand:DI 2 "aarch64_simd_reg_or_zero" "w,ZDz,r")

22009

+ )))]

22010

+ "TARGET_SIMD"

22011

+ "@

22012

+ cm<n_optab>\t%d0, %d<cmp_1>, %d<cmp_2>

22013

+ cm<optab>\t%d0, %d1, #0

22014

+ #"

22015

+ "reload_completed

22016

+ /* We need to prevent the split from

22017

+ happening in the 'w' constraint cases. */

22018

+ && GP_REGNUM_P (REGNO (operands[0]))

22019

+ && GP_REGNUM_P (REGNO (operands[1]))"

22020

+ [(set (reg:CC CC_REGNUM)

22021

+ (compare:CC

22022

+ (match_dup 1)

22023

+ (match_dup 2)))

22024

+ (set (match_dup 0)

22025

+ (neg:DI

22026

+ (COMPARISONS:DI

22027

+ (match_operand 3 "cc_register" "")

22028

+ (const_int 0))))]

22029

+ {

22030

+ enum machine_mode mode = SELECT_CC_MODE (<CMP>, operands[1], operands[2]);

22031

+ rtx cc_reg = aarch64_gen_compare_reg (<CMP>, operands[1], operands[2]);

22032

+ rtx comparison = gen_rtx_<CMP> (mode, operands[1], operands[2]);

22033

+ emit_insn (gen_cstoredi_neg (operands[0], comparison, cc_reg));

22034

+ DONE;

22035

+ }

22036

+ [(set_attr "simd_type" "simd_cmp")

22037

+ (set_attr "simd_mode" "DI")]

22038

+)

22039

22040

-(define_insn "aarch64_cm<cmp><mode>"

22041

+;; cm(hs|hi)

22042

+

22043

+(define_insn "aarch64_cm<optab><mode>"

22044

[(set (match_operand:<V_cmp_result> 0 "register_operand" "=w")

22045

- (unspec:<V_cmp_result>

22046

- [(match_operand:VSDQ_I_DI 1 "register_operand" "w")

22047

- (match_operand:VSDQ_I_DI 2 "register_operand" "w")]

22048

- VCMP_U))]

22049

+ (neg:<V_cmp_result>

22050

+ (UCOMPARISONS:<V_cmp_result>

22051

+ (match_operand:VDQ 1 "register_operand" "w")

22052

+ (match_operand:VDQ 2 "register_operand" "w")

22053

+ )))]

22054

"TARGET_SIMD"

22055

- "cm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>"

22056

+ "cm<n_optab>\t%<v>0<Vmtype>, %<v><cmp_1><Vmtype>, %<v><cmp_2><Vmtype>"

22057

[(set_attr "simd_type" "simd_cmp")

22058

(set_attr "simd_mode" "<MODE>")]

22059

)

22060

22061

-;; fcm(eq|ge|le|lt|gt)

22062

+(define_insn_and_split "aarch64_cm<optab>di"

22063

+ [(set (match_operand:DI 0 "register_operand" "=w,r")

22064

+ (neg:DI

22065

+ (UCOMPARISONS:DI

22066

+ (match_operand:DI 1 "register_operand" "w,r")

22067

+ (match_operand:DI 2 "aarch64_simd_reg_or_zero" "w,r")

22068

+ )))]

22069

+ "TARGET_SIMD"

22070

+ "@

22071

+ cm<n_optab>\t%d0, %d<cmp_1>, %d<cmp_2>

22072

+ #"

22073

+ "reload_completed

22074

+ /* We need to prevent the split from

22075

+ happening in the 'w' constraint cases. */

22076

+ && GP_REGNUM_P (REGNO (operands[0]))

22077

+ && GP_REGNUM_P (REGNO (operands[1]))"

22078

+ [(set (reg:CC CC_REGNUM)

22079

+ (compare:CC

22080

+ (match_dup 1)

22081

+ (match_dup 2)))

22082

+ (set (match_dup 0)

22083

+ (neg:DI

22084

+ (UCOMPARISONS:DI

22085

+ (match_operand 3 "cc_register" "")

22086

+ (const_int 0))))]

22087

+ {

22088

+ enum machine_mode mode = SELECT_CC_MODE (<CMP>, operands[1], operands[2]);

22089

+ rtx cc_reg = aarch64_gen_compare_reg (<CMP>, operands[1], operands[2]);

22090

+ rtx comparison = gen_rtx_<CMP> (mode, operands[1], operands[2]);

22091

+ emit_insn (gen_cstoredi_neg (operands[0], comparison, cc_reg));

22092

+ DONE;

22093

+ }

22094

+ [(set_attr "simd_type" "simd_cmp")

22095

+ (set_attr "simd_mode" "DI")]

22096

+)

22097

22098

-(define_insn "aarch64_cm<cmp><mode>"

22099

+;; cmtst

22100

+

22101

+(define_insn "aarch64_cmtst<mode>"

22102

+ [(set (match_operand:<V_cmp_result> 0 "register_operand" "=w")

22103

+ (neg:<V_cmp_result>

22104

+ (ne:<V_cmp_result>

22105

+ (and:VDQ

22106

+ (match_operand:VDQ 1 "register_operand" "w")

22107

+ (match_operand:VDQ 2 "register_operand" "w"))

22108

+ (vec_duplicate:<V_cmp_result> (const_int 0)))))]

22109

+ "TARGET_SIMD"

22110

+ "cmtst\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>"

22111

+ [(set_attr "simd_type" "simd_cmp")

22112

+ (set_attr "simd_mode" "<MODE>")]

22113

+)

22114

+

22115

+(define_insn_and_split "aarch64_cmtstdi"

22116

+ [(set (match_operand:DI 0 "register_operand" "=w,r")

22117

+ (neg:DI

22118

+ (ne:DI

22119

+ (and:DI

22120

+ (match_operand:DI 1 "register_operand" "w,r")

22121

+ (match_operand:DI 2 "register_operand" "w,r"))

22122

+ (const_int 0))))]

22123

+ "TARGET_SIMD"

22124

+ "@

22125

+ cmtst\t%d0, %d1, %d2

22126

+ #"

22127

+ "reload_completed

22128

+ /* We need to prevent the split from

22129

+ happening in the 'w' constraint cases. */

22130

+ && GP_REGNUM_P (REGNO (operands[0]))

22131

+ && GP_REGNUM_P (REGNO (operands[1]))"

22132

+ [(set (reg:CC_NZ CC_REGNUM)

22133

+ (compare:CC_NZ

22134

+ (and:DI (match_dup 1)

22135

+ (match_dup 2))

22136

+ (const_int 0)))

22137

+ (set (match_dup 0)

22138

+ (neg:DI

22139

+ (ne:DI

22140

+ (match_operand 3 "cc_register" "")

22141

+ (const_int 0))))]

22142

+ {

22143

+ rtx and_tree = gen_rtx_AND (DImode, operands[1], operands[2]);

22144

+ enum machine_mode mode = SELECT_CC_MODE (NE, and_tree, const0_rtx);

22145

+ rtx cc_reg = aarch64_gen_compare_reg (NE, and_tree, const0_rtx);

22146

+ rtx comparison = gen_rtx_NE (mode, and_tree, const0_rtx);

22147

+ emit_insn (gen_cstoredi_neg (operands[0], comparison, cc_reg));

22148

+ DONE;

22149

+ }

22150

+ [(set_attr "simd_type" "simd_cmp")

22151

+ (set_attr "simd_mode" "DI")]

22152

+)

22153

+

22154

+;; fcm(eq|ge|gt|le|lt)

22155

+

22156

+(define_insn "aarch64_cm<optab><mode>"

22157

[(set (match_operand:<V_cmp_result> 0 "register_operand" "=w,w")

22158

- (unspec:<V_cmp_result>

22159

- [(match_operand:VDQF 1 "register_operand" "w,w")

22160

- (match_operand:VDQF 2 "aarch64_simd_reg_or_zero" "w,Dz")]

22161

- VCMP_S))]

22162

+ (neg:<V_cmp_result>

22163

+ (COMPARISONS:<V_cmp_result>

22164

+ (match_operand:VALLF 1 "register_operand" "w,w")

22165

+ (match_operand:VALLF 2 "aarch64_simd_reg_or_zero" "w,YDz")

22166

+ )))]

22167

"TARGET_SIMD"

22168

"@

22169

- fcm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>

22170

- fcm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, 0"

22171

+ fcm<n_optab>\t%<v>0<Vmtype>, %<v><cmp_1><Vmtype>, %<v><cmp_2><Vmtype>

22172

+ fcm<optab>\t%<v>0<Vmtype>, %<v>1<Vmtype>, 0"

22173

[(set_attr "simd_type" "simd_fcmp")

22174

(set_attr "simd_mode" "<MODE>")]

22175

)

22176

Index: gcc/config/aarch64/predicates.md

22177

===================================================================

22178

--- a/src/gcc/config/aarch64/predicates.md (.../tags/gcc_4_8_2_release)

22179

+++ b/src/gcc/config/aarch64/predicates.md (.../branches/gcc-4_8-branch)

22180

@@ -31,6 +31,11 @@

22181

(ior (match_operand 0 "register_operand")

22182

(match_test "op == const0_rtx"))))

22183

22184

+(define_predicate "aarch64_reg_or_fp_zero"

22185

+ (and (match_code "reg,subreg,const_double")

22186

+ (ior (match_operand 0 "register_operand")

22187

+ (match_test "aarch64_float_const_zero_rtx_p (op)"))))

22188

+

22189

(define_predicate "aarch64_reg_zero_or_m1_or_1"

22190

(and (match_code "reg,subreg,const_int")

22191

(ior (match_operand 0 "register_operand")

22192

Index: gcc/config/aarch64/arm_neon.h

22193

===================================================================

22194

--- a/src/gcc/config/aarch64/arm_neon.h (.../tags/gcc_4_8_2_release)

22195

+++ b/src/gcc/config/aarch64/arm_neon.h (.../branches/gcc-4_8-branch)

22196

@@ -19551,28 +19551,28 @@

22197

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22198

vcge_u8 (uint8x8_t __a, uint8x8_t __b)

22199

{

22200

- return (uint8x8_t) __builtin_aarch64_cmhsv8qi ((int8x8_t) __a,

22201

+ return (uint8x8_t) __builtin_aarch64_cmgeuv8qi ((int8x8_t) __a,

22202

(int8x8_t) __b);

22203

}

22204

22205

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22206

vcge_u16 (uint16x4_t __a, uint16x4_t __b)

22207

{

22208

- return (uint16x4_t) __builtin_aarch64_cmhsv4hi ((int16x4_t) __a,

22209

+ return (uint16x4_t) __builtin_aarch64_cmgeuv4hi ((int16x4_t) __a,

22210

(int16x4_t) __b);

22211

}

22212

22213

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22214

vcge_u32 (uint32x2_t __a, uint32x2_t __b)

22215

{

22216

- return (uint32x2_t) __builtin_aarch64_cmhsv2si ((int32x2_t) __a,

22217

+ return (uint32x2_t) __builtin_aarch64_cmgeuv2si ((int32x2_t) __a,

22218

(int32x2_t) __b);

22219

}

22220

22221

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22222

vcge_u64 (uint64x1_t __a, uint64x1_t __b)

22223

{

22224

- return (uint64x1_t) __builtin_aarch64_cmhsdi ((int64x1_t) __a,

22225

+ return (uint64x1_t) __builtin_aarch64_cmgeudi ((int64x1_t) __a,

22226

(int64x1_t) __b);

22227

}

22228

22229

@@ -19603,28 +19603,28 @@

22230

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22231

vcgeq_u8 (uint8x16_t __a, uint8x16_t __b)

22232

{

22233

- return (uint8x16_t) __builtin_aarch64_cmhsv16qi ((int8x16_t) __a,

22234

+ return (uint8x16_t) __builtin_aarch64_cmgeuv16qi ((int8x16_t) __a,

22235

(int8x16_t) __b);

22236

}

22237

22238

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22239

vcgeq_u16 (uint16x8_t __a, uint16x8_t __b)

22240

{

22241

- return (uint16x8_t) __builtin_aarch64_cmhsv8hi ((int16x8_t) __a,

22242

+ return (uint16x8_t) __builtin_aarch64_cmgeuv8hi ((int16x8_t) __a,

22243

(int16x8_t) __b);

22244

}

22245

22246

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22247

vcgeq_u32 (uint32x4_t __a, uint32x4_t __b)

22248

{

22249

- return (uint32x4_t) __builtin_aarch64_cmhsv4si ((int32x4_t) __a,

22250

+ return (uint32x4_t) __builtin_aarch64_cmgeuv4si ((int32x4_t) __a,

22251

(int32x4_t) __b);

22252

}

22253

22254

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22255

vcgeq_u64 (uint64x2_t __a, uint64x2_t __b)

22256

{

22257

- return (uint64x2_t) __builtin_aarch64_cmhsv2di ((int64x2_t) __a,

22258

+ return (uint64x2_t) __builtin_aarch64_cmgeuv2di ((int64x2_t) __a,

22259

(int64x2_t) __b);

22260

}

22261

22262

@@ -19637,7 +19637,7 @@

22263

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22264

vcged_u64 (uint64x1_t __a, uint64x1_t __b)

22265

{

22266

- return (uint64x1_t) __builtin_aarch64_cmhsdi ((int64x1_t) __a,

22267

+ return (uint64x1_t) __builtin_aarch64_cmgeudi ((int64x1_t) __a,

22268

(int64x1_t) __b);

22269

}

22270

22271

@@ -19676,28 +19676,28 @@

22272

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22273

vcgt_u8 (uint8x8_t __a, uint8x8_t __b)

22274

{

22275

- return (uint8x8_t) __builtin_aarch64_cmhiv8qi ((int8x8_t) __a,

22276

+ return (uint8x8_t) __builtin_aarch64_cmgtuv8qi ((int8x8_t) __a,

22277

(int8x8_t) __b);

22278

}

22279

22280

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22281

vcgt_u16 (uint16x4_t __a, uint16x4_t __b)

22282

{

22283

- return (uint16x4_t) __builtin_aarch64_cmhiv4hi ((int16x4_t) __a,

22284

+ return (uint16x4_t) __builtin_aarch64_cmgtuv4hi ((int16x4_t) __a,

22285

(int16x4_t) __b);

22286

}

22287

22288

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22289

vcgt_u32 (uint32x2_t __a, uint32x2_t __b)

22290

{

22291

- return (uint32x2_t) __builtin_aarch64_cmhiv2si ((int32x2_t) __a,

22292

+ return (uint32x2_t) __builtin_aarch64_cmgtuv2si ((int32x2_t) __a,

22293

(int32x2_t) __b);

22294

}

22295

22296

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22297

vcgt_u64 (uint64x1_t __a, uint64x1_t __b)

22298

{

22299

- return (uint64x1_t) __builtin_aarch64_cmhidi ((int64x1_t) __a,

22300

+ return (uint64x1_t) __builtin_aarch64_cmgtudi ((int64x1_t) __a,

22301

(int64x1_t) __b);

22302

}

22303

22304

@@ -19728,28 +19728,28 @@

22305

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22306

vcgtq_u8 (uint8x16_t __a, uint8x16_t __b)

22307

{

22308

- return (uint8x16_t) __builtin_aarch64_cmhiv16qi ((int8x16_t) __a,

22309

+ return (uint8x16_t) __builtin_aarch64_cmgtuv16qi ((int8x16_t) __a,

22310

(int8x16_t) __b);

22311

}

22312

22313

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22314

vcgtq_u16 (uint16x8_t __a, uint16x8_t __b)

22315

{

22316

- return (uint16x8_t) __builtin_aarch64_cmhiv8hi ((int16x8_t) __a,

22317

+ return (uint16x8_t) __builtin_aarch64_cmgtuv8hi ((int16x8_t) __a,

22318

(int16x8_t) __b);

22319

}

22320

22321

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22322

vcgtq_u32 (uint32x4_t __a, uint32x4_t __b)

22323

{

22324

- return (uint32x4_t) __builtin_aarch64_cmhiv4si ((int32x4_t) __a,

22325

+ return (uint32x4_t) __builtin_aarch64_cmgtuv4si ((int32x4_t) __a,

22326

(int32x4_t) __b);

22327

}

22328

22329

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22330

vcgtq_u64 (uint64x2_t __a, uint64x2_t __b)

22331

{

22332

- return (uint64x2_t) __builtin_aarch64_cmhiv2di ((int64x2_t) __a,

22333

+ return (uint64x2_t) __builtin_aarch64_cmgtuv2di ((int64x2_t) __a,

22334

(int64x2_t) __b);

22335

}

22336

22337

@@ -19762,7 +19762,7 @@

22338

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22339

vcgtd_u64 (uint64x1_t __a, uint64x1_t __b)

22340

{

22341

- return (uint64x1_t) __builtin_aarch64_cmhidi ((int64x1_t) __a,

22342

+ return (uint64x1_t) __builtin_aarch64_cmgtudi ((int64x1_t) __a,

22343

(int64x1_t) __b);

22344

}

22345

22346

@@ -19801,28 +19801,28 @@

22347

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22348

vcle_u8 (uint8x8_t __a, uint8x8_t __b)

22349

{

22350

- return (uint8x8_t) __builtin_aarch64_cmhsv8qi ((int8x8_t) __b,

22351

+ return (uint8x8_t) __builtin_aarch64_cmgeuv8qi ((int8x8_t) __b,

22352

(int8x8_t) __a);

22353

}

22354

22355

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22356

vcle_u16 (uint16x4_t __a, uint16x4_t __b)

22357

{

22358

- return (uint16x4_t) __builtin_aarch64_cmhsv4hi ((int16x4_t) __b,

22359

+ return (uint16x4_t) __builtin_aarch64_cmgeuv4hi ((int16x4_t) __b,

22360

(int16x4_t) __a);

22361

}

22362

22363

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22364

vcle_u32 (uint32x2_t __a, uint32x2_t __b)

22365

{

22366

- return (uint32x2_t) __builtin_aarch64_cmhsv2si ((int32x2_t) __b,

22367

+ return (uint32x2_t) __builtin_aarch64_cmgeuv2si ((int32x2_t) __b,

22368

(int32x2_t) __a);

22369

}

22370

22371

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22372

vcle_u64 (uint64x1_t __a, uint64x1_t __b)

22373

{

22374

- return (uint64x1_t) __builtin_aarch64_cmhsdi ((int64x1_t) __b,

22375

+ return (uint64x1_t) __builtin_aarch64_cmgeudi ((int64x1_t) __b,

22376

(int64x1_t) __a);

22377

}

22378

22379

@@ -19853,28 +19853,28 @@

22380

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22381

vcleq_u8 (uint8x16_t __a, uint8x16_t __b)

22382

{

22383

- return (uint8x16_t) __builtin_aarch64_cmhsv16qi ((int8x16_t) __b,

22384

+ return (uint8x16_t) __builtin_aarch64_cmgeuv16qi ((int8x16_t) __b,

22385

(int8x16_t) __a);

22386

}

22387

22388

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22389

vcleq_u16 (uint16x8_t __a, uint16x8_t __b)

22390

{

22391

- return (uint16x8_t) __builtin_aarch64_cmhsv8hi ((int16x8_t) __b,

22392

+ return (uint16x8_t) __builtin_aarch64_cmgeuv8hi ((int16x8_t) __b,

22393

(int16x8_t) __a);

22394

}

22395

22396

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22397

vcleq_u32 (uint32x4_t __a, uint32x4_t __b)

22398

{

22399

- return (uint32x4_t) __builtin_aarch64_cmhsv4si ((int32x4_t) __b,

22400

+ return (uint32x4_t) __builtin_aarch64_cmgeuv4si ((int32x4_t) __b,

22401

(int32x4_t) __a);

22402

}

22403

22404

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22405

vcleq_u64 (uint64x2_t __a, uint64x2_t __b)

22406

{

22407

- return (uint64x2_t) __builtin_aarch64_cmhsv2di ((int64x2_t) __b,

22408

+ return (uint64x2_t) __builtin_aarch64_cmgeuv2di ((int64x2_t) __b,

22409

(int64x2_t) __a);

22410

}

22411

22412

@@ -19919,28 +19919,28 @@

22413

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22414

vclt_u8 (uint8x8_t __a, uint8x8_t __b)

22415

{

22416

- return (uint8x8_t) __builtin_aarch64_cmhiv8qi ((int8x8_t) __b,

22417

+ return (uint8x8_t) __builtin_aarch64_cmgtuv8qi ((int8x8_t) __b,

22418

(int8x8_t) __a);

22419

}

22420

22421

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22422

vclt_u16 (uint16x4_t __a, uint16x4_t __b)

22423

{

22424

- return (uint16x4_t) __builtin_aarch64_cmhiv4hi ((int16x4_t) __b,

22425

+ return (uint16x4_t) __builtin_aarch64_cmgtuv4hi ((int16x4_t) __b,

22426

(int16x4_t) __a);

22427

}

22428

22429

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22430

vclt_u32 (uint32x2_t __a, uint32x2_t __b)

22431

{

22432

- return (uint32x2_t) __builtin_aarch64_cmhiv2si ((int32x2_t) __b,

22433

+ return (uint32x2_t) __builtin_aarch64_cmgtuv2si ((int32x2_t) __b,

22434

(int32x2_t) __a);

22435

}

22436

22437

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22438

vclt_u64 (uint64x1_t __a, uint64x1_t __b)

22439

{

22440

- return (uint64x1_t) __builtin_aarch64_cmhidi ((int64x1_t) __b,

22441

+ return (uint64x1_t) __builtin_aarch64_cmgtudi ((int64x1_t) __b,

22442

(int64x1_t) __a);

22443

}

22444

22445

@@ -19971,28 +19971,28 @@

22446

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22447

vcltq_u8 (uint8x16_t __a, uint8x16_t __b)

22448

{

22449

- return (uint8x16_t) __builtin_aarch64_cmhiv16qi ((int8x16_t) __b,

22450

+ return (uint8x16_t) __builtin_aarch64_cmgtuv16qi ((int8x16_t) __b,

22451

(int8x16_t) __a);

22452

}

22453

22454

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22455

vcltq_u16 (uint16x8_t __a, uint16x8_t __b)

22456

{

22457

- return (uint16x8_t) __builtin_aarch64_cmhiv8hi ((int16x8_t) __b,

22458

+ return (uint16x8_t) __builtin_aarch64_cmgtuv8hi ((int16x8_t) __b,

22459

(int16x8_t) __a);

22460

}

22461

22462

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22463

vcltq_u32 (uint32x4_t __a, uint32x4_t __b)

22464

{

22465

- return (uint32x4_t) __builtin_aarch64_cmhiv4si ((int32x4_t) __b,

22466

+ return (uint32x4_t) __builtin_aarch64_cmgtuv4si ((int32x4_t) __b,

22467

(int32x4_t) __a);

22468

}

22469

22470

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22471

vcltq_u64 (uint64x2_t __a, uint64x2_t __b)

22472

{

22473

- return (uint64x2_t) __builtin_aarch64_cmhiv2di ((int64x2_t) __b,

22474

+ return (uint64x2_t) __builtin_aarch64_cmgtuv2di ((int64x2_t) __b,

22475

(int64x2_t) __a);

22476

}

22477

22478

Index: gcc/config/aarch64/aarch64.md

22479

===================================================================

22480

--- a/src/gcc/config/aarch64/aarch64.md (.../tags/gcc_4_8_2_release)

22481

+++ b/src/gcc/config/aarch64/aarch64.md (.../branches/gcc-4_8-branch)

22482

@@ -2211,7 +2211,7 @@

22483

(set_attr "mode" "SI")]

22484

)

22485

22486

-(define_insn "*cstore<mode>_neg"

22487

+(define_insn "cstore<mode>_neg"

22488

[(set (match_operand:ALLI 0 "register_operand" "=r")

22489

(neg:ALLI (match_operator:ALLI 1 "aarch64_comparison_operator"

22490

[(match_operand 2 "cc_register" "") (const_int 0)])))]

22491

Index: gcc/config/aarch64/aarch64-simd-builtins.def

22492

===================================================================

22493

--- a/src/gcc/config/aarch64/aarch64-simd-builtins.def (.../tags/gcc_4_8_2_release)

22494

+++ b/src/gcc/config/aarch64/aarch64-simd-builtins.def (.../branches/gcc-4_8-branch)

22495

@@ -217,8 +217,8 @@

22496

BUILTIN_VSDQ_I_DI (BINOP, cmle)

22497

BUILTIN_VSDQ_I_DI (BINOP, cmlt)

22498

/* Implemented by aarch64_cm<cmp><mode>. */

22499

- BUILTIN_VSDQ_I_DI (BINOP, cmhs)

22500

- BUILTIN_VSDQ_I_DI (BINOP, cmhi)

22501

+ BUILTIN_VSDQ_I_DI (BINOP, cmgeu)

22502

+ BUILTIN_VSDQ_I_DI (BINOP, cmgtu)

22503

BUILTIN_VSDQ_I_DI (BINOP, cmtst)

22504

22505

/* Implemented by aarch64_<fmaxmin><mode>. */

22506

Index: gcc/config/aarch64/iterators.md

22507

===================================================================

22508

--- a/src/gcc/config/aarch64/iterators.md (.../tags/gcc_4_8_2_release)

22509

+++ b/src/gcc/config/aarch64/iterators.md (.../branches/gcc-4_8-branch)

22510

@@ -83,6 +83,9 @@

22511

;; Vector Float modes.

22512

(define_mode_iterator VDQF [V2SF V4SF V2DF])

22513

22514

+;; All Float modes.

22515

+(define_mode_iterator VALLF [V2SF V4SF V2DF SF DF])

22516

+

22517

;; Vector Float modes with 2 elements.

22518

(define_mode_iterator V2F [V2SF V2DF])

22519

22520

@@ -213,13 +216,6 @@

22521

UNSPEC_URSHL ; Used in aarch64-simd.md.

22522

UNSPEC_SQRSHL ; Used in aarch64-simd.md.

22523

UNSPEC_UQRSHL ; Used in aarch64-simd.md.

22524

- UNSPEC_CMEQ ; Used in aarch64-simd.md.

22525

- UNSPEC_CMLE ; Used in aarch64-simd.md.

22526

- UNSPEC_CMLT ; Used in aarch64-simd.md.

22527

- UNSPEC_CMGE ; Used in aarch64-simd.md.

22528

- UNSPEC_CMGT ; Used in aarch64-simd.md.

22529

- UNSPEC_CMHS ; Used in aarch64-simd.md.

22530

- UNSPEC_CMHI ; Used in aarch64-simd.md.

22531

UNSPEC_SSLI ; Used in aarch64-simd.md.

22532

UNSPEC_USLI ; Used in aarch64-simd.md.

22533

UNSPEC_SSRI ; Used in aarch64-simd.md.

22534

@@ -227,7 +223,6 @@

22535

UNSPEC_SSHLL ; Used in aarch64-simd.md.

22536

UNSPEC_USHLL ; Used in aarch64-simd.md.

22537

UNSPEC_ADDP ; Used in aarch64-simd.md.

22538

- UNSPEC_CMTST ; Used in aarch64-simd.md.

22539

UNSPEC_FMAX ; Used in aarch64-simd.md.

22540

UNSPEC_FMIN ; Used in aarch64-simd.md.

22541

UNSPEC_BSL ; Used in aarch64-simd.md.

22542

@@ -251,6 +246,7 @@

22543

22544

;; For scalar usage of vector/FP registers

22545

(define_mode_attr v [(QI "b") (HI "h") (SI "s") (DI "d")

22546

+ (SF "s") (DF "d")

22547

(V8QI "") (V16QI "")

22548

(V4HI "") (V8HI "")

22549

(V2SI "") (V4SI "")

22550

@@ -305,7 +301,8 @@

22551

(V4SF ".4s") (V2DF ".2d")

22552

(DI "") (SI "")

22553

(HI "") (QI "")

22554

- (TI "")])

22555

+ (TI "") (SF "")

22556

+ (DF "")])

22557

22558

;; Register suffix narrowed modes for VQN.

22559

(define_mode_attr Vmntype [(V8HI ".8b") (V4SI ".4h")

22560

@@ -444,7 +441,8 @@

22561

(V2SI "V2SI") (V4SI "V4SI")

22562

(DI "DI") (V2DI "V2DI")

22563

(V2SF "V2SI") (V4SF "V4SI")

22564

- (V2DF "V2DI")])

22565

+ (V2DF "V2DI") (DF "DI")

22566

+ (SF "SI")])

22567

22568

;; Lower case mode of results of comparison operations.

22569

(define_mode_attr v_cmp_result [(V8QI "v8qi") (V16QI "v16qi")

22570

@@ -452,7 +450,8 @@

22571

(V2SI "v2si") (V4SI "v4si")

22572

(DI "di") (V2DI "v2di")

22573

(V2SF "v2si") (V4SF "v4si")

22574

- (V2DF "v2di")])

22575

+ (V2DF "v2di") (DF "di")

22576

+ (SF "si")])

22577

22578

;; Vm for lane instructions is restricted to FP_LO_REGS.

22579

(define_mode_attr vwx [(V4HI "x") (V8HI "x") (HI "x")

22580

@@ -543,6 +542,12 @@

22581

;; Code iterator for signed variants of vector saturating binary ops.

22582

(define_code_iterator SBINQOPS [ss_plus ss_minus])

22583

22584

+;; Comparison operators for <F>CM.

22585

+(define_code_iterator COMPARISONS [lt le eq ge gt])

22586

+

22587

+;; Unsigned comparison operators.

22588

+(define_code_iterator UCOMPARISONS [ltu leu geu gtu])

22589

+

22590

;; -------------------------------------------------------------------

22591

;; Code Attributes

22592

;; -------------------------------------------------------------------

22593

@@ -571,8 +576,29 @@

22594

(eq "eq")

22595

(ne "ne")

22596

(lt "lt")

22597

- (ge "ge")])

22598

+ (ge "ge")

22599

+ (le "le")

22600

+ (gt "gt")

22601

+ (ltu "ltu")

22602

+ (leu "leu")

22603

+ (geu "geu")

22604

+ (gtu "gtu")])

22605

22606

+;; For comparison operators we use the FCM* and CM* instructions.

22607

+;; As there are no CMLE or CMLT instructions which act on 3 vector

22608

+;; operands, we must use CMGE or CMGT and swap the order of the

22609

+;; source operands.

22610

+

22611

+(define_code_attr n_optab [(lt "gt") (le "ge") (eq "eq") (ge "ge") (gt "gt")

22612

+ (ltu "hi") (leu "hs") (geu "hs") (gtu "hi")])

22613

+(define_code_attr cmp_1 [(lt "2") (le "2") (eq "1") (ge "1") (gt "1")

22614

+ (ltu "2") (leu "2") (geu "1") (gtu "1")])

22615

+(define_code_attr cmp_2 [(lt "1") (le "1") (eq "2") (ge "2") (gt "2")

22616

+ (ltu "1") (leu "1") (geu "2") (gtu "2")])

22617

+

22618

+(define_code_attr CMP [(lt "LT") (le "LE") (eq "EQ") (ge "GE") (gt "GT")

22619

+ (ltu "LTU") (leu "LEU") (geu "GEU") (gtu "GTU")])

22620

+

22621

;; Optab prefix for sign/zero-extending operations

22622

(define_code_attr su_optab [(sign_extend "") (zero_extend "u")

22623

(div "") (udiv "u")

22624

@@ -680,11 +706,6 @@

22625

UNSPEC_SQSHRN UNSPEC_UQSHRN

22626

UNSPEC_SQRSHRN UNSPEC_UQRSHRN])

22627

22628

-(define_int_iterator VCMP_S [UNSPEC_CMEQ UNSPEC_CMGE UNSPEC_CMGT

22629

- UNSPEC_CMLE UNSPEC_CMLT])

22630

-

22631

-(define_int_iterator VCMP_U [UNSPEC_CMHS UNSPEC_CMHI UNSPEC_CMTST])

22632

-

22633

(define_int_iterator PERMUTE [UNSPEC_ZIP1 UNSPEC_ZIP2

22634

UNSPEC_TRN1 UNSPEC_TRN2

22635

UNSPEC_UZP1 UNSPEC_UZP2])

22636

@@ -768,12 +789,6 @@

22637

(UNSPEC_RADDHN2 "add")

22638

(UNSPEC_RSUBHN2 "sub")])

22639

22640

-(define_int_attr cmp [(UNSPEC_CMGE "ge") (UNSPEC_CMGT "gt")

22641

- (UNSPEC_CMLE "le") (UNSPEC_CMLT "lt")

22642

- (UNSPEC_CMEQ "eq")

22643

- (UNSPEC_CMHS "hs") (UNSPEC_CMHI "hi")

22644

- (UNSPEC_CMTST "tst")])

22645

-

22646

(define_int_attr offsetlr [(UNSPEC_SSLI "1") (UNSPEC_USLI "1")

22647

(UNSPEC_SSRI "0") (UNSPEC_USRI "0")])

22648

22649

Index: gcc/config/rs6000/rs6000.c

22650

===================================================================

22651

--- a/src/gcc/config/rs6000/rs6000.c (.../tags/gcc_4_8_2_release)

22652

+++ b/src/gcc/config/rs6000/rs6000.c (.../branches/gcc-4_8-branch)

22653

@@ -5428,12 +5428,13 @@

22654

break;

22655

22656

case TFmode:

22657

- case TDmode:

22658

- case TImode:

22659

if (TARGET_E500_DOUBLE)

22660

return (SPE_CONST_OFFSET_OK (offset)

22661

&& SPE_CONST_OFFSET_OK (offset + 8));

22662

+ /* fall through */

22663

22664

+ case TDmode:

22665

+ case TImode:

22666

extra = 8;

22667

if (!worst_case)

22668

break;

22669

Index: gcc/config/rs6000/rs6000.md

22670

===================================================================

22671

--- a/src/gcc/config/rs6000/rs6000.md (.../tags/gcc_4_8_2_release)

22672

+++ b/src/gcc/config/rs6000/rs6000.md (.../branches/gcc-4_8-branch)

22673

@@ -2412,7 +2412,7 @@

22674

(match_operand:SI 2 "gpc_reg_operand" "r,r"))

22675

(const_int 0)))

22676

(clobber (match_scratch:SI 3 "=r,r"))]

22677

- ""

22678

+ "TARGET_32BIT"

22679

"@

22680

mullw. %3,%1,%2

22681

#"

22682

@@ -2425,7 +2425,7 @@

22683

(match_operand:SI 2 "gpc_reg_operand" ""))

22684

(const_int 0)))

22685

(clobber (match_scratch:SI 3 ""))]

22686

- "reload_completed"

22687

+ "TARGET_32BIT && reload_completed"

22688

[(set (match_dup 3)

22689

(mult:SI (match_dup 1) (match_dup 2)))

22690

(set (match_dup 0)

22691

@@ -2440,7 +2440,7 @@

22692

(const_int 0)))

22693

(set (match_operand:SI 0 "gpc_reg_operand" "=r,r")

22694

(mult:SI (match_dup 1) (match_dup 2)))]

22695

- ""

22696

+ "TARGET_32BIT"

22697

"@

22698

mullw. %0,%1,%2

22699

#"

22700

@@ -2454,7 +2454,7 @@

22701

(const_int 0)))

22702

(set (match_operand:SI 0 "gpc_reg_operand" "")

22703

(mult:SI (match_dup 1) (match_dup 2)))]

22704

- "reload_completed"

22705

+ "TARGET_32BIT && reload_completed"

22706

[(set (match_dup 0)

22707

(mult:SI (match_dup 1) (match_dup 2)))

22708

(set (match_dup 3)

22709

Index: gcc/config/arm/arm.c

22710

===================================================================

22711

--- a/src/gcc/config/arm/arm.c (.../tags/gcc_4_8_2_release)

22712

+++ b/src/gcc/config/arm/arm.c (.../branches/gcc-4_8-branch)

22713

@@ -5425,7 +5425,8 @@

22714

if (!crtl->uses_pic_offset_table)

22715

{

22716

gcc_assert (can_create_pseudo_p ());

22717

- if (arm_pic_register != INVALID_REGNUM)

22718

+ if (arm_pic_register != INVALID_REGNUM

22719

+ && !(TARGET_THUMB1 && arm_pic_register > LAST_LO_REGNUM))

22720

{

22721

if (!cfun->machine->pic_reg)

22722

cfun->machine->pic_reg = gen_rtx_REG (Pmode, arm_pic_register);

22723

@@ -5451,7 +5452,12 @@

22724

crtl->uses_pic_offset_table = 1;

22725

start_sequence ();

22726

22727

- arm_load_pic_register (0UL);

22728

+ if (TARGET_THUMB1 && arm_pic_register != INVALID_REGNUM

22729

+ && arm_pic_register > LAST_LO_REGNUM)

22730

+ emit_move_insn (cfun->machine->pic_reg,

22731

+ gen_rtx_REG (Pmode, arm_pic_register));

22732

+ else

22733

+ arm_load_pic_register (0UL);

22734

22735

seq = get_insns ();

22736

end_sequence ();

22737

@@ -5709,6 +5715,14 @@

22738

emit_insn (gen_movsi (pic_offset_table_rtx, pic_tmp));

22739

emit_insn (gen_pic_add_dot_plus_four (pic_reg, pic_reg, labelno));

22740

}

22741

+ else if (arm_pic_register != INVALID_REGNUM

22742

+ && arm_pic_register > LAST_LO_REGNUM

22743

+ && REGNO (pic_reg) <= LAST_LO_REGNUM)

22744

+ {

22745

+ emit_insn (gen_pic_load_addr_unified (pic_reg, pic_rtx, labelno));

22746

+ emit_move_insn (gen_rtx_REG (Pmode, arm_pic_register), pic_reg);

22747

+ emit_use (gen_rtx_REG (Pmode, arm_pic_register));

22748

+ }

22749

else

22750

emit_insn (gen_pic_load_addr_unified (pic_reg, pic_rtx, labelno));

22751

}

22752

@@ -23555,6 +23569,7 @@

22753

num_regs = bit_count (saved_regs_mask);

22754

if ((offsets->outgoing_args != (1 + num_regs)) || cfun->calls_alloca)

22755

{

22756

+ emit_insn (gen_blockage ());

22757

/* Unwind the stack to just below the saved registers. */

22758

emit_insn (gen_addsi3 (stack_pointer_rtx,

22759

hard_frame_pointer_rtx,

22760

@@ -23583,8 +23598,8 @@

22761

22762

if (crtl->calls_eh_return)

22763

emit_insn (gen_addsi3 (stack_pointer_rtx,

22764

- stack_pointer_rtx,

22765

- GEN_INT (ARM_EH_STACKADJ_REGNUM)));

22766

+ stack_pointer_rtx,

22767

+ gen_rtx_REG (SImode, ARM_EH_STACKADJ_REGNUM)));

22768

22769

if (IS_STACKALIGN (func_type))

22770

/* Restore the original stack pointer. Before prologue, the stack was

22771

Index: gcc/config/arm/vfp.md

22772

===================================================================

22773

--- a/src/gcc/config/arm/vfp.md (.../tags/gcc_4_8_2_release)

22774

+++ b/src/gcc/config/arm/vfp.md (.../branches/gcc-4_8-branch)

22775

@@ -1264,6 +1264,7 @@

22776

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

22777

"vrint<vrint_variant>%?.<V_if_elem>\\t%<V_reg>0, %<V_reg>1"

22778

[(set_attr "predicable" "<vrint_predicable>")

22779

+ (set_attr "conds" "<vrint_conds>")

22780

(set_attr "type" "f_rint<vfp_type>")]

22781

)

22782

22783

@@ -1280,7 +1281,8 @@

22784

(match_operand:SDF 2 "register_operand" "<F_constraint>")))]

22785

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

22786

"vmaxnm.<V_if_elem>\\t%<V_reg>0, %<V_reg>1, %<V_reg>2"

22787

- [(set_attr "type" "f_minmax<vfp_type>")]

22788

+ [(set_attr "type" "f_minmax<vfp_type>")

22789

+ (set_attr "conds" "unconditional")]

22790

)

22791

22792

(define_insn "smin<mode>3"

22793

@@ -1289,7 +1291,8 @@

22794

(match_operand:SDF 2 "register_operand" "<F_constraint>")))]

22795

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

22796

"vminnm.<V_if_elem>\\t%<V_reg>0, %<V_reg>1, %<V_reg>2"

22797

- [(set_attr "type" "f_minmax<vfp_type>")]

22798

+ [(set_attr "type" "f_minmax<vfp_type>")

22799

+ (set_attr "conds" "unconditional")]

22800

)

22801

22802

;; Unimplemented insns:

22803

Index: gcc/config/arm/iterators.md

22804

===================================================================

22805

--- a/src/gcc/config/arm/iterators.md (.../tags/gcc_4_8_2_release)

22806

+++ b/src/gcc/config/arm/iterators.md (.../branches/gcc-4_8-branch)

22807

@@ -493,6 +493,10 @@

22808

(UNSPEC_VRINTA "no") (UNSPEC_VRINTM "no")

22809

(UNSPEC_VRINTR "yes") (UNSPEC_VRINTX "yes")])

22810

22811

+(define_int_attr vrint_conds [(UNSPEC_VRINTZ "nocond") (UNSPEC_VRINTP "unconditional")

22812

+ (UNSPEC_VRINTA "unconditional") (UNSPEC_VRINTM "unconditional")

22813

+ (UNSPEC_VRINTR "nocond") (UNSPEC_VRINTX "nocond")])

22814

+

22815

(define_int_attr nvrint_variant [(UNSPEC_NVRINTZ "z") (UNSPEC_NVRINTP "p")

22816

(UNSPEC_NVRINTA "a") (UNSPEC_NVRINTM "m")

22817

(UNSPEC_NVRINTX "x") (UNSPEC_NVRINTN "n")])

22818

Index: gcc/config/pa/pa.c

22819

===================================================================

22820

--- a/src/gcc/config/pa/pa.c (.../tags/gcc_4_8_2_release)

22821

+++ b/src/gcc/config/pa/pa.c (.../branches/gcc-4_8-branch)

22822

@@ -10522,13 +10522,13 @@

22823

22824

/* When INT14_OK_STRICT is false, a secondary reload is needed

22825

to adjust the displacement of SImode and DImode floating point

22826

- instructions. So, we return false when STRICT is true. We

22827

+ instructions but this may fail when the register also needs

22828

+ reloading. So, we return false when STRICT is true. We

22829

also reject long displacements for float mode addresses since

22830

the majority of accesses will use floating point instructions

22831

that don't support 14-bit offsets. */

22832

if (!INT14_OK_STRICT

22833

- && reload_in_progress

22834

- && strict

22835

+ && (strict || !(reload_in_progress || reload_completed))

22836

&& mode != QImode

22837

&& mode != HImode)

22838

return false;

22839

@@ -10588,8 +10588,7 @@

22840

return true;

22841

22842

if (!INT14_OK_STRICT

22843

- && reload_in_progress

22844

- && strict

22845

+ && (strict || !(reload_in_progress || reload_completed))

22846

&& mode != QImode

22847

&& mode != HImode)

22848

return false;

22849

Index: gcc/config/mips/driver-native.c

22850

===================================================================

22851

--- a/src/gcc/config/mips/driver-native.c (.../tags/gcc_4_8_2_release)

22852

+++ b/src/gcc/config/mips/driver-native.c (.../branches/gcc-4_8-branch)

22853

@@ -58,11 +58,17 @@

22854

if (strncmp (buf, "cpu model", sizeof ("cpu model") - 1) == 0)

22855

{

22856

if (strstr (buf, "Godson2 V0.2") != NULL

22857

- || strstr (buf, "Loongson-2 V0.2") != NULL)

22858

+ || strstr (buf, "Loongson-2 V0.2") != NULL

22859

+ || strstr (buf, "Loongson-2E") != NULL)

22860

cpu = "loongson2e";

22861

else if (strstr (buf, "Godson2 V0.3") != NULL

22862

- || strstr (buf, "Loongson-2 V0.3") != NULL)

22863

+ || strstr (buf, "Loongson-2 V0.3") != NULL

22864

+ || strstr (buf, "Loongson-2F") != NULL)

22865

cpu = "loongson2f";

22866

+ else if (strstr (buf, "Godson3 V0.5") != NULL

22867

+ || strstr (buf, "Loongson-3 V0.5") != NULL

22868

+ || strstr (buf, "Loongson-3A") != NULL)

22869

+ cpu = "loongson3a";

22870

else if (strstr (buf, "SiByte SB1") != NULL)

22871

cpu = "sb1";

22872

else if (strstr (buf, "R5000") != NULL)

22873

Index: gcc/config/mips/mips.md

22874

===================================================================

22875

--- a/src/gcc/config/mips/mips.md (.../tags/gcc_4_8_2_release)

22876

+++ b/src/gcc/config/mips/mips.md (.../branches/gcc-4_8-branch)

22877

@@ -73,6 +73,11 @@

22878

UNSPEC_STORE_LEFT

22879

UNSPEC_STORE_RIGHT

22880

22881

+ ;; Integer operations that are too cumbersome to describe directly.

22882

+ UNSPEC_WSBH

22883

+ UNSPEC_DSBH

22884

+ UNSPEC_DSHD

22885

+

22886

;; Floating-point moves.

22887

UNSPEC_LOAD_LOW

22888

UNSPEC_LOAD_HIGH

22889

@@ -1294,20 +1299,32 @@

22890

22891

;; Combiner patterns for unsigned byte-add.

22892

22893

-(define_insn "*baddu_si"

22894

+(define_insn "*baddu_si_eb"

22895

[(set (match_operand:SI 0 "register_operand" "=d")

22896

(zero_extend:SI

22897

- (plus:QI (match_operand:QI 1 "register_operand" "d")

22898

- (match_operand:QI 2 "register_operand" "d"))))]

22899

- "ISA_HAS_BADDU"

22900

+ (subreg:QI

22901

+ (plus:SI (match_operand:SI 1 "register_operand" "d")

22902

+ (match_operand:SI 2 "register_operand" "d")) 3)))]

22903

+ "ISA_HAS_BADDU && BYTES_BIG_ENDIAN"

22904

"baddu\\t%0,%1,%2"

22905

[(set_attr "alu_type" "add")])

22906

22907

+(define_insn "*baddu_si_el"

22908

+ [(set (match_operand:SI 0 "register_operand" "=d")

22909

+ (zero_extend:SI

22910

+ (subreg:QI

22911

+ (plus:SI (match_operand:SI 1 "register_operand" "d")

22912

+ (match_operand:SI 2 "register_operand" "d")) 0)))]

22913

+ "ISA_HAS_BADDU && !BYTES_BIG_ENDIAN"

22914

+ "baddu\\t%0,%1,%2"

22915

+ [(set_attr "alu_type" "add")])

22916

+

22917

(define_insn "*baddu_di<mode>"

22918

[(set (match_operand:GPR 0 "register_operand" "=d")

22919

(zero_extend:GPR

22920

- (plus:QI (truncate:QI (match_operand:DI 1 "register_operand" "d"))

22921

- (truncate:QI (match_operand:DI 2 "register_operand" "d")))))]

22922

+ (truncate:QI

22923

+ (plus:DI (match_operand:DI 1 "register_operand" "d")

22924

+ (match_operand:DI 2 "register_operand" "d")))))]

22925

"ISA_HAS_BADDU && TARGET_64BIT"

22926

"baddu\\t%0,%1,%2"

22927

[(set_attr "alu_type" "add")])

22928

@@ -5367,6 +5384,56 @@

22929

}

22930

[(set_attr "type" "shift")

22931

(set_attr "mode" "<MODE>")])

22932

+

22933

+(define_insn "bswaphi2"

22934

+ [(set (match_operand:HI 0 "register_operand" "=d")

22935

+ (bswap:HI (match_operand:HI 1 "register_operand" "d")))]

22936

+ "ISA_HAS_WSBH"

22937

+ "wsbh\t%0,%1"

22938

+ [(set_attr "type" "shift")])

22939

+

22940

+(define_insn_and_split "bswapsi2"

22941

+ [(set (match_operand:SI 0 "register_operand" "=d")

22942

+ (bswap:SI (match_operand:SI 1 "register_operand" "d")))]

22943

+ "ISA_HAS_WSBH && ISA_HAS_ROR"

22944

+ "#"

22945

+ ""

22946

+ [(set (match_dup 0) (unspec:SI [(match_dup 1)] UNSPEC_WSBH))

22947

+ (set (match_dup 0) (rotatert:SI (match_dup 0) (const_int 16)))]

22948

+ ""

22949

+ [(set_attr "length" "8")])

22950

+

22951

+(define_insn_and_split "bswapdi2"

22952

+ [(set (match_operand:DI 0 "register_operand" "=d")

22953

+ (bswap:DI (match_operand:DI 1 "register_operand" "d")))]

22954

+ "TARGET_64BIT && ISA_HAS_WSBH"

22955

+ "#"

22956

+ ""

22957

+ [(set (match_dup 0) (unspec:DI [(match_dup 1)] UNSPEC_DSBH))

22958

+ (set (match_dup 0) (unspec:DI [(match_dup 0)] UNSPEC_DSHD))]

22959

+ ""

22960

+ [(set_attr "length" "8")])

22961

+

22962

+(define_insn "wsbh"

22963

+ [(set (match_operand:SI 0 "register_operand" "=d")

22964

+ (unspec:SI [(match_operand:SI 1 "register_operand" "d")] UNSPEC_WSBH))]

22965

+ "ISA_HAS_WSBH"

22966

+ "wsbh\t%0,%1"

22967

+ [(set_attr "type" "shift")])

22968

+

22969

+(define_insn "dsbh"

22970

+ [(set (match_operand:DI 0 "register_operand" "=d")

22971

+ (unspec:DI [(match_operand:DI 1 "register_operand" "d")] UNSPEC_DSBH))]

22972

+ "TARGET_64BIT && ISA_HAS_WSBH"

22973

+ "dsbh\t%0,%1"

22974

+ [(set_attr "type" "shift")])

22975

+

22976

+(define_insn "dshd"

22977

+ [(set (match_operand:DI 0 "register_operand" "=d")

22978

+ (unspec:DI [(match_operand:DI 1 "register_operand" "d")] UNSPEC_DSHD))]

22979

+ "TARGET_64BIT && ISA_HAS_WSBH"

22980

+ "dshd\t%0,%1"

22981

+ [(set_attr "type" "shift")])

22982

22983

;;

22984

;; ....................

22985

Index: gcc/config/mips/mips.c

22986

===================================================================

22987

--- a/src/gcc/config/mips/mips.c (.../tags/gcc_4_8_2_release)

22988

+++ b/src/gcc/config/mips/mips.c (.../branches/gcc-4_8-branch)

22989

@@ -3560,17 +3560,6 @@

22990

}

22991

}

22992

22993

-/* Return the cost of an operand X that can be trucated for free.

22994

- SPEED says whether we're optimizing for size or speed. */

22995

-

22996

-static int

22997

-mips_truncated_op_cost (rtx x, bool speed)

22998

-{

22999

- if (GET_CODE (x) == TRUNCATE)

23000

- x = XEXP (x, 0);

23001

- return set_src_cost (x, speed);

23002

-}

23003

-

23004

/* Implement TARGET_RTX_COSTS. */

23005

23006

static bool

23007

@@ -3951,13 +3940,12 @@

23008

case ZERO_EXTEND:

23009

if (outer_code == SET

23010

&& ISA_HAS_BADDU

23011

+ && (GET_CODE (XEXP (x, 0)) == TRUNCATE

23012

+ || GET_CODE (XEXP (x, 0)) == SUBREG)

23013

&& GET_MODE (XEXP (x, 0)) == QImode

23014

- && GET_CODE (XEXP (x, 0)) == PLUS)

23015

+ && GET_CODE (XEXP (XEXP (x, 0), 0)) == PLUS)

23016

{

23017

- rtx plus = XEXP (x, 0);

23018

- *total = (COSTS_N_INSNS (1)

23019

- + mips_truncated_op_cost (XEXP (plus, 0), speed)

23020

- + mips_truncated_op_cost (XEXP (plus, 1), speed));

23021

+ *total = set_src_cost (XEXP (XEXP (x, 0), 0), speed);

23022

return true;

23023

}

23024

*total = mips_zero_extend_cost (mode, XEXP (x, 0));

23025

Index: gcc/config/mips/mips.h

23026

===================================================================

23027

--- a/src/gcc/config/mips/mips.h (.../tags/gcc_4_8_2_release)

23028

+++ b/src/gcc/config/mips/mips.h (.../branches/gcc-4_8-branch)

23029

@@ -949,6 +949,11 @@

23030

|| TARGET_SMARTMIPS) \

23031

&& !TARGET_MIPS16)

23032

23033

+/* ISA has the WSBH (word swap bytes within halfwords) instruction.

23034

+ 64-bit targets also provide DSBH and DSHD. */

23035

+#define ISA_HAS_WSBH ((ISA_MIPS32R2 || ISA_MIPS64R2) \

23036

+ && !TARGET_MIPS16)

23037

+

23038

/* ISA has data prefetch instructions. This controls use of 'pref'. */

23039

#define ISA_HAS_PREFETCH ((ISA_MIPS4 \

23040

|| TARGET_LOONGSON_2EF \

23041

Index: gcc/regcprop.c

23042

===================================================================

23043

--- a/src/gcc/regcprop.c (.../tags/gcc_4_8_2_release)

23044

+++ b/src/gcc/regcprop.c (.../branches/gcc-4_8-branch)

23045

@@ -747,6 +747,7 @@

23046

int n_ops, i, alt, predicated;

23047

bool is_asm, any_replacements;

23048

rtx set;

23049

+ rtx link;

23050

bool replaced[MAX_RECOG_OPERANDS];

23051

bool changed = false;

23052

struct kill_set_value_data ksvd;

23053

@@ -815,6 +816,23 @@

23054

if (recog_op_alt[i][alt].earlyclobber)

23055

kill_value (recog_data.operand[i], vd);

23056

23057

+ /* If we have dead sets in the insn, then we need to note these as we

23058

+ would clobbers. */

23059

+ for (link = REG_NOTES (insn); link; link = XEXP (link, 1))

23060

+ {

23061

+ if (REG_NOTE_KIND (link) == REG_UNUSED)

23062

+ {

23063

+ kill_value (XEXP (link, 0), vd);

23064

+ /* Furthermore, if the insn looked like a single-set,

23065

+ but the dead store kills the source value of that

23066

+ set, then we can no-longer use the plain move

23067

+ special case below. */

23068

+ if (set

23069

+ && reg_overlap_mentioned_p (XEXP (link, 0), SET_SRC (set)))

23070

+ set = NULL;

23071

+ }

23072

+ }

23073

+

23074

/* Special-case plain move instructions, since we may well

23075

be able to do the move from a different register class. */

23076

if (set && REG_P (SET_SRC (set)))

23077

Index: libgo/configure

23078

===================================================================

23079

--- a/src/libgo/configure (.../tags/gcc_4_8_2_release)

23080

+++ b/src/libgo/configure (.../branches/gcc-4_8-branch)

23081

@@ -14700,7 +14700,7 @@

23082

fi

23083

23084

23085

-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

23086

+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

23087

do :

23088

as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh`

23089

ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var"

23090

Index: libgo/Makefile.in

23091

===================================================================

23092

--- a/src/libgo/Makefile.in (.../tags/gcc_4_8_2_release)

23093

+++ b/src/libgo/Makefile.in (.../branches/gcc-4_8-branch)

23094

@@ -195,7 +195,7 @@

23095

@LIBGO_IS_LINUX_TRUE@am__objects_5 = getncpu-linux.lo

23096

am__objects_6 = go-append.lo go-assert.lo go-assert-interface.lo \

23097

go-byte-array-to-string.lo go-breakpoint.lo go-caller.lo \

23098

- go-callers.lo go-can-convert-interface.lo go-cgo.lo \

23099

+ go-callers.lo go-can-convert-interface.lo go-cdiv.lo go-cgo.lo \

23100

go-check-interface.lo go-construct-map.lo \

23101

go-convert-interface.lo go-copy.lo go-defer.lo \

23102

go-deferred-recover.lo go-eface-compare.lo \

23103

@@ -757,6 +757,7 @@

23104

runtime/go-caller.c \

23105

runtime/go-callers.c \

23106

runtime/go-can-convert-interface.c \

23107

+ runtime/go-cdiv.c \

23108

runtime/go-cgo.c \

23109

runtime/go-check-interface.c \

23110

runtime/go-construct-map.c \

23111

@@ -1446,7 +1447,7 @@

23112

go/go/build/build.go \

23113

go/go/build/doc.go \

23114

go/go/build/read.go \

23115

- syslist.go

23116

+ go/go/build/syslist.go

23117

23118

go_go_doc_files = \

23119

go/go/doc/comment.go \

23120

@@ -2368,6 +2369,7 @@

23121

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-caller.Plo@am__quote@

23122

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-callers.Plo@am__quote@

23123

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-can-convert-interface.Plo@am__quote@

23124

+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-cdiv.Plo@am__quote@

23125

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-cgo.Plo@am__quote@

23126

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-check-interface.Plo@am__quote@

23127

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-construct-map.Plo@am__quote@

23128

@@ -2554,6 +2556,13 @@

23129

@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@

23130

@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

23131

23132

+go-cdiv.lo: runtime/go-cdiv.c

23133

+@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

23134

+@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/go-cdiv.Tpo $(DEPDIR)/go-cdiv.Plo

23135

+@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='runtime/go-cdiv.c' object='go-cdiv.lo' libtool=yes @AMDEPBACKSLASH@

23136

+@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@

23137

+@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

23138

+

23139

go-cgo.lo: runtime/go-cgo.c

23140

@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

23141

@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/go-cgo.Tpo $(DEPDIR)/go-cgo.Plo

23142

@@ -5062,15 +5071,6 @@

23143

@$(CHECK)

23144

.PHONY: go/build/check

23145

23146

-syslist.go: s-syslist; @true

23147

-s-syslist: Makefile

23148

- echo '// Generated automatically by make.' >syslist.go.tmp

23149

- echo 'package build' >>syslist.go.tmp

23150

- echo 'const goosList = "$(GOOS)"' >>syslist.go.tmp

23151

- echo 'const goarchList = "$(GOARCH)"' >>syslist.go.tmp

23152

- $(SHELL) $(srcdir)/../move-if-change syslist.go.tmp syslist.go

23153

- $(STAMP) $@

23154

-

23155

@go_include@ go/doc.lo.dep

23156

go/doc.lo.dep: $(go_go_doc_files)

23157

$(BUILDDEPS)

23158

Index: libgo/runtime/go-defer.c

23159

===================================================================

23160

--- a/src/libgo/runtime/go-defer.c (.../tags/gcc_4_8_2_release)

23161

+++ b/src/libgo/runtime/go-defer.c (.../branches/gcc-4_8-branch)

23162

@@ -27,6 +27,7 @@

23163

n->__pfn = pfn;

23164

n->__arg = arg;

23165

n->__retaddr = NULL;

23166

+ n->__makefunc_can_recover = 0;

23167

g->defer = n;

23168

}

23169

23170

Index: libgo/runtime/go-defer.h

23171

===================================================================

23172

--- a/src/libgo/runtime/go-defer.h (.../tags/gcc_4_8_2_release)

23173

+++ b/src/libgo/runtime/go-defer.h (.../branches/gcc-4_8-branch)

23174

@@ -34,4 +34,10 @@

23175

set by __go_set_defer_retaddr which is called by the thunks

23176

created by defer statements. */

23177

const void *__retaddr;

23178

+

23179

+ /* Set to true if a function created by reflect.MakeFunc is

23180

+ permitted to recover. The return address of such a function

23181

+ function will be somewhere in libffi, so __retaddr is not

23182

+ useful. */

23183

+ _Bool __makefunc_can_recover;

23184

};

23185

Index: libgo/runtime/go-int-array-to-string.c

23186

===================================================================

23187

--- a/src/libgo/runtime/go-int-array-to-string.c (.../tags/gcc_4_8_2_release)

23188

+++ b/src/libgo/runtime/go-int-array-to-string.c (.../branches/gcc-4_8-branch)

23189

@@ -30,6 +30,8 @@

23190

23191

if (v < 0 || v > 0x10ffff)

23192

v = 0xfffd;

23193

+ else if (0xd800 <= v && v <= 0xdfff)

23194

+ v = 0xfffd;

23195

23196

if (v <= 0x7f)

23197

slen += 1;

23198

@@ -56,6 +58,8 @@

23199

character. */

23200

if (v < 0 || v > 0x10ffff)

23201

v = 0xfffd;

23202

+ else if (0xd800 <= v && v <= 0xdfff)

23203

+ v = 0xfffd;

23204

23205

if (v <= 0x7f)

23206

*s++ = v;

23207

Index: libgo/runtime/go-nosys.c

23208

===================================================================

23209

--- a/src/libgo/runtime/go-nosys.c (.../tags/gcc_4_8_2_release)

23210

+++ b/src/libgo/runtime/go-nosys.c (.../branches/gcc-4_8-branch)

23211

@@ -43,6 +43,17 @@

23212

}

23213

#endif

23214

23215

+#ifndef HAVE_DUP3

23216

+int

23217

+dup3 (int oldfd __attribute__ ((unused)),

23218

+ int newfd __attribute__ ((unused)),

23219

+ int flags __attribute__ ((unused)))

23220

+{

23221

+ errno = ENOSYS;

23222

+ return -1;

23223

+}

23224

+#endif

23225

+

23226

#ifndef HAVE_EPOLL_CREATE1

23227

int

23228

epoll_create1 (int flags __attribute__ ((unused)))

23229

@@ -112,6 +123,18 @@

23230

}

23231

#endif

23232

23233

+#ifndef HAVE_GETXATTR

23234

+ssize_t

23235

+getxattr (const char *path __attribute__ ((unused)),

23236

+ const char *name __attribute__ ((unused)),

23237

+ void *value __attribute__ ((unused)),

23238

+ size_t size __attribute__ ((unused)))

23239

+{

23240

+ errno = ENOSYS;

23241

+ return -1;

23242

+}

23243

+#endif

23244

+

23245

#ifndef HAVE_INOTIFY_ADD_WATCH

23246

int

23247

inotify_add_watch (int fd __attribute__ ((unused)),

23248

@@ -151,6 +174,17 @@

23249

}

23250

#endif

23251

23252

+#ifndef HAVE_LISTXATTR

23253

+ssize_t

23254

+listxattr (const char *path __attribute__ ((unused)),

23255

+ char *list __attribute__ ((unused)),

23256

+ size_t size __attribute__ ((unused)))

23257

+{

23258

+ errno = ENOSYS;

23259

+ return -1;

23260

+}

23261

+#endif

23262

+

23263

#ifndef HAVE_MKDIRAT

23264

int

23265

mkdirat (int dirfd __attribute__ ((unused)),

23266

@@ -196,6 +230,16 @@

23267

}

23268

#endif

23269

23270

+#ifndef HAVE_REMOVEXATTR

23271

+int

23272

+removexattr (const char *path __attribute__ ((unused)),

23273

+ const char *name __attribute__ ((unused)))

23274

+{

23275

+ errno = ENOSYS;

23276

+ return -1;

23277

+}

23278

+#endif

23279

+

23280

#ifndef HAVE_RENAMEAT

23281

int

23282

renameat (int olddirfd __attribute__ ((unused)),

23283

@@ -208,6 +252,19 @@

23284

}

23285

#endif

23286

23287

+#ifndef HAVE_SETXATTR

23288

+int

23289

+setxattr (const char *path __attribute__ ((unused)),

23290

+ const char *name __attribute__ ((unused)),

23291

+ const void *value __attribute__ ((unused)),

23292

+ size_t size __attribute__ ((unused)),

23293

+ int flags __attribute__ ((unused)))

23294

+{

23295

+ errno = ENOSYS;

23296

+ return -1;

23297

+}

23298

+#endif

23299

+

23300

#ifndef HAVE_SPLICE

23301

int

23302

splice (int fd __attribute__ ((unused)),

23303

Index: libgo/runtime/runtime.h

23304

===================================================================

23305

--- a/src/libgo/runtime/runtime.h (.../tags/gcc_4_8_2_release)

23306

+++ b/src/libgo/runtime/runtime.h (.../branches/gcc-4_8-branch)

23307

@@ -440,7 +440,7 @@

23308

};

23309

void runtime_hashinit(void);

23310

23311

-void runtime_traceback();

23312

+void runtime_traceback(void);

23313

void runtime_tracebackothers(G*);

23314

23315

/*

23316

@@ -756,6 +756,7 @@

23317

extern _Bool __go_file_line(uintptr, String*, String*, intgo *);

23318

extern byte* runtime_progname();

23319

extern void runtime_main(void*);

23320

+extern uint32 runtime_in_callers;

23321

23322

int32 getproccount(void);

23323

23324

Index: libgo/runtime/proc.c

23325

===================================================================

23326

--- a/src/libgo/runtime/proc.c (.../tags/gcc_4_8_2_release)

23327

+++ b/src/libgo/runtime/proc.c (.../branches/gcc-4_8-branch)

23328

@@ -2239,6 +2239,14 @@

23329

if(prof.fn == nil || prof.hz == 0)

23330

return;

23331

23332

+ if(runtime_atomicload(&runtime_in_callers) > 0) {

23333

+ // If SIGPROF arrived while already fetching runtime

23334

+ // callers we can have trouble on older systems

23335

+ // because the unwind library calls dl_iterate_phdr

23336

+ // which was not recursive in the past.

23337

+ return;

23338

+ }

23339

+

23340

runtime_lock(&prof);

23341

if(prof.fn == nil) {

23342

runtime_unlock(&prof);

23343

Index: libgo/runtime/mgc0.c

23344

===================================================================

23345

--- a/src/libgo/runtime/mgc0.c (.../tags/gcc_4_8_2_release)

23346

+++ b/src/libgo/runtime/mgc0.c (.../branches/gcc-4_8-branch)

23347

@@ -239,8 +239,7 @@

23348

// (Manually inlined copy of MHeap_LookupMaybe.)

23349

k = (uintptr)obj>>PageShift;

23350

x = k;

23351

- if(sizeof(void*) == 8)

23352

- x -= (uintptr)runtime_mheap->arena_start>>PageShift;

23353

+ x -= (uintptr)runtime_mheap->arena_start>>PageShift;

23354

s = runtime_mheap->map[x];

23355

if(s == nil || k < s->start || k - s->start >= s->npages || s->state != MSpanInUse)

23356

return false;

23357

@@ -418,8 +417,7 @@

23358

// (Manually inlined copy of MHeap_LookupMaybe.)

23359

k = (uintptr)obj>>PageShift;

23360

x = k;

23361

- if(sizeof(void*) == 8)

23362

- x -= (uintptr)arena_start>>PageShift;

23363

+ x -= (uintptr)arena_start>>PageShift;

23364

s = runtime_mheap->map[x];

23365

if(s == nil || k < s->start || k - s->start >= s->npages || s->state != MSpanInUse)

23366

continue;

23367

@@ -466,8 +464,7 @@

23368

// Ask span about size class.

23369

// (Manually inlined copy of MHeap_Lookup.)

23370

x = (uintptr)obj >> PageShift;

23371

- if(sizeof(void*) == 8)

23372

- x -= (uintptr)arena_start>>PageShift;

23373

+ x -= (uintptr)arena_start>>PageShift;

23374

s = runtime_mheap->map[x];

23375

23376

PREFETCH(obj);

23377

@@ -585,8 +582,7 @@

23378

if(t == nil)

23379

return;

23380

x = (uintptr)obj >> PageShift;

23381

- if(sizeof(void*) == 8)

23382

- x -= (uintptr)(runtime_mheap->arena_start)>>PageShift;

23383

+ x -= (uintptr)(runtime_mheap->arena_start)>>PageShift;

23384

s = runtime_mheap->map[x];

23385

objstart = (byte*)((uintptr)s->start<<PageShift);

23386

if(s->sizeclass != 0) {

23387

Index: libgo/runtime/go-signal.c

23388

===================================================================

23389

--- a/src/libgo/runtime/go-signal.c (.../tags/gcc_4_8_2_release)

23390

+++ b/src/libgo/runtime/go-signal.c (.../branches/gcc-4_8-branch)

23391

@@ -234,7 +234,7 @@

23392

G *g;

23393

23394

g = runtime_g ();

23395

- runtime_traceback (g);

23396

+ runtime_traceback ();

23397

runtime_tracebackothers (g);

23398

23399

/* The gc library calls runtime_dumpregs here, and provides

23400

@@ -399,6 +399,9 @@

23401

{

23402

G *gp;

23403

M *mp;

23404

+#ifdef USING_SPLIT_STACK

23405

+ void *stack_context[10];

23406

+#endif

23407

23408

/* We are now running on the stack registered via sigaltstack.

23409

(Actually there is a small span of time between runtime_siginit

23410

@@ -409,7 +412,7 @@

23411

if (gp != NULL)

23412

{

23413

#ifdef USING_SPLIT_STACK

23414

- __splitstack_getcontext (&gp->stack_context[0]);

23415

+ __splitstack_getcontext (&stack_context[0]);

23416

#endif

23417

}

23418

23419

@@ -432,7 +435,7 @@

23420

if (gp != NULL)

23421

{

23422

#ifdef USING_SPLIT_STACK

23423

- __splitstack_setcontext (&gp->stack_context[0]);

23424

+ __splitstack_setcontext (&stack_context[0]);

23425

#endif

23426

}

23427

}

23428

Index: libgo/runtime/go-callers.c

23429

===================================================================

23430

--- a/src/libgo/runtime/go-callers.c (.../tags/gcc_4_8_2_release)

23431

+++ b/src/libgo/runtime/go-callers.c (.../branches/gcc-4_8-branch)

23432

@@ -11,6 +11,13 @@

23433

#include "runtime.h"

23434

#include "array.h"

23435

23436

+/* This is set to non-zero when calling backtrace_full. This is used

23437

+ to avoid getting hanging on a recursive lock in dl_iterate_phdr on

23438

+ older versions of glibc when a SIGPROF signal arrives while

23439

+ collecting a backtrace. */

23440

+

23441

+uint32 runtime_in_callers;

23442

+

23443

/* Argument passed to callback function. */

23444

23445

struct callers_data

23446

@@ -111,8 +118,10 @@

23447

data.skip = skip + 1;

23448

data.index = 0;

23449

data.max = m;

23450

+ runtime_xadd (&runtime_in_callers, 1);

23451

backtrace_full (__go_get_backtrace_state (), 0, callback, error_callback,

23452

&data);

23453

+ runtime_xadd (&runtime_in_callers, -1);

23454

return data.index;

23455

}

23456

23457

Index: libgo/runtime/go-cdiv.c

23458

===================================================================

23459

--- a/src/libgo/runtime/go-cdiv.c (.../tags/gcc_4_8_2_release)

23460

+++ b/src/libgo/runtime/go-cdiv.c (.../branches/gcc-4_8-branch)

23461

@@ -0,0 +1,46 @@

23462

+/* go-cdiv.c -- complex division routines

23463

+

23464

23465

+ Use of this source code is governed by a BSD-style

23466

+ license that can be found in the LICENSE file. */

23467

+

23468

+/* Calls to these functions are generated by the Go frontend for

23469

+ division of complex64 or complex128. We use these because Go's

23470

+ complex division expects slightly different results from the GCC

23471

+ default. When dividing NaN+1.0i / 0+0i, Go expects NaN+NaNi but

23472

+ GCC generates NaN+Infi. NaN+Infi seems wrong seems the rules of

23473

+ C99 Annex G specify that if either side of a complex number is Inf,

23474

+ the the whole number is Inf, but an operation involving NaN ought

23475

+ to result in NaN, not Inf. */

23476

+

23477

+__complex float

23478

+__go_complex64_div (__complex float a, __complex float b)

23479

+{

23480

+ if (__builtin_expect (b == 0+0i, 0))

23481

+ {

23482

+ if (!__builtin_isinff (__real__ a)

23483

+ && !__builtin_isinff (__imag__ a)

23484

+ && (__builtin_isnanf (__real__ a) || __builtin_isnanf (__imag__ a)))

23485

+ {

23486

+ /* Pass "1" to nanf to match math/bits.go. */

23487

+ return __builtin_nanf("1") + __builtin_nanf("1")*1i;

23488

+ }

23489

+ }

23490

+ return a / b;

23491

+}

23492

+

23493

+__complex double

23494

+__go_complex128_div (__complex double a, __complex double b)

23495

+{

23496

+ if (__builtin_expect (b == 0+0i, 0))

23497

+ {

23498

+ if (!__builtin_isinf (__real__ a)

23499

+ && !__builtin_isinf (__imag__ a)

23500

+ && (__builtin_isnan (__real__ a) || __builtin_isnan (__imag__ a)))

23501

+ {

23502

+ /* Pass "1" to nan to match math/bits.go. */

23503

+ return __builtin_nan("1") + __builtin_nan("1")*1i;

23504

+ }

23505

+ }

23506

+ return a / b;

23507

+}

23508

Index: libgo/runtime/go-reflect-call.c

23509

===================================================================

23510

--- a/src/libgo/runtime/go-reflect-call.c (.../tags/gcc_4_8_2_release)

23511

+++ b/src/libgo/runtime/go-reflect-call.c (.../branches/gcc-4_8-branch)

23512

@@ -98,9 +98,12 @@

23513

const struct __go_struct_field *fields;

23514

int i;

23515

23516

+ field_count = descriptor->__fields.__count;

23517

+ if (field_count == 0) {

23518

+ return &ffi_type_void;

23519

+ }

23520

ret = (ffi_type *) __go_alloc (sizeof (ffi_type));

23521

ret->type = FFI_TYPE_STRUCT;

23522

- field_count = descriptor->__fields.__count;

23523

fields = (const struct __go_struct_field *) descriptor->__fields.__values;

23524

ret->elements = (ffi_type **) __go_alloc ((field_count + 1)

23525

* sizeof (ffi_type *));

23526

Index: libgo/runtime/go-recover.c

23527

===================================================================

23528

--- a/src/libgo/runtime/go-recover.c (.../tags/gcc_4_8_2_release)

23529

+++ b/src/libgo/runtime/go-recover.c (.../branches/gcc-4_8-branch)

23530

@@ -16,12 +16,14 @@

23531

__go_can_recover--this is, the thunk. */

23532

23533

_Bool

23534

-__go_can_recover (const void* retaddr)

23535

+__go_can_recover (const void *retaddr)

23536

{

23537

G *g;

23538

struct __go_defer_stack *d;

23539

const char* ret;

23540

const char* dret;

23541

+ Location loc;

23542

+ const byte *name;

23543

23544

g = runtime_g ();

23545

23546

@@ -52,9 +54,80 @@

23547

#endif

23548

23549

dret = (const char *) d->__retaddr;

23550

- return ret <= dret && ret + 16 >= dret;

23551

+ if (ret <= dret && ret + 16 >= dret)

23552

+ return 1;

23553

+

23554

+ /* If the function calling recover was created by reflect.MakeFunc,

23555

+ then RETADDR will be somewhere in libffi. Our caller is

23556

+ permitted to recover if it was called from libffi. */

23557

+ if (!d->__makefunc_can_recover)

23558

+ return 0;

23559

+

23560

+ if (runtime_callers (2, &loc, 1) < 1)

23561

+ return 0;

23562

+

23563

+ /* If we have no function name, then we weren't called by Go code.

23564

+ Guess that we were called by libffi. */

23565

+ if (loc.function.len == 0)

23566

+ return 1;

23567

+

23568

+ if (loc.function.len < 4)

23569

+ return 0;

23570

+ name = loc.function.str;

23571

+ if (*name == '_')

23572

+ {

23573

+ if (loc.function.len < 5)

23574

+ return 0;

23575

+ ++name;

23576

+ }

23577

+

23578

+ if (name[0] == 'f' && name[1] == 'f' && name[2] == 'i' && name[3] == '_')

23579

+ return 1;

23580

+

23581

+ /* We may also be called by reflect.makeFuncImpl.call, for a

23582

+ function created by reflect.MakeFunc. */

23583

+ if (__builtin_strstr ((const char *) name, "makeFuncImpl") != NULL)

23584

+ return 1;

23585

+

23586

+ return 0;

23587

}

23588

23589

+/* This function is called when code is about to enter a function

23590

+ created by reflect.MakeFunc. It is called by the function stub

23591

+ used by MakeFunc. If the stub is permitted to call recover, then a

23592

+ real MakeFunc function is permitted to call recover. */

23593

+

23594

+void

23595

+__go_makefunc_can_recover (const void *retaddr)

23596

+{

23597

+ struct __go_defer_stack *d;

23598

+

23599

+ d = runtime_g ()->defer;

23600

+ if (d != NULL

23601

+ && !d->__makefunc_can_recover

23602

+ && __go_can_recover (retaddr))

23603

+ d->__makefunc_can_recover = 1;

23604

+}

23605

+

23606

+/* This function is called when code is about to exit a function

23607

+ created by reflect.MakeFunc. It is called by the function stub

23608

+ used by MakeFunc. It clears the __makefunc_can_recover field.

23609

+ It's OK to always clear this field, because __go_can_recover will

23610

+ only be called by a stub created for a function that calls recover.

23611

+ That stub will not call a function created by reflect.MakeFunc, so

23612

+ by the time we get here any caller higher up on the call stack no

23613

+ longer needs the information. */

23614

+

23615

+void

23616

+__go_makefunc_returning (void)

23617

+{

23618

+ struct __go_defer_stack *d;

23619

+

23620

+ d = runtime_g ()->defer;

23621

+ if (d != NULL)

23622

+ d->__makefunc_can_recover = 0;

23623

+}

23624

+

23625

/* This is only called when it is valid for the caller to recover the

23626

value on top of the panic stack, if there is one. */

23627

23628

Index: libgo/runtime/malloc.goc

23629

===================================================================

23630

--- a/src/libgo/runtime/malloc.goc (.../tags/gcc_4_8_2_release)

23631

+++ b/src/libgo/runtime/malloc.goc (.../branches/gcc-4_8-branch)

23632

@@ -541,8 +541,7 @@

23633

23634

// (Manually inlined copy of runtime_MHeap_Lookup)

23635

p = (uintptr)v>>PageShift;

23636

- if(sizeof(void*) == 8)

23637

- p -= (uintptr)runtime_mheap->arena_start >> PageShift;

23638

+ p -= (uintptr)runtime_mheap->arena_start >> PageShift;

23639

s = runtime_mheap->map[p];

23640

23641

if(s->sizeclass == 0) {

23642

Index: libgo/runtime/go-make-slice.c

23643

===================================================================

23644

--- a/src/libgo/runtime/go-make-slice.c (.../tags/gcc_4_8_2_release)

23645

+++ b/src/libgo/runtime/go-make-slice.c (.../branches/gcc-4_8-branch)

23646

@@ -34,7 +34,10 @@

23647

std = (const struct __go_slice_type *) td;

23648

23649

ilen = (intgo) len;

23650

- if (ilen < 0 || (uintptr_t) ilen != len)

23651

+ if (ilen < 0

23652

+ || (uintptr_t) ilen != len

23653

+ || (std->__element_type->__size > 0

23654

+ && len > MaxMem / std->__element_type->__size))

23655

runtime_panicstring ("makeslice: len out of range");

23656

23657

icap = (intgo) cap;

23658

Index: libgo/runtime/mheap.c

23659

===================================================================

23660

--- a/src/libgo/runtime/mheap.c (.../tags/gcc_4_8_2_release)

23661

+++ b/src/libgo/runtime/mheap.c (.../branches/gcc-4_8-branch)

23662

@@ -150,8 +150,7 @@

23663

runtime_MSpan_Init(t, s->start + npage, s->npages - npage);

23664

s->npages = npage;

23665

p = t->start;

23666

- if(sizeof(void*) == 8)

23667

- p -= ((uintptr)h->arena_start>>PageShift);

23668

+ p -= ((uintptr)h->arena_start>>PageShift);

23669

if(p > 0)

23670

h->map[p-1] = s;

23671

h->map[p] = t;

23672

@@ -169,8 +168,7 @@

23673

s->elemsize = (sizeclass==0 ? s->npages<<PageShift : (uintptr)runtime_class_to_size[sizeclass]);

23674

s->types.compression = MTypes_Empty;

23675

p = s->start;

23676

- if(sizeof(void*) == 8)

23677

- p -= ((uintptr)h->arena_start>>PageShift);

23678

+ p -= ((uintptr)h->arena_start>>PageShift);

23679

for(n=0; n<npage; n++)

23680

h->map[p+n] = s;

23681

return s;

23682

@@ -241,8 +239,7 @@

23683

mstats.mspan_sys = h->spanalloc.sys;

23684

runtime_MSpan_Init(s, (uintptr)v>>PageShift, ask>>PageShift);

23685

p = s->start;

23686

- if(sizeof(void*) == 8)

23687

- p -= ((uintptr)h->arena_start>>PageShift);

23688

+ p -= ((uintptr)h->arena_start>>PageShift);

23689

h->map[p] = s;

23690

h->map[p + s->npages - 1] = s;

23691

s->state = MSpanInUse;

23692

@@ -259,8 +256,7 @@

23693

uintptr p;

23694

23695

p = (uintptr)v;

23696

- if(sizeof(void*) == 8)

23697

- p -= (uintptr)h->arena_start;

23698

+ p -= (uintptr)h->arena_start;

23699

return h->map[p >> PageShift];

23700

}

23701

23702

@@ -281,8 +277,7 @@

23703

return nil;

23704

p = (uintptr)v>>PageShift;

23705

q = p;

23706

- if(sizeof(void*) == 8)

23707

- q -= (uintptr)h->arena_start >> PageShift;

23708

+ q -= (uintptr)h->arena_start >> PageShift;

23709

s = h->map[q];

23710

if(s == nil || p < s->start || p - s->start >= s->npages)

23711

return nil;

23712

@@ -332,8 +327,7 @@

23713

23714

// Coalesce with earlier, later spans.

23715

p = s->start;

23716

- if(sizeof(void*) == 8)

23717

- p -= (uintptr)h->arena_start >> PageShift;

23718

+ p -= (uintptr)h->arena_start >> PageShift;

23719

if(p > 0 && (t = h->map[p-1]) != nil && t->state != MSpanInUse) {

23720

tp = (uintptr*)(t->start<<PageShift);

23721

*tp |= *sp; // propagate "needs zeroing" mark

23722

Index: libgo/mksysinfo.sh

23723

===================================================================

23724

--- a/src/libgo/mksysinfo.sh (.../tags/gcc_4_8_2_release)

23725

+++ b/src/libgo/mksysinfo.sh (.../branches/gcc-4_8-branch)

23726

@@ -1035,6 +1035,10 @@

23727

grep '^const _LOCK_' gen-sysinfo.go |

23728

sed -e 's/^$const $_$LOCK_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

23729

23730

+# The PRIO constants.

23731

+grep '^const _PRIO_' gen-sysinfo.go | \

23732

+ sed -e 's/^$const $_$PRIO_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

23733

+

23734

# The GNU/Linux LINUX_REBOOT flags.

23735

grep '^const _LINUX_REBOOT_' gen-sysinfo.go |

23736

sed -e 's/^$const $_$LINUX_REBOOT_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

23737

Index: libgo/config.h.in

23738

===================================================================

23739

--- a/src/libgo/config.h.in (.../tags/gcc_4_8_2_release)

23740

+++ b/src/libgo/config.h.in (.../branches/gcc-4_8-branch)

23741

@@ -39,6 +39,9 @@

23742

/* Define to 1 if you have the `dl_iterate_phdr' function. */

23743

#undef HAVE_DL_ITERATE_PHDR

23744

23745

+/* Define to 1 if you have the `dup3' function. */

23746

+#undef HAVE_DUP3

23747

+

23748

/* Define to 1 if you have the `epoll_create1' function. */

23749

#undef HAVE_EPOLL_CREATE1

23750

23751

@@ -66,6 +69,9 @@

23752

/* Define if _Unwind_GetIPInfo is available. */

23753

#undef HAVE_GETIPINFO

23754

23755

+/* Define to 1 if you have the `getxattr' function. */

23756

+#undef HAVE_GETXATTR

23757

+

23758

/* Define to 1 if you have the `inotify_add_watch' function. */

23759

#undef HAVE_INOTIFY_ADD_WATCH

23760

23761

@@ -111,6 +117,9 @@

23762

/* Define to 1 if you have the <linux/rtnetlink.h> header file. */

23763

#undef HAVE_LINUX_RTNETLINK_H

23764

23765

+/* Define to 1 if you have the `listxattr' function. */

23766

+#undef HAVE_LISTXATTR

23767

+

23768

/* Define to 1 if the system has the type `loff_t'. */

23769

#undef HAVE_LOFF_T

23770

23771

@@ -171,6 +180,9 @@

23772

/* Define to 1 if you have the `pipe2' function. */

23773

#undef HAVE_PIPE2

23774

23775

+/* Define to 1 if you have the `removexattr' function. */

23776

+#undef HAVE_REMOVEXATTR

23777

+

23778

/* Define to 1 if you have the `renameat' function. */

23779

#undef HAVE_RENAMEAT

23780

23781

@@ -180,6 +192,9 @@

23782

/* Define to 1 if you have the `setenv' function. */

23783

#undef HAVE_SETENV

23784

23785

+/* Define to 1 if you have the `setxattr' function. */

23786

+#undef HAVE_SETXATTR

23787

+

23788

/* Define to 1 if you have the `sinl' function. */

23789

#undef HAVE_SINL

23790

23791

Index: libgo/configure.ac

23792

===================================================================

23793

--- a/src/libgo/configure.ac (.../tags/gcc_4_8_2_release)

23794

+++ b/src/libgo/configure.ac (.../branches/gcc-4_8-branch)

23795

@@ -503,7 +503,7 @@

23796

AM_CONDITIONAL(HAVE_STRERROR_R, test "$ac_cv_func_strerror_r" = yes)

23797

AM_CONDITIONAL(HAVE_WAIT4, test "$ac_cv_func_wait4" = yes)

23798

23799

-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)

23800

+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)

23801

AC_TYPE_OFF_T

23802

AC_CHECK_TYPES([loff_t])

23803

23804

Index: libgo/go/reflect/value.go

23805

===================================================================

23806

--- a/src/libgo/go/reflect/value.go (.../tags/gcc_4_8_2_release)

23807

+++ b/src/libgo/go/reflect/value.go (.../branches/gcc-4_8-branch)

23808

@@ -98,6 +98,7 @@

23809

flagIndir

23810

flagAddr

23811

flagMethod

23812

+ flagMethodFn // gccgo: first fn parameter is always pointer

23813

flagKindShift = iota

23814

flagKindWidth = 5 // there are 27 kinds

23815

flagKindMask flag = 1<<flagKindWidth - 1

23816

@@ -433,7 +434,7 @@

23817

if v.flag&flagMethod != 0 {

23818

nin++

23819

}

23820

- firstPointer := len(in) > 0 && t.In(0).Kind() != Ptr && v.flag&flagMethod == 0 && isMethod(v.typ)

23821

+ firstPointer := len(in) > 0 && t.In(0).Kind() != Ptr && v.flag&flagMethodFn != 0

23822

params := make([]unsafe.Pointer, nin)

23823

off := 0

23824

if v.flag&flagMethod != 0 {

23825

@@ -484,33 +485,6 @@

23826

return ret

23827

}

23828

23829

-// gccgo specific test to see if typ is a method. We can tell by

23830

-// looking at the string to see if there is a receiver. We need this

23831

-// because for gccgo all methods take pointer receivers.

23832

-func isMethod(t *rtype) bool {

23833

- if Kind(t.kind) != Func {

23834

- return false

23835

- }

23836

- s := *t.string

23837

- parens := 0

23838

- params := 0

23839

- sawRet := false

23840

- for i, c := range s {

23841

- if c == '(' {

23842

- if parens == 0 {

23843

- params++

23844

- }

23845

- parens++

23846

- } else if c == ')' {

23847

- parens--

23848

- } else if parens == 0 && c == ' ' && s[i+1] != '(' && !sawRet {

23849

- params++

23850

- sawRet = true

23851

- }

23852

- }

23853

- return params > 2

23854

-}

23855

-

23856

// methodReceiver returns information about the receiver

23857

// described by v. The Value v may or may not have the

23858

// flagMethod bit set, so the kind cached in v.flag should

23859

@@ -917,6 +891,16 @@

23860

v = makeMethodValue("Interface", v)

23861

}

23862

23863

+ if v.flag&flagMethodFn != 0 {

23864

+ if v.typ.Kind() != Func {

23865

+ panic("reflect: MethodFn of non-Func")

23866

+ }

23867

+ ft := (*funcType)(unsafe.Pointer(v.typ))

23868

+ if ft.in[0].Kind() != Ptr {

23869

+ v = makeValueMethod(v)

23870

+ }

23871

+ }

23872

+

23873

k := v.kind()

23874

if k == Interface {

23875

// Special case: return the element inside the interface.

23876

@@ -1230,8 +1214,7 @@

23877

// created via reflect have the same underlying code pointer,

23878

// so their Pointers are equal. The function used here must

23879

// match the one used in makeMethodValue.

23880

- // This is not properly implemented for gccgo.

23881

- f := Zero

23882

+ f := makeFuncStub

23883

return **(**uintptr)(unsafe.Pointer(&f))

23884

}

23885

p := v.val

23886

Index: libgo/go/reflect/makefuncgo_386.go

23887

===================================================================

23888

--- a/src/libgo/go/reflect/makefuncgo_386.go (.../tags/gcc_4_8_2_release)

23889

+++ b/src/libgo/go/reflect/makefuncgo_386.go (.../branches/gcc-4_8-branch)

23890

@@ -14,8 +14,10 @@

23891

// registers that might hold result values.

23892

type i386Regs struct {

23893

esp uint32

23894

- eax uint32 // Value to return in %eax.

23895

- st0 uint64 // Value to return in %st(0).

23896

+ eax uint32 // Value to return in %eax.

23897

+ st0 float64 // Value to return in %st(0).

23898

+ sr bool // Set to true if hidden struct pointer.

23899

+ sf bool // Set to true if returning float

23900

}

23901

23902

// MakeFuncStubGo implements the 386 calling convention for MakeFunc.

23903

@@ -56,10 +58,13 @@

23904

in := make([]Value, 0, len(ftyp.in))

23905

ap := uintptr(regs.esp)

23906

23907

+ regs.sr = false

23908

+ regs.sf = false

23909

var retPtr unsafe.Pointer

23910

if retStruct {

23911

retPtr = *(*unsafe.Pointer)(unsafe.Pointer(ap))

23912

ap += ptrSize

23913

+ regs.sr = true

23914

}

23915

23916

for _, rt := range ftyp.in {

23917

@@ -77,7 +82,7 @@

23918

23919

// Call the real function.

23920

23921

- out := c.fn(in)

23922

+ out := c.call(in)

23923

23924

if len(out) != len(ftyp.out) {

23925

panic("reflect: wrong return count from function created by MakeFunc")

23926

@@ -123,13 +128,16 @@

23927

23928

v := out[0]

23929

w := v.iword()

23930

- if v.Kind() != Ptr && v.Kind() != UnsafePointer {

23931

- w = loadIword(unsafe.Pointer(w), v.typ.size)

23932

- }

23933

switch v.Kind() {

23934

- case Float32, Float64:

23935

- regs.st0 = uint64(uintptr(w))

23936

+ case Ptr, UnsafePointer:

23937

+ regs.eax = uint32(uintptr(w))

23938

+ case Float32:

23939

+ regs.st0 = float64(*(*float32)(unsafe.Pointer(w)))

23940

+ regs.sf = true

23941

+ case Float64:

23942

+ regs.st0 = *(*float64)(unsafe.Pointer(w))

23943

+ regs.sf = true

23944

default:

23945

- regs.eax = uint32(uintptr(w))

23946

+ regs.eax = uint32(uintptr(loadIword(unsafe.Pointer(w), v.typ.size)))

23947

}

23948

}

23949

Index: libgo/go/reflect/makefunc_amd64.S

23950

===================================================================

23951

--- a/src/libgo/go/reflect/makefunc_amd64.S (.../tags/gcc_4_8_2_release)

23952

+++ b/src/libgo/go/reflect/makefunc_amd64.S (.../branches/gcc-4_8-branch)

23953

@@ -61,6 +61,14 @@

23954

movdqa %xmm6, 0xa0(%rsp)

23955

movdqa %xmm7, 0xb0(%rsp)

23956

23957

+ /* For MakeFunc functions that call recover. */

23958

+ movq 8(%rbp), %rdi

23959

+#ifdef __PIC__

23960

+ call __go_makefunc_can_recover@PLT

23961

+#else

23962

+ call __go_makefunc_can_recover

23963

+#endif

23964

+

23965

# Get function type.

23966

#ifdef __PIC__

23967

call __go_get_closure@PLT

23968

@@ -77,6 +85,13 @@

23969

call reflect.MakeFuncStubGo

23970

#endif

23971

23972

+ /* MakeFunc functions can no longer call recover. */

23973

+#ifdef __PIC__

23974

+ call __go_makefunc_returning@PLT

23975

+#else

23976

+ call __go_makefunc_returning

23977

+#endif

23978

+

23979

# The structure will be updated with any return values. Load

23980

# all possible return registers before returning to the caller.

23981

23982

Index: libgo/go/reflect/type.go

23983

===================================================================

23984

--- a/src/libgo/go/reflect/type.go (.../tags/gcc_4_8_2_release)

23985

+++ b/src/libgo/go/reflect/type.go (.../branches/gcc-4_8-branch)

23986

@@ -508,7 +508,7 @@

23987

m.Type = toType(mt)

23988

x := new(unsafe.Pointer)

23989

*x = unsafe.Pointer(&p.tfn)

23990

- m.Func = Value{mt, unsafe.Pointer(x), fl | flagIndir}

23991

+ m.Func = Value{mt, unsafe.Pointer(x), fl | flagIndir | flagMethodFn}

23992

m.Index = i

23993

return

23994

}

23995

Index: libgo/go/reflect/makefunc_386.S

23996

===================================================================

23997

--- a/src/libgo/go/reflect/makefunc_386.S (.../tags/gcc_4_8_2_release)

23998

+++ b/src/libgo/go/reflect/makefunc_386.S (.../branches/gcc-4_8-branch)

23999

@@ -25,9 +25,13 @@

24000

struct {

24001

esp uint32 // 0x0

24002

eax uint32 // 0x4

24003

- st0 uint64 // 0x8

24004

+ st0 float64 // 0x8

24005

+ sr bool // 0x10

24006

+ sf bool // 0x11

24007

}

24008

- */

24009

+ The sr field is set by the function to a non-zero value if

24010

+ the function takes a struct hidden pointer that must be

24011

+ popped off the stack. */

24012

24013

pushl %ebp

24014

.LCFI0:

24015

@@ -45,7 +49,16 @@

24016

leal 8(%ebp), %eax /* Set esp field in struct. */

24017

movl %eax, -24(%ebp)

24018

24019

+ /* For MakeFunc functions that call recover. */

24020

+ movl 4(%ebp), %eax

24021

+ movl %eax, (%esp)

24022

#ifdef __PIC__

24023

+ call __go_makefunc_can_recover@PLT

24024

+#else

24025

+ call __go_makefunc_can_recover

24026

+#endif

24027

+

24028

+#ifdef __PIC__

24029

call __go_get_closure@PLT

24030

#else

24031

call __go_get_closure

24032

@@ -62,9 +75,20 @@

24033

call reflect.MakeFuncStubGo

24034

#endif

24035

24036

+ /* MakeFunc functions can no longer call recover. */

24037

+#ifdef __PIC__

24038

+ call __go_makefunc_returning@PLT

24039

+#else

24040

+ call __go_makefunc_returning

24041

+#endif

24042

+

24043

/* Set return registers. */

24044

24045

movl -20(%ebp), %eax

24046

+

24047

+ cmpb $0, -7(%ebp)

24048

+ je 2f

24049

+

24050

fldl -16(%ebp)

24051

24052

#ifdef __SSE2__

24053

@@ -73,12 +97,20 @@

24054

movsd -16(%ebp), %xmm0

24055

#endif

24056

24057

+2:

24058

+ movb -8(%ebp), %dl

24059

+

24060

addl $36, %esp

24061

popl %ebx

24062

.LCFI3:

24063

popl %ebp

24064

.LCFI4:

24065

+

24066

+ testb %dl,%dl

24067

+ jne 1f

24068

ret

24069

+1:

24070

+ ret $4

24071

.LFE1:

24072

#ifdef __ELF__

24073

.size reflect.makeFuncStub, . - reflect.makeFuncStub

24074

Index: libgo/go/reflect/all_test.go

24075

===================================================================

24076

--- a/src/libgo/go/reflect/all_test.go (.../tags/gcc_4_8_2_release)

24077

+++ b/src/libgo/go/reflect/all_test.go (.../branches/gcc-4_8-branch)

24078

@@ -1430,6 +1430,46 @@

24079

}

24080

}

24081

24082

+type emptyStruct struct{}

24083

+

24084

+type nonEmptyStruct struct {

24085

+ member int

24086

+}

24087

+

24088

+func returnEmpty() emptyStruct {

24089

+ return emptyStruct{}

24090

+}

24091

+

24092

+func takesEmpty(e emptyStruct) {

24093

+}

24094

+

24095

+func returnNonEmpty(i int) nonEmptyStruct {

24096

+ return nonEmptyStruct{member: i}

24097

+}

24098

+

24099

+func takesNonEmpty(n nonEmptyStruct) int {

24100

+ return n.member

24101

+}

24102

+

24103

+func TestCallWithStruct(t *testing.T) {

24104

+ r := ValueOf(returnEmpty).Call([]Value{})

24105

+ if len(r) != 1 || r[0].Type() != TypeOf(emptyStruct{}) {

24106

+ t.Errorf("returning empty struct returned %s instead", r)

24107

+ }

24108

+ r = ValueOf(takesEmpty).Call([]Value{ValueOf(emptyStruct{})})

24109

+ if len(r) != 0 {

24110

+ t.Errorf("takesEmpty returned values: %s", r)

24111

+ }

24112

+ r = ValueOf(returnNonEmpty).Call([]Value{ValueOf(42)})

24113

+ if len(r) != 1 || r[0].Type() != TypeOf(nonEmptyStruct{}) || r[0].Field(0).Int() != 42 {

24114

+ t.Errorf("returnNonEmpty returned %s", r)

24115

+ }

24116

+ r = ValueOf(takesNonEmpty).Call([]Value{ValueOf(nonEmptyStruct{member: 42})})

24117

+ if len(r) != 1 || r[0].Type() != TypeOf(1) || r[0].Int() != 42 {

24118

+ t.Errorf("takesNonEmpty returned %s", r)

24119

+ }

24120

+}

24121

+

24122

func TestMakeFunc(t *testing.T) {

24123

switch runtime.GOARCH {

24124

case "amd64", "386":

24125

@@ -1587,9 +1627,13 @@

24126

}

24127

}

24128

24129

-/* Not yet implemented for gccgo

24130

+func TestMethodValue(t *testing.T) {

24131

+ switch runtime.GOARCH {

24132

+ case "amd64", "386":

24133

+ default:

24134

+ t.Skip("reflect method values not implemented for " + runtime.GOARCH)

24135

+ }

24136

24137

-func TestMethodValue(t *testing.T) {

24138

p := Point{3, 4}

24139

var i int64

24140

24141

@@ -1658,8 +1702,6 @@

24142

}

24143

}

24144

24145

-*/

24146

-

24147

// Reflect version of $GOROOT/test/method5.go

24148

24149

// Concrete types implementing M method.

24150

@@ -1744,14 +1786,18 @@

24151

func (t4 Tm4) M(x int, b byte) (byte, int) { return b, x + 40 }

24152

24153

func TestMethod5(t *testing.T) {

24154

- /* Not yet used for gccgo

24155

+ switch runtime.GOARCH {

24156

+ case "amd64", "386":

24157

+ default:

24158

+ t.Skip("reflect method values not implemented for " + runtime.GOARCH)

24159

+ }

24160

+

24161

CheckF := func(name string, f func(int, byte) (byte, int), inc int) {

24162

b, x := f(1000, 99)

24163

if b != 99 || x != 1000+inc {

24164

t.Errorf("%s(1000, 99) = %v, %v, want 99, %v", name, b, x, 1000+inc)

24165

}

24166

}

24167

- */

24168

24169

CheckV := func(name string, i Value, inc int) {

24170

bx := i.Method(0).Call([]Value{ValueOf(1000), ValueOf(byte(99))})

24171

@@ -1761,9 +1807,7 @@

24172

t.Errorf("direct %s.M(1000, 99) = %v, %v, want 99, %v", name, b, x, 1000+inc)

24173

}

24174

24175

- /* Not yet implemented for gccgo

24176

CheckF(name+".M", i.Method(0).Interface().(func(int, byte) (byte, int)), inc)

24177

- */

24178

}

24179

24180

var TinterType = TypeOf(new(Tinter)).Elem()

24181

Index: libgo/go/reflect/makefunc.go

24182

===================================================================

24183

--- a/src/libgo/go/reflect/makefunc.go (.../tags/gcc_4_8_2_release)

24184

+++ b/src/libgo/go/reflect/makefunc.go (.../branches/gcc-4_8-branch)

24185

@@ -17,6 +17,11 @@

24186

code uintptr

24187

typ *funcType

24188

fn func([]Value) []Value

24189

+

24190

+ // For gccgo we use the same entry point for functions and for

24191

+ // method values.

24192

+ method int

24193

+ rcvr Value

24194

}

24195

24196

// MakeFunc returns a new function of the given Type

24197

@@ -61,7 +66,7 @@

24198

dummy := makeFuncStub

24199

code := **(**uintptr)(unsafe.Pointer(&dummy))

24200

24201

- impl := &makeFuncImpl{code: code, typ: ftyp, fn: fn}

24202

+ impl := &makeFuncImpl{code: code, typ: ftyp, fn: fn, method: -1}

24203

24204

return Value{t, unsafe.Pointer(&impl), flag(Func<<flagKindShift) | flagIndir}

24205

}

24206

@@ -85,15 +90,94 @@

24207

panic("reflect: internal error: invalid use of makePartialFunc")

24208

}

24209

24210

+ switch runtime.GOARCH {

24211

+ case "amd64", "386":

24212

+ default:

24213

+ panic("reflect.makeMethodValue not implemented for " + runtime.GOARCH)

24214

+ }

24215

+

24216

// Ignoring the flagMethod bit, v describes the receiver, not the method type.

24217

fl := v.flag & (flagRO | flagAddr | flagIndir)

24218

fl |= flag(v.typ.Kind()) << flagKindShift

24219

rcvr := Value{v.typ, v.val, fl}

24220

24221

+ // v.Type returns the actual type of the method value.

24222

+ ft := v.Type().(*rtype)

24223

+

24224

+ // Indirect Go func value (dummy) to obtain

24225

+ // actual code address. (A Go func value is a pointer

24226

+ // to a C function pointer. http://golang.org/s/go11func.)

24227

+ dummy := makeFuncStub

24228

+ code := **(**uintptr)(unsafe.Pointer(&dummy))

24229

+

24230

// Cause panic if method is not appropriate.

24231

// The panic would still happen during the call if we omit this,

24232

// but we want Interface() and other operations to fail early.

24233

- methodReceiver(op, rcvr, int(v.flag)>>flagMethodShift)

24234

+ t, _, _ := methodReceiver(op, rcvr, int(v.flag)>>flagMethodShift)

24235

24236

- panic("reflect makeMethodValue not implemented")

24237

+ fv := &makeFuncImpl{

24238

+ code: code,

24239

+ typ: (*funcType)(unsafe.Pointer(t)),

24240

+ method: int(v.flag) >> flagMethodShift,

24241

+ rcvr: rcvr,

24242

+ }

24243

+

24244

+ return Value{ft, unsafe.Pointer(&fv), v.flag&flagRO | flag(Func)<<flagKindShift | flagIndir}

24245

}

24246

+

24247

+// makeValueMethod takes a method function and returns a function that

24248

+// takes a value receiver and calls the real method with a pointer to

24249

+// it.

24250

+func makeValueMethod(v Value) Value {

24251

+ typ := v.typ

24252

+ if typ.Kind() != Func {

24253

+ panic("reflect: call of makeValueMethod with non-Func type")

24254

+ }

24255

+ if v.flag&flagMethodFn == 0 {

24256

+ panic("reflect: call of makeValueMethod with non-MethodFn")

24257

+ }

24258

+

24259

+ switch runtime.GOARCH {

24260

+ case "amd64", "386":

24261

+ default:

24262

+ panic("reflect.makeValueMethod not implemented for " + runtime.GOARCH)

24263

+ }

24264

+

24265

+ t := typ.common()

24266

+ ftyp := (*funcType)(unsafe.Pointer(t))

24267

+

24268

+ // Indirect Go func value (dummy) to obtain

24269

+ // actual code address. (A Go func value is a pointer

24270

+ // to a C function pointer. http://golang.org/s/go11func.)

24271

+ dummy := makeFuncStub

24272

+ code := **(**uintptr)(unsafe.Pointer(&dummy))

24273

+

24274

+ impl := &makeFuncImpl{

24275

+ code: code,

24276

+ typ: ftyp,

24277

+ method: -2,

24278

+ rcvr: v,

24279

+ }

24280

+

24281

+ return Value{t, unsafe.Pointer(&impl), flag(Func<<flagKindShift) | flagIndir}

24282

+}

24283

+

24284

+// Call the function represented by a makeFuncImpl.

24285

+func (c *makeFuncImpl) call(in []Value) []Value {

24286

+ if c.method == -1 {

24287

+ return c.fn(in)

24288

+ } else if c.method == -2 {

24289

+ if c.typ.IsVariadic() {

24290

+ return c.rcvr.CallSlice(in)

24291

+ } else {

24292

+ return c.rcvr.Call(in)

24293

+ }

24294

+ } else {

24295

+ m := c.rcvr.Method(c.method)

24296

+ if c.typ.IsVariadic() {

24297

+ return m.CallSlice(in)

24298

+ } else {

24299

+ return m.Call(in)

24300

+ }

24301

+ }

24302

+}

24303

Index: libgo/go/reflect/makefuncgo_amd64.go

24304

===================================================================

24305

--- a/src/libgo/go/reflect/makefuncgo_amd64.go (.../tags/gcc_4_8_2_release)

24306

+++ b/src/libgo/go/reflect/makefuncgo_amd64.go (.../branches/gcc-4_8-branch)

24307

@@ -319,7 +319,7 @@

24308

// All the real arguments have been found and turned into

24309

// Value's. Call the real function.

24310

24311

- out := c.fn(in)

24312

+ out := c.call(in)

24313

24314

if len(out) != len(ftyp.out) {

24315

panic("reflect: wrong return count from function created by MakeFunc")

24316

Index: libgo/go/net/fd_unix.go

24317

===================================================================

24318

--- a/src/libgo/go/net/fd_unix.go (.../tags/gcc_4_8_2_release)

24319

+++ b/src/libgo/go/net/fd_unix.go (.../branches/gcc-4_8-branch)

24320

@@ -9,6 +9,7 @@

24321

import (

24322

"io"

24323

"os"

24324

+ "runtime"

24325

"sync"

24326

"syscall"

24327

"time"

24328

@@ -90,6 +91,16 @@

24329

if err == nil || err == syscall.EISCONN {

24330

break

24331

}

24332

+

24333

+ // On Solaris we can see EINVAL if the socket has

24334

+ // already been accepted and closed by the server.

24335

+ // Treat this as a successful connection--writes to

24336

+ // the socket will see EOF. For details and a test

24337

+ // case in C see http://golang.org/issue/6828.

24338

+ if runtime.GOOS == "solaris" && err == syscall.EINVAL {

24339

+ break

24340

+ }

24341

+

24342

if err != syscall.EINPROGRESS && err != syscall.EALREADY && err != syscall.EINTR {

24343

return err

24344

}

24345

Index: libgo/go/go/build/syslist.go

24346

===================================================================

24347

--- a/src/libgo/go/go/build/syslist.go (.../tags/gcc_4_8_2_release)

24348

+++ b/src/libgo/go/go/build/syslist.go (.../branches/gcc-4_8-branch)

24349

@@ -0,0 +1,8 @@

24350

24351

+// Use of this source code is governed by a BSD-style

24352

+// license that can be found in the LICENSE file.

24353

+

24354

+package build

24355

+

24356

+const goosList = "darwin dragonfly freebsd linux netbsd openbsd plan9 windows solaris "

24357

+const goarchList = "386 amd64 arm alpha m68k mipso32 mipsn32 mipsn64 mipso64 ppc ppc64 sparc sparc64 "

24358

Index: libgo/go/syscall/libcall_linux.go

24359

===================================================================

24360

--- a/src/libgo/go/syscall/libcall_linux.go (.../tags/gcc_4_8_2_release)

24361

+++ b/src/libgo/go/syscall/libcall_linux.go (.../branches/gcc-4_8-branch)

24362

@@ -190,6 +190,9 @@

24363

//sys Adjtimex(buf *Timex) (state int, err error)

24364

//adjtimex(buf *Timex) _C_int

24365

24366

+//sysnb Dup3(oldfd int, newfd int, flags int) (err error)

24367

+//dup3(oldfd _C_int, newfd _C_int, flags _C_int) _C_int

24368

+

24369

//sys Faccessat(dirfd int, path string, mode uint32, flags int) (err error)

24370

//faccessat(dirfd _C_int, pathname *byte, mode _C_int, flags _C_int) _C_int

24371

24372

@@ -268,6 +271,9 @@

24373

return origlen - len(buf), count, names

24374

}

24375

24376

+//sys Getxattr(path string, attr string, dest []byte) (sz int, err error)

24377

+//getxattr(path *byte, attr *byte, buf *byte, count Size_t) Ssize_t

24378

+

24379

//sys InotifyAddWatch(fd int, pathname string, mask uint32) (watchdesc int, err error)

24380

//inotify_add_watch(fd _C_int, pathname *byte, mask uint32) _C_int

24381

24382

@@ -283,6 +289,9 @@

24383

//sys Klogctl(typ int, buf []byte) (n int, err error)

24384

//klogctl(typ _C_int, bufp *byte, len _C_int) _C_int

24385

24386

+//sys Listxattr(path string, dest []byte) (sz int, err error)

24387

+//listxattr(path *byte, list *byte, size Size_t) Ssize_t

24388

+

24389

//sys Mkdirat(dirfd int, path string, mode uint32) (err error)

24390

//mkdirat(dirfd _C_int, path *byte, mode Mode_t) _C_int

24391

24392

@@ -305,6 +314,9 @@

24393

//sys PivotRoot(newroot string, putold string) (err error)

24394

//pivot_root(newroot *byte, putold *byte) _C_int

24395

24396

+//sys Removexattr(path string, attr string) (err error)

24397

+//removexattr(path *byte, name *byte) _C_int

24398

+

24399

//sys Renameat(olddirfd int, oldpath string, newdirfd int, newpath string) (err error)

24400

//renameat(olddirfd _C_int, oldpath *byte, newdirfd _C_int, newpath *byte) _C_int

24401

24402

@@ -338,6 +350,9 @@

24403

//sysnb Setresuid(ruid int, eguid int, suid int) (err error)

24404

//setresuid(ruid Uid_t, euid Uid_t, suid Uid_t) _C_int

24405

24406

+//sys Setxattr(path string, attr string, data []byte, flags int) (err error)

24407

+//setxattr(path *byte, name *byte, value *byte, size Size_t, flags _C_int) _C_int

24408

+

24409

//sys splice(rfd int, roff *_loff_t, wfd int, woff *_loff_t, len int, flags int) (n int64, err error)

24410

//splice(rfd _C_int, roff *_loff_t, wfd _C_int, woff *_loff_t, len Size_t, flags _C_uint) Ssize_t

24411

func Splice(rfd int, roff *int64, wfd int, woff *int64, len int, flags int) (n int64, err error) {

24412

Index: libgo/go/syscall/socket.go

24413

===================================================================

24414

--- a/src/libgo/go/syscall/socket.go (.../tags/gcc_4_8_2_release)

24415

+++ b/src/libgo/go/syscall/socket.go (.../branches/gcc-4_8-branch)

24416

@@ -25,7 +25,7 @@

24417

Pad [96]int8

24418

}

24419

24420

-const SizeofSockaddrAny = 0x1c

24421

+const SizeofSockaddrAny = 0x6c

24422

24423

type SockaddrInet4 struct {

24424

Port int

24425

Index: libgo/go/syscall/libcall_posix.go

24426

===================================================================

24427

--- a/src/libgo/go/syscall/libcall_posix.go (.../tags/gcc_4_8_2_release)

24428

+++ b/src/libgo/go/syscall/libcall_posix.go (.../branches/gcc-4_8-branch)

24429

@@ -238,6 +238,9 @@

24430

//sysnb Getppid() (ppid int)

24431

//getppid() Pid_t

24432

24433

+//sys Getpriority(which int, who int) (prio int, err error)

24434

+//getpriority(which _C_int, who _C_int) _C_int

24435

+

24436

//sysnb Getrlimit(resource int, rlim *Rlimit) (err error)

24437

//getrlimit(resource _C_int, rlim *Rlimit) _C_int

24438

24439

@@ -307,6 +310,9 @@

24440

//sysnb Setpgid(pid int, pgid int) (err error)

24441

//setpgid(pid Pid_t, pgid Pid_t) _C_int

24442

24443

+//sys Setpriority(which int, who int, prio int) (err error)

24444

+//setpriority(which _C_int, who _C_int, prio _C_int) _C_int

24445

+

24446

//sysnb Setreuid(ruid int, euid int) (err error)

24447

//setreuid(ruid Uid_t, euid Uid_t) _C_int

24448

24449

Index: libgo/Makefile.am

24450

===================================================================

24451

--- a/src/libgo/Makefile.am (.../tags/gcc_4_8_2_release)

24452

+++ b/src/libgo/Makefile.am (.../branches/gcc-4_8-branch)

24453

@@ -424,6 +424,7 @@

24454

runtime/go-caller.c \

24455

runtime/go-callers.c \

24456

runtime/go-can-convert-interface.c \

24457

+ runtime/go-cdiv.c \

24458

runtime/go-cgo.c \

24459

runtime/go-check-interface.c \

24460

runtime/go-construct-map.c \

24461

@@ -1254,7 +1255,7 @@

24462

go/go/build/build.go \

24463

go/go/build/doc.go \

24464

go/go/build/read.go \

24465

- syslist.go

24466

+ go/go/build/syslist.go

24467

go_go_doc_files = \

24468

go/go/doc/comment.go \

24469

go/go/doc/doc.go \

24470

@@ -2712,15 +2713,6 @@

24471

@$(CHECK)

24472

.PHONY: go/build/check

24473

24474

-syslist.go: s-syslist; @true

24475

-s-syslist: Makefile

24476

- echo '// Generated automatically by make.' >syslist.go.tmp

24477

- echo 'package build' >>syslist.go.tmp

24478

- echo 'const goosList = "$(GOOS)"' >>syslist.go.tmp

24479

- echo 'const goarchList = "$(GOARCH)"' >>syslist.go.tmp

24480

- $(SHELL) $(srcdir)/../move-if-change syslist.go.tmp syslist.go

24481

- $(STAMP) $@

24482

-

24483

@go_include@ go/doc.lo.dep

24484

go/doc.lo.dep: $(go_go_doc_files)

24485

$(BUILDDEPS)

24486

Index: libcpp/po/pt_BR.po

24487

===================================================================

24488

--- a/src/libcpp/po/pt_BR.po (.../tags/gcc_4_8_2_release)

24489

+++ b/src/libcpp/po/pt_BR.po (.../branches/gcc-4_8-branch)

24490

@@ -0,0 +1,908 @@

24491

+# Brazilian Portuguese translation for cpplib

24492

24493

+# This file is distributed under the same license as the gcc package.

24494

+# Rafael Ferreira <rafael.f.f1@gmail.com>, 2013.

24495

+#

24496

+msgid ""

24497

+msgstr ""

24498

+"Project-Id-Version: cpplib 4.8.0\n"

24499

+"Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"

24500

+"POT-Creation-Date: 2013-03-15 17:42+0000\n"

24501

+"PO-Revision-Date: 2013-12-18 03:12-0300\n"

24502

+"Last-Translator: Rafael Ferreira <rafael.f.f1@gmail.com>\n"

24503

+"Language-Team: Brazilian Portuguese <ldpbr-translation@lists.sourceforge.net>\n"

24504

+"Language: pt_BR\n"

24505

+"MIME-Version: 1.0\n"

24506

+"Content-Type: text/plain; charset=UTF-8\n"

24507

+"Content-Transfer-Encoding: 8bit\n"

24508

+"X-Generator: Poedit 1.5.7\n"

24509

+"Plural-Forms: nplurals=2; plural=(n > 1);\n"

24510

+

24511

+#: charset.c:673

24512

+#, c-format

24513

+msgid "conversion from %s to %s not supported by iconv"

24514

+msgstr "sem suporte a conversão de %s para %s por iconv"

24515

+

24516

+#: charset.c:676

24517

+msgid "iconv_open"

24518

+msgstr "iconv_open"

24519

+

24520

+#: charset.c:684

24521

+#, c-format

24522

+msgid "no iconv implementation, cannot convert from %s to %s"

24523

+msgstr "nenhuma implementação iconv, não foi possível converter de %s para %s"

24524

+

24525

+#: charset.c:780

24526

+#, c-format

24527

+msgid "character 0x%lx is not in the basic source character set\n"

24528

+msgstr "caractere 0x%lx não está no conjunto de caracteres fonte básico\n"

24529

+

24530

+#: charset.c:797 charset.c:1443

24531

+msgid "converting to execution character set"

24532

+msgstr "convertendo para conjunto de caracteres da execução"

24533

+

24534

+#: charset.c:803

24535

+#, c-format

24536

+msgid "character 0x%lx is not unibyte in execution character set"

24537

+msgstr "caractere 0x%lx não é unibyte no conjunto de caracteres de execução"

24538

+

24539

+#: charset.c:927

24540

+#, c-format

24541

+msgid "Character %x might not be NFKC"

24542

+msgstr "Caractere %x pode não ser NFKC"

24543

+

24544

+#: charset.c:993

24545

+msgid "universal character names are only valid in C++ and C99"

24546

+msgstr "nomes de caractere universais são válidos apenas em C++ e C99"

24547

+

24548

+#: charset.c:996

24549

+#, c-format

24550

+msgid "the meaning of '\\%c' is different in traditional C"

24551

+msgstr "o significado de \"\\%c\" é diferente em C tradicional"

24552

+

24553

+#: charset.c:1005

24554

+msgid "In _cpp_valid_ucn but not a UCN"

24555

+msgstr "Em _cpp_valid_ucn, mas não é um UCN"

24556

+

24557

+#: charset.c:1030

24558

+#, c-format

24559

+msgid "incomplete universal character name %.*s"

24560

+msgstr "nome de caractere universal incompleto %.*s"

24561

+

24562

+#: charset.c:1045

24563

+#, c-format

24564

+msgid "%.*s is not a valid universal character"

24565

+msgstr "%.*s não é um caractere universal válido"

24566

+

24567

+#: charset.c:1055 lex.c:1117

24568

+msgid "'$' in identifier or number"

24569

+msgstr "\"$\" em identificador ou número"

24570

+

24571

+#: charset.c:1065

24572

+#, c-format

24573

+msgid "universal character %.*s is not valid in an identifier"

24574

+msgstr "caractere universal %.*s não é válido em um identificador"

24575

+

24576

+#: charset.c:1069

24577

+#, c-format

24578

+msgid "universal character %.*s is not valid at the start of an identifier"

24579

+msgstr "caractere universal %.*s não é válido no começo de um identificador"

24580

+

24581

+#: charset.c:1101 charset.c:1673

24582

+msgid "converting UCN to source character set"

24583

+msgstr "convertendo UCN para conjunto de caracteres fonte"

24584

+

24585

+#: charset.c:1105

24586

+msgid "converting UCN to execution character set"

24587

+msgstr "convertendo UCN para conjunto de caracteres de execução"

24588

+

24589

+#: charset.c:1177

24590

+msgid "the meaning of '\\x' is different in traditional C"

24591

+msgstr "o significado de \"\\x\" é diferente em C tradicional"

24592

+

24593

+#: charset.c:1194

24594

+msgid "\\x used with no following hex digits"

24595

+msgstr "\\x usado com nenhum dígito hexa"

24596

+

24597

+#: charset.c:1201

24598

+msgid "hex escape sequence out of range"

24599

+msgstr "sequência de escape hexa fora de alcance"

24600

+

24601

+#: charset.c:1239

24602

+msgid "octal escape sequence out of range"

24603

+msgstr "sequência de escape octal fora de alcance"

24604

+

24605

+#: charset.c:1305

24606

+msgid "the meaning of '\\a' is different in traditional C"

24607

+msgstr "o significado de \"\\a\" é diferente em C tradicional"

24608

+

24609

+#: charset.c:1312

24610

+#, c-format

24611

+msgid "non-ISO-standard escape sequence, '\\%c'"

24612

+msgstr "sequência de escape não padrão ISO, \"\\%c\""

24613

+

24614

+#: charset.c:1320

24615

+#, c-format

24616

+msgid "unknown escape sequence: '\\%c'"

24617

+msgstr "sequência de escape desconhecida: \"\\%c\""

24618

+

24619

+#: charset.c:1328

24620

+#, c-format

24621

+msgid "unknown escape sequence: '\\%s'"

24622

+msgstr "sequência de escape desconhecida: \"\\%s\""

24623

+

24624

+#: charset.c:1335

24625

+msgid "converting escape sequence to execution character set"

24626

+msgstr "convertendo sequência de escape para conjunto de caracteres de execução"

24627

+

24628

+#: charset.c:1508 charset.c:1572

24629

+msgid "character constant too long for its type"

24630

+msgstr "constante caractere muito longa para seu tipo"

24631

+

24632

+#: charset.c:1511

24633

+msgid "multi-character character constant"

24634

+msgstr "constante de caractere multi-caractere"

24635

+

24636

+#: charset.c:1611

24637

+msgid "empty character constant"

24638

+msgstr "constante caractere vazia"

24639

+

24640

+#: charset.c:1720

24641

+#, c-format

24642

+msgid "failure to convert %s to %s"

24643

+msgstr "falha ao converter %s para %s"

24644

+

24645

+#: directives.c:224 directives.c:250

24646

+#, c-format

24647

+msgid "extra tokens at end of #%s directive"

24648

+msgstr "tokens extras ao final da diretiva %#s"

24649

+

24650

+#: directives.c:357

24651

+#, c-format

24652

+msgid "#%s is a GCC extension"

24653

+msgstr "#%s é uma extensão GCC"

24654

+

24655

+#: directives.c:362

24656

+#, c-format

24657

+msgid "#%s is a deprecated GCC extension"

24658

+msgstr "#%s é uma extensão GCC obsoleta"

24659

+

24660

+#: directives.c:375

24661

+msgid "suggest not using #elif in traditional C"

24662

+msgstr "sugere-se não usar #elif em C tradicional"

24663

+

24664

+#: directives.c:378

24665

+#, c-format

24666

+msgid "traditional C ignores #%s with the # indented"

24667

+msgstr "C tradicional ignora #%s com o # com recuo"

24668

+

24669

+#: directives.c:382

24670

+#, c-format

24671

+msgid "suggest hiding #%s from traditional C with an indented #"

24672

+msgstr "sugere-se ocultar #%s do C tradicional com um # com recuo"

24673

+

24674

+#: directives.c:408

24675

+msgid "embedding a directive within macro arguments is not portable"

24676

+msgstr "embutir uma diretiva dentro de argumentos macro não é portátil"

24677

+

24678

+#: directives.c:428

24679

+msgid "style of line directive is a GCC extension"

24680

+msgstr "estilo de diretiva de linha é uma extensão GCC"

24681

+

24682

+#: directives.c:483

24683

+#, c-format

24684

+msgid "invalid preprocessing directive #%s"

24685

+msgstr "diretiva de preprocessamento inválida #%s"

24686

+

24687

+#: directives.c:551

24688

+msgid "\"defined\" cannot be used as a macro name"

24689

+msgstr "\"defined\" não pode ser usado como um nome de macro"

24690

+

24691

+#: directives.c:557

24692

+#, c-format

24693

+msgid "\"%s\" cannot be used as a macro name as it is an operator in C++"

24694

+msgstr "\"%s\" não pode ser usado como um nome de macro, pois é um operador em C++"

24695

+

24696

+#: directives.c:560

24697

+#, c-format

24698

+msgid "no macro name given in #%s directive"

24699

+msgstr "nenhum nome de macro fornecido na diretiva #%s"

24700

+

24701

+#: directives.c:563

24702

+msgid "macro names must be identifiers"

24703

+msgstr "nomes de macro devem ser identificadores"

24704

+

24705

+#: directives.c:612

24706

+#, c-format

24707

+msgid "undefining \"%s\""

24708

+msgstr "removendo definição de \"%s\""

24709

+

24710

+#: directives.c:667

24711

+msgid "missing terminating > character"

24712

+msgstr "faltando caractere terminador >"

24713

+

24714

+#: directives.c:726

24715

+#, c-format

24716

+msgid "#%s expects \"FILENAME\" or <FILENAME>"

24717

+msgstr "#%s espera \"NOME DE ARQUIVO\" OU <NOME DE ARQUIVO>"

24718

+

24719

+#: directives.c:772

24720

+#, c-format

24721

+msgid "empty filename in #%s"

24722

+msgstr "nome de arquivo vazio em #%s"

24723

+

24724

+#: directives.c:782

24725

+msgid "#include nested too deeply"

24726

+msgstr "#include aninhado profundo demais"

24727

+

24728

+#: directives.c:823

24729

+msgid "#include_next in primary source file"

24730

+msgstr "#include_next no arquivo fonte primário"

24731

+

24732

+#: directives.c:849

24733

+#, c-format

24734

+msgid "invalid flag \"%s\" in line directive"

24735

+msgstr "opção inválida \"%s\" na diretiva line"

24736

+

24737

+#: directives.c:909

24738

+msgid "unexpected end of file after #line"

24739

+msgstr "fim de arquivo inesperado após #line"

24740

+

24741

+#: directives.c:912

24742

+#, c-format

24743

+msgid "\"%s\" after #line is not a positive integer"

24744

+msgstr "\"%s\" após #line não é um inteiro positivo"

24745

+

24746

+#: directives.c:918 directives.c:920

24747

+msgid "line number out of range"

24748

+msgstr "número da linha fora de alcance"

24749

+

24750

+#: directives.c:933 directives.c:1013

24751

+#, c-format

24752

+msgid "\"%s\" is not a valid filename"

24753

+msgstr "\"%s\" não é um nome de arquivo válido"

24754

+

24755

+#: directives.c:973

24756

+#, c-format

24757

+msgid "\"%s\" after # is not a positive integer"

24758

+msgstr "\"%s\" após # não é um inteiro positivo"

24759

+

24760

+#: directives.c:1068 directives.c:1070 directives.c:1072 directives.c:1658

24761

+#, c-format

24762

+msgid "%s"

24763

+msgstr "%s"

24764

+

24765

+#: directives.c:1096

24766

+#, c-format

24767

+msgid "invalid #%s directive"

24768

+msgstr "diretiva inválida #%s"

24769

+

24770

+#: directives.c:1159

24771

+#, c-format

24772

+msgid "registering pragmas in namespace \"%s\" with mismatched name expansion"

24773

+msgstr "registrando pragmas em espaço de nomes \"%s\" com expansão de nome incompatível"

24774

+

24775

+#: directives.c:1168

24776

+#, c-format

24777

+msgid "registering pragma \"%s\" with name expansion and no namespace"

24778

+msgstr "registrando pragma \"%s\" com expansão de nome e nenhum espaço de nomes"

24779

+

24780

+#: directives.c:1186

24781

+#, c-format

24782

+msgid "registering \"%s\" as both a pragma and a pragma namespace"

24783

+msgstr "registrando \"%s\" como tanto um pragma e um espaço de nomes de pragma"

24784

+

24785

+#: directives.c:1189

24786

+#, c-format

24787

+msgid "#pragma %s %s is already registered"

24788

+msgstr "#pragma %s %s já está registrado"

24789

+

24790

+#: directives.c:1192

24791

+#, c-format

24792

+msgid "#pragma %s is already registered"

24793

+msgstr "#pragma %s já está registrado"

24794

+

24795

+#: directives.c:1222

24796

+msgid "registering pragma with NULL handler"

24797

+msgstr "registrando pragma com manipulador NULO"

24798

+

24799

+#: directives.c:1439

24800

+msgid "#pragma once in main file"

24801

+msgstr "#pragma ocorre uma vez no arquivo principal"

24802

+

24803

+#: directives.c:1462

24804

+msgid "invalid #pragma push_macro directive"

24805

+msgstr "diretiva inválida #pragma push_macro"

24806

+

24807

+#: directives.c:1517

24808

+msgid "invalid #pragma pop_macro directive"

24809

+msgstr "diretiva inválida #pragma pop_macro"

24810

+

24811

+#: directives.c:1572

24812

+msgid "invalid #pragma GCC poison directive"

24813

+msgstr "diretiva inválida #pragma GCC poison"

24814

+

24815

+#: directives.c:1581

24816

+#, c-format

24817

+msgid "poisoning existing macro \"%s\""

24818

+msgstr "envenenando macro existente \"%s\""

24819

+

24820

+#: directives.c:1600

24821

+msgid "#pragma system_header ignored outside include file"

24822

+msgstr "#pragma system_header ignorado fora do arquivo include"

24823

+

24824

+#: directives.c:1625

24825

+#, c-format

24826

+msgid "cannot find source file %s"

24827

+msgstr "não foi possível localizar o arquivo fonte %s"

24828

+

24829

+#: directives.c:1629

24830

+#, c-format

24831

+msgid "current file is older than %s"

24832

+msgstr "arquivo atual é mais velho do que %s"

24833

+

24834

+#: directives.c:1653

24835

+#, c-format

24836

+msgid "invalid \"#pragma GCC %s\" directive"

24837

+msgstr "diretiva inválida \"#pragma GCC %s\""

24838

+

24839

+#: directives.c:1847

24840

+msgid "_Pragma takes a parenthesized string literal"

24841

+msgstr "_Pragma leva uma literal de string entre parenteses"

24842

+

24843

+#: directives.c:1968

24844

+msgid "#else without #if"

24845

+msgstr "#else sem #if"

24846

+

24847

+#: directives.c:1973

24848

+msgid "#else after #else"

24849

+msgstr "#else após #else"

24850

+

24851

+#: directives.c:1975 directives.c:2008

24852

+msgid "the conditional began here"

24853

+msgstr "a condicional começou aqui"

24854

+

24855

+#: directives.c:2001

24856

+msgid "#elif without #if"

24857

+msgstr "#elif sem #if"

24858

+

24859

+#: directives.c:2006

24860

+msgid "#elif after #else"

24861

+msgstr "#elif após #else"

24862

+

24863

+#: directives.c:2044

24864

+msgid "#endif without #if"

24865

+msgstr "#endif sem #if"

24866

+

24867

+#: directives.c:2124

24868

+msgid "missing '(' after predicate"

24869

+msgstr "faltando \"(\" após predicado"

24870

+

24871

+#: directives.c:2139

24872

+msgid "missing ')' to complete answer"

24873

+msgstr "faltando \")\" para uma resposta completa"

24874

+

24875

+#: directives.c:2159

24876

+msgid "predicate's answer is empty"

24877

+msgstr "resposta do predicado está vazia"

24878

+

24879

+#: directives.c:2186

24880

+msgid "assertion without predicate"

24881

+msgstr "asserção sem predicado"

24882

+

24883

+#: directives.c:2189

24884

+msgid "predicate must be an identifier"

24885

+msgstr "predicado deve ser um identificador"

24886

+

24887

+#: directives.c:2275

24888

+#, c-format

24889

+msgid "\"%s\" re-asserted"

24890

+msgstr "\"%s\" re-assertado"

24891

+

24892

+#: directives.c:2567

24893

+#, c-format

24894

+msgid "unterminated #%s"

24895

+msgstr "#%s não terminado"

24896

+

24897

+#: directives-only.c:221 lex.c:2234 traditional.c:162

24898

+msgid "unterminated comment"

24899

+msgstr "comentário não terminado"

24900

+

24901

+#: errors.c:234

24902

+msgid "stdout"

24903

+msgstr "saída padrão"

24904

+

24905

+#: errors.c:236

24906

+#, c-format

24907

+msgid "%s: %s"

24908

+msgstr "%s: %s"

24909

+

24910

+#: expr.c:479 expr.c:577

24911

+msgid "fixed-point constants are a GCC extension"

24912

+msgstr "constantes de ponto fixo (fixed-point constants) é uma extensão GCC"

24913

+

24914

+#: expr.c:504

24915

+msgid "invalid prefix \"0b\" for floating constant"

24916

+msgstr "prefixo inválido \"0b\" para constante flutuante"

24917

+

24918

+#: expr.c:514

24919

+msgid "use of C99 hexadecimal floating constant"

24920

+msgstr "uso de constante flutuante hexadecimal de C99"

24921

+

24922

+#: expr.c:545

24923

+#, c-format

24924

+msgid "invalid suffix \"%.*s\" on floating constant"

24925

+msgstr "sufixo inválido \"%.*s\" na constante flutuante"

24926

+

24927

+#: expr.c:556 expr.c:616

24928

+#, c-format

24929

+msgid "traditional C rejects the \"%.*s\" suffix"

24930

+msgstr "C tradicional rejeita o sufixo \"%.*s\""

24931

+

24932

+#: expr.c:564

24933

+msgid "suffix for double constant is a GCC extension"

24934

+msgstr "sufixo para constante dupla (suffix for double constant) é uma extensão GCC"

24935

+

24936

+#: expr.c:570

24937

+#, c-format

24938

+msgid "invalid suffix \"%.*s\" with hexadecimal floating constant"

24939

+msgstr "sufixo inválido \"%.*s\" com constante flutuante hexadecimal"

24940

+

24941

+#: expr.c:581

24942

+msgid "decimal float constants are a GCC extension"

24943

+msgstr "constantes flutuante decimais (decimal float constants) é uma extensão GCC"

24944

+

24945

+#: expr.c:599

24946

+#, c-format

24947

+msgid "invalid suffix \"%.*s\" on integer constant"

24948

+msgstr "sufixo inválido \"%.*s\" em constante inteiro"

24949

+

24950

+#: expr.c:624

24951

+msgid "use of C++0x long long integer constant"

24952

+msgstr "uso de constante longo longo inteiro de C++0x"

24953

+

24954

+#: expr.c:625

24955

+msgid "use of C99 long long integer constant"

24956

+msgstr "uso de constante longo longo inteiro de C99"

24957

+

24958

+#: expr.c:641

24959

+msgid "imaginary constants are a GCC extension"

24960

+msgstr "constantes imaginárias (imaginary constants) é uma extensão GCC"

24961

+

24962

+#: expr.c:644

24963

+msgid "binary constants are a GCC extension"

24964

+msgstr "constantes binárias (binary constants) é uma extensão GCC"

24965

+

24966

+#: expr.c:737

24967

+msgid "integer constant is too large for its type"

24968

+msgstr "constante inteira é muito grande para seu tipo"

24969

+

24970

+#: expr.c:768

24971

+msgid "integer constant is so large that it is unsigned"

24972

+msgstr "constante inteira é tão grande que não está assinada"

24973

+

24974

+#: expr.c:863

24975

+msgid "missing ')' after \"defined\""

24976

+msgstr "faltando \")\" após \"defined\""

24977

+

24978

+#: expr.c:870

24979

+msgid "operator \"defined\" requires an identifier"

24980

+msgstr "operador \"defined\" requer um identificador"

24981

+

24982

+#: expr.c:878

24983

+#, c-format

24984

+msgid "(\"%s\" is an alternative token for \"%s\" in C++)"

24985

+msgstr "(\"%s\" é um token alternativo para \"%s\" em C++)"

24986

+

24987

+#: expr.c:888

24988

+msgid "this use of \"defined\" may not be portable"

24989

+msgstr "esse uso de \"defined\" pode não ser portátil"

24990

+

24991

+#: expr.c:948

24992

+msgid "user-defined literal in preprocessor expression"

24993

+msgstr "literal definida pelo usuário em expressão do preprocessador"

24994

+

24995

+#: expr.c:953

24996

+msgid "floating constant in preprocessor expression"

24997

+msgstr "constante flutuante em expressão do preprocessador"

24998

+

24999

+#: expr.c:959

25000

+msgid "imaginary number in preprocessor expression"

25001

+msgstr "número imaginário em expressão do preprocessador"

25002

+

25003

+#: expr.c:1007

25004

+#, c-format

25005

+msgid "\"%s\" is not defined"

25006

+msgstr "\"%s\" não está definido"

25007

+

25008

+#: expr.c:1020

25009

+msgid "assertions are a GCC extension"

25010

+msgstr "asserções (assertions) é uma extensão GCC"

25011

+

25012

+#: expr.c:1023

25013

+msgid "assertions are a deprecated extension"

25014

+msgstr "asserções (assertions) é uma extensão obsoleta"

25015

+

25016

+#: expr.c:1268

25017

+#, c-format

25018

+msgid "unbalanced stack in %s"

25019

+msgstr "pilha não balanceada em %s"

25020

+

25021

+#: expr.c:1288

25022

+#, c-format

25023

+msgid "impossible operator '%u'"

25024

+msgstr "operador impossível \"%u\""

25025

+

25026

+#: expr.c:1389

25027

+msgid "missing ')' in expression"

25028

+msgstr "faltando \")\" na expressão"

25029

+

25030

+#: expr.c:1418

25031

+msgid "'?' without following ':'"

25032

+msgstr "\"?\" sem estar seguido por \":\""

25033

+

25034

+#: expr.c:1428

25035

+msgid "integer overflow in preprocessor expression"

25036

+msgstr "estouro de inteiro em expressão do preprocessador"

25037

+

25038

+#: expr.c:1433

25039

+msgid "missing '(' in expression"

25040

+msgstr "faltando \"(\" na expressão"

25041

+

25042

+#: expr.c:1465

25043

+#, c-format

25044

+msgid "the left operand of \"%s\" changes sign when promoted"

25045

+msgstr "o operador à esquerda de \"%s\" altera o sinal quando promovido"

25046

+

25047

+#: expr.c:1470

25048

+#, c-format

25049

+msgid "the right operand of \"%s\" changes sign when promoted"

25050

+msgstr "o operador à direita de \"%s\" altera o sinal quando promovido"

25051

+

25052

+#: expr.c:1729

25053

+msgid "traditional C rejects the unary plus operator"

25054

+msgstr "C tradicional rejeita o operador unário mais"

25055

+

25056

+#: expr.c:1812

25057

+msgid "comma operator in operand of #if"

25058

+msgstr "operador vírgula em operando de #if"

25059

+

25060

+#: expr.c:1948

25061

+msgid "division by zero in #if"

25062

+msgstr "divisão por zero em #if"

25063

+

25064

+#: files.c:505

25065

+msgid "NULL directory in find_file"

25066

+msgstr "diretório NULO em find_file"

25067

+

25068

+#: files.c:553

25069

+msgid "one or more PCH files were found, but they were invalid"

25070

+msgstr "um ou mais arquivos PCH foram encontrados, mas são inválidos"

25071

+

25072

+#: files.c:556

25073

+msgid "use -Winvalid-pch for more information"

25074

+msgstr "use -Winvalid-pch para mais informações"

25075

+

25076

+#: files.c:660

25077

+#, c-format

25078

+msgid "%s is a block device"

25079

+msgstr "%s é um dispositivo de bloco"

25080

+

25081

+#: files.c:677

25082

+#, c-format

25083

+msgid "%s is too large"

25084

+msgstr "%s é muito grande"

25085

+

25086

+#: files.c:717

25087

+#, c-format

25088

+msgid "%s is shorter than expected"

25089

+msgstr "%s é muito menor do que esperado"

25090

+

25091

+#: files.c:953

25092

+#, c-format

25093

+msgid "no include path in which to search for %s"

25094

+msgstr "não foi incluído nenhum caminho no qual se possa procurar por %s"

25095

+

25096

+#: files.c:1381

25097

+msgid "Multiple include guards may be useful for:\n"

25098

+msgstr "Múltiplos include guards podem ser úteis para:\n"

25099

+

25100

+#: init.c:524

25101

+msgid "cppchar_t must be an unsigned type"

25102

+msgstr "cppchar_t deve ser um tipo não assinado"

25103

+

25104

+#: init.c:528

25105

+#, c-format

25106

+msgid "preprocessor arithmetic has maximum precision of %lu bits; target requires %lu bits"

25107

+msgstr "aritmética do preprocessador possui uma precisão máxima de %lu bits; o alvo requer %lu bits"

25108

+

25109

+#: init.c:535

25110

+msgid "CPP arithmetic must be at least as precise as a target int"

25111

+msgstr "aritmética do CPP deve ser pelo menos tão precisa quanto um int alvo"

25112

+

25113

+#: init.c:538

25114

+msgid "target char is less than 8 bits wide"

25115

+msgstr "char alvo é menor do que 8 bits"

25116

+

25117

+#: init.c:542

25118

+msgid "target wchar_t is narrower than target char"

25119

+msgstr "wchar_t alvo é mais estreito do que o char alvo"

25120

+

25121

+#: init.c:546

25122

+msgid "target int is narrower than target char"

25123

+msgstr "int alvo é mais estreito do que o char alvo"

25124

+

25125

+#: init.c:551

25126

+msgid "CPP half-integer narrower than CPP character"

25127

+msgstr "meio-inteiro do CPP é mais estreito do que o caractere do CPP"

25128

+

25129

+#: init.c:555

25130

+#, c-format

25131

+msgid "CPP on this host cannot handle wide character constants over %lu bits, but the target requires %lu bits"

25132

+msgstr "CPP nesta máquina não consegue manipular constantes de wide character acima de %lu bits, mas o alvo requer %lu bits"

25133

+

25134

+#: lex.c:910

25135

+msgid "backslash and newline separated by space"

25136

+msgstr "barra invertida e nova linha separadas por espaço"

25137

+

25138

+#: lex.c:915

25139

+msgid "backslash-newline at end of file"

25140

+msgstr "barra invertida e nova linha no final do arquivo"

25141

+

25142

+#: lex.c:931

25143

+#, c-format

25144

+msgid "trigraph ??%c converted to %c"

25145

+msgstr "trígrafo ??%c convertido para %c"

25146

+

25147

+#: lex.c:939

25148

+#, c-format

25149

+msgid "trigraph ??%c ignored, use -trigraphs to enable"

25150

+msgstr "trígrafo ??%c ignorado, use -trigraphs para habilitá-lo"

25151

+

25152

+#: lex.c:988

25153

+msgid "\"/*\" within comment"

25154

+msgstr "\"/*\" dentro de comentário"

25155

+

25156

+#: lex.c:1046

25157

+#, c-format

25158

+msgid "%s in preprocessing directive"

25159

+msgstr "%s em diretiva de preprocessamento"

25160

+

25161

+#: lex.c:1055

25162

+msgid "null character(s) ignored"

25163

+msgstr "um ou mais caracteres nulos ignorados"

25164

+

25165

+#: lex.c:1092

25166

+#, c-format

25167

+msgid "`%.*s' is not in NFKC"

25168

+msgstr "\"%.*s\" não está em NFKC"

25169

+

25170

+#: lex.c:1095

25171

+#, c-format

25172

+msgid "`%.*s' is not in NFC"

25173

+msgstr "\"%.*s\" não está em NFC"

25174

+

25175

+#: lex.c:1164 lex.c:1241

25176

+#, c-format

25177

+msgid "attempt to use poisoned \"%s\""

25178

+msgstr "tentativa de usar \"%s\" envenenado"

25179

+

25180

+#: lex.c:1172 lex.c:1249

25181

+msgid "__VA_ARGS__ can only appear in the expansion of a C99 variadic macro"

25182

+msgstr "__VA_ARGS__ pode aparecer apenas na expansão de uma macro variádica C99"

25183

+

25184

+#: lex.c:1178 lex.c:1255

25185

+#, c-format

25186

+msgid "identifier \"%s\" is a special operator name in C++"

25187

+msgstr "identificador \"%s\" é o nome de um operador especial em C++"

25188

+

25189

+#: lex.c:1399

25190

+msgid "raw string delimiter longer than 16 characters"

25191

+msgstr "delimitador de string não tratada (raw) maior do que 16 caracteres"

25192

+

25193

+#: lex.c:1402

25194

+#, c-format

25195

+msgid "invalid character '%c' in raw string delimiter"

25196

+msgstr "caractere inválido \"%c\" em delimitador de string não tratada (raw)"

25197

+

25198

+#: lex.c:1525 lex.c:1547

25199

+msgid "unterminated raw string"

25200

+msgstr "string não tratada (raw) não terminada"

25201

+

25202

+#: lex.c:1573 lex.c:1706

25203

+msgid "invalid suffix on literal; C++11 requires a space between literal and identifier"

25204

+msgstr "sufixo inválido em literal; C++11 requer um espaço entre literal e identificador"

25205

+

25206

+#: lex.c:1684

25207

+msgid "null character(s) preserved in literal"

25208

+msgstr "um ou mais caracteres nulos preservados em literal"

25209

+

25210

+#: lex.c:1687

25211

+#, c-format

25212

+msgid "missing terminating %c character"

25213

+msgstr "faltando o caractere de terminação %c"

25214

+

25215

+#: lex.c:2245

25216

+msgid "C++ style comments are not allowed in ISO C90"

25217

+msgstr "comentários no estilo C++ não são permitidos em ISO C90"

25218

+

25219

+#: lex.c:2247

25220

+msgid "(this will be reported only once per input file)"

25221

+msgstr "(isso será relatado apenas uma vez por arquivo de entrada)"

25222

+

25223

+#: lex.c:2252

25224

+msgid "multi-line comment"

25225

+msgstr "comentário multilinha"

25226

+

25227

+#: lex.c:2583

25228

+#, c-format

25229

+msgid "unspellable token %s"

25230

+msgstr "token %s impronunciável"

25231

+

25232

+#: macro.c:191

25233

+#, c-format

25234

+msgid "macro \"%s\" is not used"

25235

+msgstr "macro \"%s\" não é usada"

25236

+

25237

+#: macro.c:229 macro.c:426

25238

+#, c-format

25239

+msgid "invalid built-in macro \"%s\""

25240

+msgstr "macro interna inválida \"%s\""

25241

+

25242

+#: macro.c:263

25243

+msgid "could not determine file timestamp"

25244

+msgstr "não foi possível determinar o arquivo de marca de tempo"

25245

+

25246

+#: macro.c:361

25247

+msgid "could not determine date and time"

25248

+msgstr "não foi possível determinar a data e a hora"

25249

+

25250

+#: macro.c:377

25251

+msgid "__COUNTER__ expanded inside directive with -fdirectives-only"

25252

+msgstr "__COUNTER__ expandido dentro diretiva com -fdirectives-only"

25253

+

25254

+#: macro.c:535

25255

+msgid "invalid string literal, ignoring final '\\'"

25256

+msgstr "literal de string inválida, ignorando final \"\\\""

25257

+

25258

+#: macro.c:597

25259

+#, c-format

25260

+msgid "pasting \"%s\" and \"%s\" does not give a valid preprocessing token"

25261

+msgstr "colar \"%s\" em \"%s\" não resulta em nenhum token de preprocessamento válido"

25262

+

25263

+#: macro.c:719

25264

+msgid "ISO C99 requires rest arguments to be used"

25265

+msgstr "ISO C99 requer que argumentos restantes sejam usados"

25266

+

25267

+#: macro.c:724

25268

+#, c-format

25269

+msgid "macro \"%s\" requires %u arguments, but only %u given"

25270

+msgstr "macro \"%s\" requer %u argumentos, mas apenas %u foram fornecidos"

25271

+

25272

+#: macro.c:729

25273

+#, c-format

25274

+msgid "macro \"%s\" passed %u arguments, but takes just %u"

25275

+msgstr "macro \"%s\" passou %u argumentos, mas usa apenas %u"

25276

+

25277

+#: macro.c:923 traditional.c:680

25278

+#, c-format

25279

+msgid "unterminated argument list invoking macro \"%s\""

25280

+msgstr "lista de argumentos interminável chamando macro \"%s\""

25281

+

25282

+#: macro.c:1074

25283

+#, c-format

25284

+msgid "function-like macro \"%s\" must be used with arguments in traditional C"

25285

+msgstr "macro \"%s\" do tipo função deve ser usada com argumento em C tradicional"

25286

+

25287

+# http://gcc.gnu.org/bugzilla/show_bug.cgi?id=33305

25288

+#: macro.c:1746

25289

+#, c-format

25290

+msgid "invoking macro %s argument %d: empty macro arguments are undefined in ISO C90 and ISO C++98"

25291

+msgstr "chamando macro %s argumento %d: argumentos de macro vazios estão indefinidos em ISO C90 e ISO C++98"

25292

+

25293

+#: macro.c:2708

25294

+#, c-format

25295

+msgid "duplicate macro parameter \"%s\""

25296

+msgstr "parâmetro de macro \"%s\" duplicado"

25297

+

25298

+#: macro.c:2754

25299

+#, c-format

25300

+msgid "\"%s\" may not appear in macro parameter list"

25301

+msgstr "\"%s\" não pode aparecer na lista de parâmetros de macro"

25302

+

25303

+#: macro.c:2762

25304

+msgid "macro parameters must be comma-separated"

25305

+msgstr "parâmetros de macro devem ser separados por vírgula"

25306

+

25307

+#: macro.c:2779

25308

+msgid "parameter name missing"

25309

+msgstr "faltando nome de parâmetro"

25310

+

25311

+#: macro.c:2797

25312

+msgid "anonymous variadic macros were introduced in C99"

25313

+msgstr "macros variádicas anônimas foram introduzidas em C99"

25314

+

25315

+#: macro.c:2802

25316

+msgid "ISO C does not permit named variadic macros"

25317

+msgstr "ISO C não permite macros variádicas nomeadas"

25318

+

25319

+#: macro.c:2811

25320

+msgid "missing ')' in macro parameter list"

25321

+msgstr "faltando \")\" na lista de parâmetros de macro"

25322

+

25323

+#: macro.c:2860

25324

+msgid "'##' cannot appear at either end of a macro expansion"

25325

+msgstr "\"##\" não pode aparecer no final da expansão de macro"

25326

+

25327

+#: macro.c:2895

25328

+msgid "ISO C99 requires whitespace after the macro name"

25329

+msgstr "ISO C99 requer espaço em branco após o nome de macro"

25330

+

25331

+#: macro.c:2919

25332

+msgid "missing whitespace after the macro name"

25333

+msgstr "faltando espaço em branco após o nome de macro"

25334

+

25335

+#: macro.c:2953

25336

+msgid "'#' is not followed by a macro parameter"

25337

+msgstr "\"#\" não está seguido por um parâmetro de macro"

25338

+

25339

+#: macro.c:3111

25340

+#, c-format

25341

+msgid "\"%s\" redefined"

25342

+msgstr "\"%s\" re-definido"

25343

+

25344

+#: macro.c:3117

25345

+msgid "this is the location of the previous definition"

25346

+msgstr "essa é a localização da definição anterior"

25347

+

25348

+#: macro.c:3178

25349

+#, c-format

25350

+msgid "macro argument \"%s\" would be stringified in traditional C"

25351

+msgstr "argumento de macro \"%s\" estaria em uma string no C tradicional"

25352

+

25353

+#: macro.c:3205

25354

+#, c-format

25355

+msgid "invalid hash type %d in cpp_macro_definition"

25356

+msgstr "tipo de hash inválido %d em cpp_macro_definition"

25357

+

25358

+#: pch.c:87 pch.c:345 pch.c:359 pch.c:377 pch.c:383 pch.c:392 pch.c:399

25359

+msgid "while writing precompiled header"

25360

+msgstr "enquanto realizava escrita de header pré-compilado"

25361

+

25362

+#: pch.c:619

25363

+#, c-format

25364

+msgid "%s: not used because `%.*s' is poisoned"

25365

+msgstr "%s: não usado porque \"%.*s\" está envenenado"

25366

+

25367

+#: pch.c:641

25368

+#, c-format

25369

+msgid "%s: not used because `%.*s' not defined"

25370

+msgstr "%s: não usado porque \"%.*s\" não está definido"

25371

+

25372

+#: pch.c:653

25373

+#, c-format

25374

+msgid "%s: not used because `%.*s' defined as `%s' not `%.*s'"

25375

+msgstr "%s: não usado porque \"%.*s\" está definido como \"%s\", e não \"%.*s\""

25376

+

25377

+#: pch.c:694

25378

+#, c-format

25379

+msgid "%s: not used because `%s' is defined"

25380

+msgstr "%s: não usado porque \"%s\" está definido"

25381

+

25382

+#: pch.c:714

25383

+#, c-format

25384

+msgid "%s: not used because `__COUNTER__' is invalid"

25385

+msgstr "%s: não usado porque \"__COUNTER__\" é inválido"

25386

+

25387

+#: pch.c:723 pch.c:898

25388

+msgid "while reading precompiled header"

25389

+msgstr "enquanto realizava leitura de header pré-compilado"

25390

+

25391

+#: traditional.c:750

25392

+#, c-format

25393

+msgid "detected recursion whilst expanding macro \"%s\""

25394

+msgstr "detectada recursão enquanto expandia macro \"%s\""

25395

+

25396

+#: traditional.c:968

25397

+msgid "syntax error in macro parameter list"

25398

+msgstr "erro de sintaxe na lista de parâmetros de macro"

25399

Index: libcpp/po/ChangeLog

25400

===================================================================

25401

--- a/src/libcpp/po/ChangeLog (.../tags/gcc_4_8_2_release)

25402

+++ b/src/libcpp/po/ChangeLog (.../branches/gcc-4_8-branch)

25403

@@ -1,3 +1,11 @@

25404

+2013-12-18 Joseph Myers <joseph@codesourcery.com>

25405

+

25406

+ * pt_BR.po: New.

25407

+

25408

+2013-11-01 Joseph Myers <joseph@codesourcery.com>

25409

+

25410

+ * tr.po: Update.

25411

+

25412

2013-10-16 Release Manager

25413

25414

* GCC 4.8.2 released.

25415

Index: libcpp/po/tr.po

25416

===================================================================

25417

--- a/src/libcpp/po/tr.po (.../tags/gcc_4_8_2_release)

25418

+++ b/src/libcpp/po/tr.po (.../branches/gcc-4_8-branch)

25419

@@ -1,20 +1,22 @@

25420

# Turkish translations for cpplib messages.

25421

25422

+# This file is distributed under the same license as the gcc package.

25423

#

25424

# Nilgün Belma Bugüner <nilgun@buguner.name.tr>, 2001, ..., 2007.

25425

+# Volkan Gezer <vlkngzr@gmail.com>, 2013.

25426

msgid ""

25427

msgstr ""

25428

-"Project-Id-Version: cpplib 4.2.0\n"

25429

+"Project-Id-Version: cpplib 4.8.0\n"

25430

"Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"

25431

-"POT-Creation-Date: 2013-02-24 01:05+0000\n"

25432

-"PO-Revision-Date: 2007-05-23 01:17+0300\n"

25433

-"Last-Translator: Nilgün Belma Bugüner <nilgun@buguner.name.tr>\n"

25434

+"POT-Creation-Date: 2013-03-15 17:42+0000\n"

25435

+"PO-Revision-Date: 2013-11-01 22:29+0100\n"

25436

+"Last-Translator: Volkan Gezer <vlkngzr@gmail.com>\n"

25437

"Language-Team: Turkish <gnu-tr-u12a@lists.sourceforge.net>\n"

25438

"Language: tr\n"

25439

"MIME-Version: 1.0\n"

25440

"Content-Type: text/plain; charset=UTF-8\n"

25441

"Content-Transfer-Encoding: 8bit\n"

25442

-"X-Generator: KBabel 1.11.4\n"

25443

+"X-Generator: Lokalize 1.5\n"

25444

"Plural-Forms: nplurals=2; plural=(n != 1);\n"

25445

25446

#: charset.c:673

25447

@@ -121,10 +123,9 @@

25448

msgstr "ISO standardı olmayan önceleme dizgesi, '\\%c'"

25449

25450

#: charset.c:1320

25451

-#, fuzzy, c-format

25452

-#| msgid "unknown escape sequence '\\%c'"

25453

+#, c-format

25454

msgid "unknown escape sequence: '\\%c'"

25455

-msgstr "bilinmeyen önceleme dizgesi '\\%c'"

25456

+msgstr "bilinmeyen kaçış dizgesi: '\\%c'"

25457

25458

#: charset.c:1328

25459

#, c-format

25460

@@ -163,10 +164,9 @@

25461

msgstr "#%s bir GCC uzantısıdır"

25462

25463

#: directives.c:362

25464

-#, fuzzy, c-format

25465

-#| msgid "#%s is a GCC extension"

25466

+#, c-format

25467

msgid "#%s is a deprecated GCC extension"

25468

-msgstr "#%s bir GCC uzantısıdır"

25469

+msgstr "#%s eskimiş bir GCC uzantısıdır"

25470

25471

#: directives.c:375

25472

msgid "suggest not using #elif in traditional C"

25473

@@ -247,7 +247,7 @@

25474

25475

#: directives.c:909

25476

msgid "unexpected end of file after #line"

25477

-msgstr ""

25478

+msgstr "#line satırından sonra beklenmeyen dosya sonu"

25479

25480

#: directives.c:912

25481

#, c-format

25482

@@ -271,7 +271,7 @@

25483

#: directives.c:1068 directives.c:1070 directives.c:1072 directives.c:1658

25484

#, c-format

25485

msgid "%s"

25486

-msgstr ""

25487

+msgstr "%s"

25488

25489

#: directives.c:1096

25490

#, c-format

25491

@@ -312,16 +312,12 @@

25492

msgstr "main dosyasında '#pragma once'"

25493

25494

#: directives.c:1462

25495

-#, fuzzy

25496

-#| msgid "invalid #pragma GCC poison directive"

25497

msgid "invalid #pragma push_macro directive"

25498

-msgstr "geçersiz #pragma GCC poison yönergesi"

25499

+msgstr "geçersiz #pragma güdümlü_makro yönergesi"

25500

25501

#: directives.c:1517

25502

-#, fuzzy

25503

-#| msgid "invalid #pragma GCC poison directive"

25504

msgid "invalid #pragma pop_macro directive"

25505

-msgstr "geçersiz #pragma GCC poison yönergesi"

25506

+msgstr "geçersiz #pragma güdümlü_makro yönergesi"

25507

25508

#: directives.c:1572

25509

msgid "invalid #pragma GCC poison directive"

25510

@@ -347,10 +343,9 @@

25511

msgstr "mevcut dosya %s den daha eski"

25512

25513

#: directives.c:1653

25514

-#, fuzzy, c-format

25515

-#| msgid "invalid #pragma GCC poison directive"

25516

+#, c-format

25517

msgid "invalid \"#pragma GCC %s\" directive"

25518

-msgstr "geçersiz #pragma GCC poison yönergesi"

25519

+msgstr "geçersiz \"#pragma GCC %s\" yönergesi"

25520

25521

#: directives.c:1847

25522

msgid "_Pragma takes a parenthesized string literal"

25523

@@ -405,7 +400,7 @@

25524

msgid "\"%s\" re-asserted"

25525

msgstr "\"%s\" tekrar olumlanmış"

25526

25527

-#: directives.c:2566

25528

+#: directives.c:2567

25529

#, c-format

25530

msgid "unterminated #%s"

25531

msgstr "sonlandırılmamış #%s"

25532

@@ -424,16 +419,12 @@

25533

msgstr "%s: %s"

25534

25535

#: expr.c:479 expr.c:577

25536

-#, fuzzy

25537

-#| msgid "imaginary constants are a GCC extension"

25538

msgid "fixed-point constants are a GCC extension"

25539

-msgstr "sanal sabitler bir GCC genişletmesidir"

25540

+msgstr "sabit noktalı sabitler bir GCC uzantısıdır"

25541

25542

#: expr.c:504

25543

-#, fuzzy

25544

-#| msgid "invalid suffix \"%.*s\" on floating constant"

25545

msgid "invalid prefix \"0b\" for floating constant"

25546

-msgstr "gerçel sabitin \"%.*s\" soneki geçersiz"

25547

+msgstr "kayan nokta için geçerisz \"0b\" öntakısı"

25548

25549

#: expr.c:514

25550

msgid "use of C99 hexadecimal floating constant"

25551

@@ -450,10 +441,8 @@

25552

msgstr "geleneksel C \"%.*s\" sonekini kullanmaz"

25553

25554

#: expr.c:564

25555

-#, fuzzy

25556

-#| msgid "imaginary constants are a GCC extension"

25557

msgid "suffix for double constant is a GCC extension"

25558

-msgstr "sanal sabitler bir GCC genişletmesidir"

25559

+msgstr "çift sabit için öntakı bir GCC uzantısıdır"

25560

25561

#: expr.c:570

25562

#, c-format

25563

@@ -461,10 +450,8 @@

25564

msgstr "onaltılık kayan sabitli \"%.*s\" soneki geçersiz"

25565

25566

#: expr.c:581

25567

-#, fuzzy

25568

-#| msgid "imaginary constants are a GCC extension"

25569

msgid "decimal float constants are a GCC extension"

25570

-msgstr "sanal sabitler bir GCC genişletmesidir"

25571

+msgstr "onluk kayan sabitler bir GCC uzantısıdır"

25572

25573

#: expr.c:599

25574

#, c-format

25575

@@ -472,10 +459,8 @@

25576

msgstr "tamsayı sabitte sonek \"%.*s\" soneki geçersiz"

25577

25578

#: expr.c:624

25579

-#, fuzzy

25580

-#| msgid "use of C99 long long integer constant"

25581

msgid "use of C++0x long long integer constant"

25582

-msgstr "ISO C99 long long tamsayı sabitleri yasaklar"

25583

+msgstr "ISO C++0x long long tamsayı sabitlerinin kullanımı"

25584

25585

#: expr.c:625

25586

msgid "use of C99 long long integer constant"

25587

@@ -486,10 +471,8 @@

25588

msgstr "sanal sabitler bir GCC genişletmesidir"

25589

25590

#: expr.c:644

25591

-#, fuzzy

25592

-#| msgid "imaginary constants are a GCC extension"

25593

msgid "binary constants are a GCC extension"

25594

-msgstr "sanal sabitler bir GCC genişletmesidir"

25595

+msgstr "ikili sabitler bir GCC uzantısıdır"

25596

25597

#: expr.c:737

25598

msgid "integer constant is too large for its type"

25599

@@ -517,10 +500,8 @@

25600

msgstr "\"defined\" bu kullanımıyla uyarlanabilir olmayabilir"

25601

25602

#: expr.c:948

25603

-#, fuzzy

25604

-#| msgid "integer overflow in preprocessor expression"

25605

msgid "user-defined literal in preprocessor expression"

25606

-msgstr "önişlemci ifadesinde tamsayı taşması"

25607

+msgstr "önişleyici ifadesinde kullanıcı tanımlı bağımlı"

25608

25609

#: expr.c:953

25610

msgid "floating constant in preprocessor expression"

25611

@@ -536,20 +517,17 @@

25612

msgstr "\"%s\" tanımlı değil"

25613

25614

#: expr.c:1020

25615

-#, fuzzy

25616

-#| msgid "#%s is a GCC extension"

25617

msgid "assertions are a GCC extension"

25618

-msgstr "#%s bir GCC uzantısıdır"

25619

+msgstr "belirteçler bir GCC uzantısıdır"

25620

25621

#: expr.c:1023

25622

msgid "assertions are a deprecated extension"

25623

-msgstr ""

25624

+msgstr "belirteçler artık kullanılmayan bir ifadedir"

25625

25626

#: expr.c:1268

25627

-#, fuzzy, c-format

25628

-#| msgid "unbalanced stack in #if"

25629

+#, c-format

25630

msgid "unbalanced stack in %s"

25631

-msgstr "#if ifadesinde karşılıksız yığın"

25632

+msgstr "%s içinde dengelenmemiş yığın"

25633

25634

#: expr.c:1288

25635

#, c-format

25636

@@ -594,39 +572,39 @@

25637

msgid "division by zero in #if"

25638

msgstr "#if içinde sıfırla bölme"

25639

25640

-#: files.c:504

25641

+#: files.c:505

25642

msgid "NULL directory in find_file"

25643

msgstr "find_file içinde boş dizin"

25644

25645

-#: files.c:542

25646

+#: files.c:553

25647

msgid "one or more PCH files were found, but they were invalid"

25648

msgstr "bir veya daha fazla PCH dosyası bulundu ama bunlar geçersiz"

25649

25650

-#: files.c:545

25651

+#: files.c:556

25652

msgid "use -Winvalid-pch for more information"

25653

msgstr "daha fazla bilgi almak için -Winvalid-pch kullanın"

25654

25655

-#: files.c:643

25656

+#: files.c:660

25657

#, c-format

25658

msgid "%s is a block device"

25659

msgstr "%s bir blok aygıtıdır"

25660

25661

-#: files.c:660

25662

+#: files.c:677

25663

#, c-format

25664

msgid "%s is too large"

25665

msgstr "%s çok büyük"

25666

25667

-#: files.c:700

25668

+#: files.c:717

25669

#, c-format

25670

msgid "%s is shorter than expected"

25671

msgstr "%s beklenenden daha kısa"

25672

25673

-#: files.c:935

25674

+#: files.c:953

25675

#, c-format

25676

msgid "no include path in which to search for %s"

25677

msgstr "%s için aranacaklar içinde başlık dosyaları yolu yok"

25678

25679

-#: files.c:1363

25680

+#: files.c:1381

25681

msgid "Multiple include guards may be useful for:\n"

25682

msgstr "Çoklu include önlemleri aşağıdakiler için kullanışlı olabilir:\n"

25683

25684

@@ -717,27 +695,24 @@

25685

#: lex.c:1178 lex.c:1255

25686

#, c-format

25687

msgid "identifier \"%s\" is a special operator name in C++"

25688

-msgstr ""

25689

+msgstr "\"%s\" belirteci, C++'da özel bir işleç adıdır"

25690

25691

#: lex.c:1399

25692

msgid "raw string delimiter longer than 16 characters"

25693

-msgstr ""

25694

+msgstr "ham dizge ayracı 16 karakterden uzun"

25695

25696

#: lex.c:1402

25697

-#, fuzzy, c-format

25698

-#| msgid "universal character %.*s is not valid in an identifier"

25699

+#, c-format

25700

msgid "invalid character '%c' in raw string delimiter"

25701

-msgstr "evrensel karakter %.*s bir belirteç içinde geçerli değil"

25702

+msgstr "ham dizge ayracında geçersiz karakter '%c'"

25703

25704

#: lex.c:1525 lex.c:1547

25705

-#, fuzzy

25706

-#| msgid "unterminated #%s"

25707

msgid "unterminated raw string"

25708

-msgstr "sonlandırılmamış #%s"

25709

+msgstr "bitirilmemiş ham dizge"

25710

25711

#: lex.c:1573 lex.c:1706

25712

msgid "invalid suffix on literal; C++11 requires a space between literal and identifier"

25713

-msgstr ""

25714

+msgstr "geçersiz ifade soneki; C++11 ifade ve tanımlayıcı arasında bir boşluk gerektirir"

25715

25716

#: lex.c:1684

25717

msgid "null character(s) preserved in literal"

25718

@@ -785,7 +760,7 @@

25719

25720

#: macro.c:377

25721

msgid "__COUNTER__ expanded inside directive with -fdirectives-only"

25722

-msgstr ""

25723

+msgstr "__COUNTER__ -fdirectives-only ile talimat içerisinde genişletildi"

25724

25725

#: macro.c:535

25726

msgid "invalid string literal, ignoring final '\\'"

25727

@@ -823,7 +798,7 @@

25728

#: macro.c:1746

25729

#, c-format

25730

msgid "invoking macro %s argument %d: empty macro arguments are undefined in ISO C90 and ISO C++98"

25731

-msgstr ""

25732

+msgstr "%s makrosu %d argümanı uygulanıyor: ISO C90 ve ISO C++98 içerisinde boş makro argümanları tanımsızdır"

25733

25734

#: macro.c:2708

25735

#, c-format

25736

@@ -890,38 +865,36 @@

25737

msgid "invalid hash type %d in cpp_macro_definition"

25738

msgstr "cpp_macro_definition içindeki isimli yapı türü %d geçersiz"

25739

25740

-#: pch.c:87 pch.c:335 pch.c:347 pch.c:365 pch.c:371 pch.c:380 pch.c:387

25741

+#: pch.c:87 pch.c:345 pch.c:359 pch.c:377 pch.c:383 pch.c:392 pch.c:399

25742

msgid "while writing precompiled header"

25743

msgstr "önderlemeli başlık yazılırken"

25744

25745

-#: pch.c:607

25746

-#, fuzzy, c-format

25747

-#| msgid "%s: not used because `%s' is defined"

25748

+#: pch.c:619

25749

+#, c-format

25750

msgid "%s: not used because `%.*s' is poisoned"

25751

-msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

25752

+msgstr "%s: `%.*s' zehirli olduğu için kullanılmadı"

25753

25754

-#: pch.c:629

25755

+#: pch.c:641

25756

#, c-format

25757

msgid "%s: not used because `%.*s' not defined"

25758

msgstr "%s: `%.*s' tanımlı olmadığından kullanılmadı"

25759

25760

-#: pch.c:641

25761

+#: pch.c:653

25762

#, c-format

25763

msgid "%s: not used because `%.*s' defined as `%s' not `%.*s'"

25764

msgstr "%s: `%.*s' kullanılmadı çünkü `%s' olarak tanımlı, `%.*s' değil"

25765

25766

-#: pch.c:682

25767

+#: pch.c:694

25768

#, c-format

25769

msgid "%s: not used because `%s' is defined"

25770

msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

25771

25772

-#: pch.c:702

25773

-#, fuzzy, c-format

25774

-#| msgid "%s: not used because `%s' is defined"

25775

+#: pch.c:714

25776

+#, c-format

25777

msgid "%s: not used because `__COUNTER__' is invalid"

25778

-msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

25779

+msgstr "%s: `__COUNTER__' geçersiz olduğundan kullanılmadı"

25780

25781

-#: pch.c:711 pch.c:886

25782

+#: pch.c:723 pch.c:898

25783

msgid "while reading precompiled header"

25784

msgstr "önderlemeli başlık okunurken"

25785

25786

Index: .

25787

===================================================================

25788

--- a/src/. (.../tags/gcc_4_8_2_release)

25789

+++ b/src/. (.../branches/gcc-4_8-branch)

25790

25791

Property changes on: .

25792

___________________________________________________________________

25793

Modified: svn:mergeinfo

25794

Merged /trunk:r202766,204547