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

1

# DP: updates from the 4.8 branch upto 20140110 (r206513).

2

3

last_updated()

4

{

5

cat > ${dir}LAST_UPDATED <<EOF

6

Mon Jan 10 09:52:42 CET 2014

7

Mon Jan 10 08:52:42 UTC 2014 (revision 206513)

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

+20140110

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

4911

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

4912

--- a/src/gcc/DEV-PHASE (.../tags/gcc_4_8_2_release)

4913

+++ b/src/gcc/DEV-PHASE (.../branches/gcc-4_8-branch)

4914

@@ -0,0 +1 @@

4915

+prerelease

4916

Index: gcc/tree-ssa-sccvn.c

4917

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

4918

--- a/src/gcc/tree-ssa-sccvn.c (.../tags/gcc_4_8_2_release)

4919

+++ b/src/gcc/tree-ssa-sccvn.c (.../branches/gcc-4_8-branch)

4920

@@ -660,7 +660,7 @@

4921

}

4922

4923

/* For non-calls, store the information that makes up the address. */

4924

-

4925

+ tree orig = ref;

4926

while (ref)

4927

{

4928

vn_reference_op_s temp;

4929

@@ -711,7 +711,15 @@

4930

.arshift (BITS_PER_UNIT == 8

4931

? 3 : exact_log2 (BITS_PER_UNIT),

4932

HOST_BITS_PER_DOUBLE_INT);

4933

- if (off.fits_shwi ())

4934

+ if (off.fits_shwi ()

4935

+ /* Probibit value-numbering zero offset components

4936

+ of addresses the same before the pass folding

4937

+ __builtin_object_size had a chance to run

4938

+ (checking cfun->after_inlining does the

4939

+ trick here). */

4940

+ && (TREE_CODE (orig) != ADDR_EXPR

4941

+ || !off.is_zero ()

4942

+ || cfun->after_inlining))

4943

temp.off = off.low;

4944

}

4945

}

4946

Index: gcc/ChangeLog

4947

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

4948

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

4949

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

4950

@@ -1,3 +1,1030 @@

4951

+2014-01-10 Huacai Chen <chenhc@lemote.com>

4952

+

4953

+ * config/mips/driver-native.c (host_detect_local_cpu): Handle new

4954

+ kernel strings for Loongson-2E/2F/3A.

4955

+

4956

+2014-01-10 Richard Biener <rguenther@suse.de>

4957

+

4958

+ PR tree-optimization/59715

4959

+ * tree-flow.h (split_critical_edges): Declare.

4960

+ * tree-cfg.c (split_critical_edges): Export.

4961

+ * tree-ssa-sink.c (execute_sink_code): Split critical edges.

4962

+

4963

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

4964

+

4965

+ * config/mips/mips.h (ISA_HAS_WSBH): Define.

4966

+ * config/mips/mips.md (UNSPEC_WSBH, UNSPEC_DSBH, UNSPEC_DSHD): New

4967

+ constants.

4968

+ (bswaphi2, bswapsi2, bswapdi2, wsbh, dsbh, dshd): New patterns.

4969

+

4970

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

4971

+

4972

+ PR rtl-optimization/59137

4973

+ * reorg.c (steal_delay_list_from_target): Call update_block for

4974

+ elided insns.

4975

+ (steal_delay_list_from_fallthrough, relax_delay_slots): Likewise.

4976

+

4977

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

4978

+

4979

+ Revert:

4980

+ 2012-10-07 Richard Sandiford <rdsandiford@googlemail.com>

4981

+

4982

+ * config/mips/mips.c (mips_truncated_op_cost): New function.

4983

+ (mips_rtx_costs): Adjust test for BADDU.

4984

+ * config/mips/mips.md (*baddu_di<mode>): Push truncates to operands.

4985

+

4986

+ 2012-10-02 Richard Sandiford <rdsandiford@googlemail.com>

4987

+

4988

+ * config/mips/mips.md (*baddu_si_eb, *baddu_si_el): Merge into...

4989

+ (*baddu_si): ...this new pattern.

4990

+

4991

+2014-01-09 Richard Biener <rguenther@suse.de>

4992

+

4993

+ Backport from mainline

4994

+ 2013-11-18 Richard Biener <rguenther@suse.de>

4995

+

4996

+ PR tree-optimization/59125

4997

+ PR tree-optimization/54570

4998

+ * tree-ssa-sccvn.c (copy_reference_ops_from_ref): When inlining

4999

+ is not complete do not treat component-references with offset zero

5000

+ but different fields as equal.

5001

+ * tree-object-size.c: Include tree-phinodes.h and ssa-iterators.h.

5002

+ (compute_object_sizes): Apply TLC. Propagate the constant

5003

+ results into all uses and fold their stmts.

5004

+ * passes.def (pass_all_optimizations): Move pass_object_sizes

5005

+ after the first pass_forwprop and before pass_fre.

5006

+

5007

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

5008

+

5009

+ PR tree-optimization/59362

5010

+ * tree-object-size.c (object_sizes): Change into array of

5011

+ vec<unsigned HOST_WIDE_INT>.

5012

+ (compute_builtin_object_size): Check computed bitmap for

5013

+ non-NULL instead of object_sizes. Call safe_grow on object_sizes

5014

+ vector if new SSA_NAMEs appeared.

5015

+ (init_object_sizes): Check computed bitmap for non-NULL.

5016

+ Call safe_grow on object_sizes elements instead of initializing

5017

+ it with XNEWVEC.

5018

+ (fini_object_sizes): Call release on object_sizes elements, don't

5019

+ set it to NULL.

5020

+

5021

+2014-01-09 Richard Earnshaw <rearnsha@arm.com>

5022

+

5023

+ PR rtl-optimization/54300

5024

+ * regcprop.c (copyprop_hardreg_forward_1): Ensure any unused

5025

+ outputs in a single-set are killed from the value chains.

5026

+

5027

+2014-01-09 Jakub Jelinek <jakub@redhat.com>

5028

+

5029

+ PR rtl-optimization/59724

5030

+ * ifcvt.c (cond_exec_process_if_block): Don't call

5031

+ flow_find_head_matching_sequence with 0 longest_match.

5032

+ * cfgcleanup.c (flow_find_head_matching_sequence): Count even

5033

+ non-active insns if !stop_after.

5034

+ (try_head_merge_bb): Revert 2014-01-07 changes.

5035

+

5036

+2014-01-09 Hans-Peter Nilsson <hp@axis.com>

5037

+

5038

+ Backport from mainline

5039

+ 2013-12-23 Hans-Peter Nilsson <hp@axis.com>

5040

+

5041

+ PR middle-end/59584

5042

+ * config/cris/predicates.md (cris_nonsp_register_operand):

5043

+ New define_predicate.

5044

+ * config/cris/cris.md: Replace register_operand with

5045

+ cris_nonsp_register_operand for destinations in all

5046

+ define_splits where a register is set more than once.

5047

+

5048

+2014-01-08 H.J. Lu <hongjiu.lu@intel.com>

5049

+

5050

+ Backport from mainline

5051

+ 2013-12-25 H.J. Lu <hongjiu.lu@intel.com>

5052

+

5053

+ PR target/59587

5054

+ * config/i386/i386.c (struct ptt): Add a field for processor

5055

+ name.

5056

+ (processor_target_table): Sync with processor_type. Add

5057

+ processor names.

5058

+ (cpu_names): Removed.

5059

+ (ix86_option_override_internal): Default x_ix86_tune_string

5060

+ to processor_target_table[TARGET_CPU_DEFAULT].name.

5061

+ (ix86_function_specific_print): Assert arch and tune <

5062

+ PROCESSOR_max. Use processor_target_table to print arch and

5063

+ tune names.

5064

+ * config/i386/i386.h (TARGET_CPU_DEFAULT): Default to

5065

+ PROCESSOR_GENERIC32.

5066

+ (target_cpu_default): Removed.

5067

+ (processor_type): Reordered.

5068

+

5069

+2014-01-08 Uros Bizjak <ubizjak@gmail.com>

5070

+

5071

+ Backport from mainline

5072

+ 2014-01-05 Uros Bizjak <ubizjak@gmail.com>

5073

+

5074

+ * config/i386/i386.c (ix86_data_alignment): Calculate max_align

5075

+ from prefetch_block tune setting.

5076

+ (nocona_cost): Correct size of prefetch block to 64.

5077

+

5078

+2014-01-08 Martin Jambor <mjambor@suse.cz>

5079

+

5080

+ PR ipa/59610

5081

+ * ipa-prop.c (ipa_compute_jump_functions): Bail out if not optimizing.

5082

+ (parm_preserved_before_stmt_p): Assume modification present when not

5083

+ optimizing.

5084

+

5085

+2014-01-07 John David Anglin <danglin@gcc.gnu.org>

5086

+

5087

+ PR target/59652

5088

+ * config/pa/pa.c (pa_legitimate_address_p): Return false before reload

5089

+ for 14-bit register offsets when INT14_OK_STRICT is false.

5090

+

5091

+2014-01-07 Roland Stigge <stigge@antcom.de>

5092

+ Michael Meissner <meissner@linux.vnet.ibm.com>

5093

+

5094

+ PR 57386/target

5095

+ * config/rs6000/rs6000.c (rs6000_legitimate_offset_address_p):

5096

+ Only check TFmode for SPE constants. Don't check TImode or TDmode.

5097

+

5098

+2014-01-07 Jakub Jelinek <jakub@redhat.com>

5099

+

5100

+ PR rtl-optimization/58668

5101

+ * cfgcleanup.c (flow_find_cross_jump): Don't count

5102

+ any jumps if dir_p is NULL. Remove p1 variable and make USE/CLOBBER

5103

+ check consistent with other places.

5104

+ (flow_find_head_matching_sequence): Don't count USE or CLOBBER insns.

5105

+ (try_head_merge_bb): Adjust for the flow_find_head_matching_sequence

5106

+ counting change.

5107

+ * ifcvt.c (count_bb_insns): Don't count USE or CLOBBER insns.

5108

+

5109

+2014-01-07 Mike Stump <mikestump@comcast.net>

5110

+ Jakub Jelinek <jakub@redhat.com>

5111

+

5112

+ PR pch/59436

5113

+ * tree.h (struct tree_optimization_option): Change optabs

5114

+ type from unsigned char * to void *.

5115

+ * optabs.c (init_tree_optimization_optabs): Adjust

5116

+ TREE_OPTIMIZATION_OPTABS initialization.

5117

+

5118

+2014-01-07 Jakub Jelinek <jakub@redhat.com>

5119

+

5120

+ Backported from mainline

5121

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

5122

+

5123

+ PR middle-end/58956

5124

+ PR middle-end/59470

5125

+ * gimple.h (walk_stmt_load_store_addr_fn): New typedef.

5126

+ (walk_stmt_load_store_addr_ops, walk_stmt_load_store_ops): Use it

5127

+ for callback params.

5128

+ * gimple.c (walk_stmt_load_store_ops): Likewise.

5129

+ (walk_stmt_load_store_addr_ops): Likewise. Adjust all callback

5130

+ calls to supply the gimple operand containing the base tree

5131

+ as an extra argument.

5132

+ * tree-ssa-ter.c (find_ssaname, find_ssaname_in_store): New helper

5133

+ functions.

5134

+ (find_replaceable_in_bb): For calls or GIMPLE_ASM, only set

5135

+ same_root_var if USE is used somewhere in the stores of the stmt.

5136

+ * ipa-prop.c (visit_ref_for_mod_analysis): Remove name of the stmt

5137

+ argument and ATTRIBUTE_UNUSED, add another unnamed tree argument.

5138

+ * ipa-pure-const.c (check_load, check_store, check_ipa_load,

5139

+ check_ipa_store): Likewise.

5140

+ * gimple.c (gimple_ior_addresses_taken_1): Likewise.

5141

+ * ipa-split.c (test_nonssa_use, mark_nonssa_use): Likewise.

5142

+ (verify_non_ssa_vars, visit_bb): Adjust their callers.

5143

+ * cfgexpand.c (add_scope_conflicts_1): Use

5144

+ walk_stmt_load_store_addr_fn type for visit variable.

5145

+ (visit_op, visit_conflict): Remove name of the stmt

5146

+ argument and ATTRIBUTE_UNUSED, add another unnamed tree argument.

5147

+ * tree-sra.c (asm_visit_addr): Likewise. Remove name of the data

5148

+ argument and ATTRIBUTE_UNUSED.

5149

+ * cgraphbuild.c (mark_address, mark_load, mark_store): Add another

5150

+ unnamed tree argument.

5151

+

5152

+2014-01-03 Andreas Schwab <schwab@linux-m68k.org>

5153

+

5154

+ * config/m68k/m68k.c (handle_move_double): Handle pushes with

5155

+ overlapping registers also for registers other than the stack

5156

+ pointer.

5157

+

5158

+2014-01-03 Jakub Jelinek <jakub@redhat.com>

5159

+

5160

+ PR target/59625

5161

+ * config/i386/i386.c (ix86_avoid_jump_mispredicts): Don't consider

5162

+ asm goto as jump.

5163

+

5164

+2014-01-01 Jakub Jelinek <jakub@redhat.com>

5165

+

5166

+ PR rtl-optimization/59647

5167

+ * cse.c (cse_process_notes_1): Don't substitute negative VOIDmode

5168

+ new_rtx into UNSIGNED_FLOAT rtxes.

5169

+

5170

+2013-12-28 Eric Botcazou <ebotcazou@adacore.com>

5171

+

5172

+ * doc/invoke.texi (output file options): Document -fada-spec-parent.

5173

+

5174

+2013-12-26 Uros Bizjak <ubizjak@gmail.com>

5175

+

5176

+ * config/i386/driver-i386.c (decode_caches_intel): Add missing entries.

5177

+

5178

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

5179

+

5180

+ PR c++/59255

5181

+ Backported from mainline

5182

+ 2013-08-19 Dehao Chen <dehao@google.com>

5183

+

5184

+ * value-prof.c (gimple_ic): Fix the bug of adding EH edge.

5185

+

5186

+2013-12-19 James Greenhalgh <james.greenhalgh@arm.com>

5187

+

5188

+ Backport from Mainline.

5189

+ 2013-05-01 James Greenhalgh <james.greenhalgh@arm.com>

5190

+

5191

+ * config/aarch64/aarch64-simd-builtins.def (cmhs): Rename to...

5192

+ (cmgeu): ...This.

5193

+ (cmhi): Rename to...

5194

+ (cmgtu): ...This.

5195

+ * config/aarch64/aarch64-simd.md

5196

+ (simd_mode): Add SF.

5197

+ (aarch64_vcond_internal): Use new names for unsigned comparison insns.

5198

+ (aarch64_cm<optab><mode>): Rewrite to not use UNSPECs.

5199

+ * config/aarch64/aarch64.md (*cstore<mode>_neg): Rename to...

5200

+ (cstore<mode>_neg): ...This.

5201

+ * config/aarch64/iterators.md

5202

+ (VALLF): new.

5203

+ (unspec): Remove UNSPEC_CM<EQ, LE, LT, GE, GT, HS, HI, TST>.

5204

+ (COMPARISONS): New.

5205

+ (UCOMPARISONS): Likewise.

5206

+ (optab): Add missing comparisons.

5207

+ (n_optab): New.

5208

+ (cmp_1): Likewise.

5209

+ (cmp_2): Likewise.

5210

+ (CMP): Likewise.

5211

+ (cmp): Remove.

5212

+ (VCMP_S): Likewise.

5213

+ (VCMP_U): Likewise.

5214

+ (V_cmp_result): Add DF, SF modes.

5215

+ (v_cmp_result): Likewise.

5216

+ (v): Likewise.

5217

+ (vmtype): Likewise.

5218

+ * config/aarch64/predicates.md (aarch64_reg_or_fp_zero): New.

5219

+

5220

+ Partial Backport from mainline.

5221

+ 2013-05-01 James Greenhalgh <james.greenhalgh@arm.com>

5222

+

5223

+ * config/aarch64/arm_neon.h

5224

+ (vc<eq, lt, le, gt, ge, tst><qsd>_<u><8,16,32,64>): Remap

5225

+ to builtins or C as appropriate.

5226

+

5227

+2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

5228

+ Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5229

+

5230

+ Backport from mainline

5231

+ 2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

5232

+ * config/s390/s390.c (s390_hotpatch_trampoline_halfwords_default): New

5233

+ constant

5234

+ (s390_hotpatch_trampoline_halfwords_max): New constant

5235

+ (s390_hotpatch_trampoline_halfwords): New static variable

5236

+ (get_hotpatch_attribute): New function

5237

+ (s390_handle_hotpatch_attribute): New function

5238

+ (s390_attribute_table): New target specific attribute table to implement

5239

+ the hotpatch attribute

5240

+ (s390_option_override): Parse hotpatch options

5241

+ (s390_function_num_hotpatch_trampoline_halfwords): New function

5242

+ (s390_can_inline_p): Implement target hook to

5243

+ suppress hotpatching for explicitly inlined functions

5244

+ (s390_asm_output_function_label): Generate hotpatch prologue

5245

+ (TARGET_ATTRIBUTE_TABLE): Define to implement target attribute table

5246

+ (TARGET_CAN_INLINE_P): Define to implement target hook

5247

+ * config/s390/s390.opt (mhotpatch): New options -mhotpatch, -mhotpatch=

5248

+ * config/s390/s390-protos.h (s390_asm_output_function_label): Add

5249

+ prototype

5250

+ * config/s390/s390.h (ASM_OUTPUT_FUNCTION_LABEL): Target specific

5251

+ function label generation for hotpatching

5252

+ (FUNCTION_BOUNDARY): Align functions to eight bytes

5253

+ * doc/extend.texi: Document hotpatch attribute

5254

+ * doc/invoke.texi: Document -mhotpatch option

5255

+

5256

+2013-12-18 Eric Botcazou <ebotcazou@adacore.com>

5257

+

5258

+ * config/arm/arm.c (arm_expand_epilogue_apcs_frame): Fix thinko.

5259

+

5260

+2013-12-12 Vladimir Makarov <vmakarov@redhat.com>

5261

+

5262

+ PR middle-end/59470

5263

+ * lra-coalesce.c (lra_coalesce): Invalidate inheritance pseudo

5264

+ values if necessary.

5265

+

5266

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

5267

+

5268

+ PR libgomp/59467

5269

+ * gimplify.c (omp_check_private): Add copyprivate argument, if it

5270

+ is true, don't check omp_privatize_by_reference.

5271

+ (gimplify_scan_omp_clauses): For OMP_CLAUSE_COPYPRIVATE verify

5272

+ decl is private in outer context. Adjust omp_check_private caller.

5273

+

5274

+2013-12-10 Eric Botcazou <ebotcazou@adacore.com>

5275

+

5276

+ PR rtl-optimization/58295

5277

+ * simplify-rtx.c (simplify_truncation): Restrict the distribution for

5278

+ WORD_REGISTER_OPERATIONS targets.

5279

+

5280

+2013-12-10 Kai Tietz <ktietz@redhat.com>

5281

+

5282

+ PR target/56807

5283

+ * config/i386/i386.c (ix86_expand_prologue): Address saved

5284

+ registers stack-relative, not via frame-pointer.

5285

+

5286

+2013-12-09 Alan Modra <amodra@gmail.com>

5287

+

5288

+ Apply from mainline

5289

+ 2013-12-05 Alan Modra <amodra@gmail.com>

5290

+ * configure.ac (BUILD_CXXFLAGS) Don't use ALL_CXXFLAGS for

5291

+ build != host.

5292

+ <recursive call for build != host>: Clear GMPINC. Don't bother

5293

+ saving CFLAGS.

5294

+ * configure: Regenerate.

5295

+

5296

+2013-12-08 Uros Bizjak <ubizjak@gmail.com>

5297

+

5298

+ Backport from mainline

5299

+ 2013-12-06 Uros Bizjak <ubizjak@gmail.com>

5300

+

5301

+ PR target/59405

5302

+ * config/i386/i386.c (type_natural_mode): Properly handle

5303

+ size 8 for !TARGET_64BIT.

5304

+

5305

+2013-12-07 Ralf Corsépius <ralf.corsepius@rtems.org>

5306

+

5307

+ * config.gcc (microblaze*-*-rtems*): Add TARGET_BIG_ENDIAN_DEFAULT.

5308

+

5309

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

5310

+

5311

+ PR tree-optimization/59388

5312

+ * tree-ssa-reassoc.c (update_range_test): If op == range->exp,

5313

+ gimplify tem after stmt rather than before it.

5314

+

5315

+2013-12-06 Oleg Endo <olegendo@gcc.gnu.org>

5316

+

5317

+ Backport from mainline

5318

+ 2013-11-26 Oleg Endo <olegendo@gcc.gnu.org>

5319

+

5320

+ PR target/58314

5321

+ PR target/50751

5322

+ * config/sh/sh.c (max_mov_insn_displacement, disp_addr_displacement):

5323

+ Prefix function names with 'sh_'. Make them non-static.

5324

+ * config/sh/sh-protos.h (sh_disp_addr_displacement,

5325

+ sh_max_mov_insn_displacement): Add declarations.

5326

+ * config/sh/constraints.md (Q): Reject QImode.

5327

+ (Sdd): Use match_code "mem".

5328

+ (Snd): Fix erroneous matching of non-memory operands.

5329

+ * config/sh/predicates.md (short_displacement_mem_operand): New

5330

+ predicate.

5331

+ (general_movsrc_operand): Disallow PC relative QImode loads.

5332

+ * config/sh/sh.md (*mov<mode>_reg_reg): Remove it.

5333

+ (*movqi, *movhi): Merge both insns into...

5334

+ (*mov<mode>): ... this new insn. Replace generic 'm' constraints with

5335

+ 'Snd' and 'Sdd' constraints. Calculate insn length dynamically based

5336

+ on the operand types.

5337

+

5338

+2013-12-06 Richard Biener <rguenther@suse.de>

5339

+

5340

+ Backport from mainline

5341

+ 2013-11-29 Richard Biener <rguenther@suse.de>

5342

+

5343

+ PR tree-optimization/59334

5344

+ * tree-ssa-dce.c (eliminate_unnecessary_stmts): Fix bug

5345

+ in previous commit.

5346

+

5347

+ 2013-11-28 Richard Biener <rguenther@suse.de>

5348

+

5349

+ PR tree-optimization/59330

5350

+ * tree-ssa-dce.c (eliminate_unnecessary_stmts): Simplify

5351

+ and fix delayed marking of free calls not necessary.

5352

+

5353

+2013-12-06 Richard Biener <rguenther@suse.de>

5354

+

5355

+ Backport from mainline

5356

+ 2013-11-27 Richard Biener <rguenther@suse.de>

5357

+

5358

+ PR tree-optimization/59288

5359

+ * tree-vect-loop.c (get_initial_def_for_induction): Do not

5360

+ re-analyze the PHI but use STMT_VINFO_LOOP_PHI_EVOLUTION_PART.

5361

+

5362

+ 2013-11-19 Richard Biener <rguenther@suse.de>

5363

+

5364

+ PR tree-optimization/59164

5365

+ * tree-vect-loop.c (vect_analyze_loop_operations): Adjust

5366

+ check whether we can create an epilogue loop to reflect the

5367

+ cases where we create one.

5368

+

5369

+ 2013-09-05 Richard Biener <rguenther@suse.de>

5370

+

5371

+ PR tree-optimization/58137

5372

+ * tree-vect-stmts.c (get_vectype_for_scalar_type_and_size):

5373

+ Do not create vectors of pointers.

5374

+ * tree-vect-loop.c (get_initial_def_for_induction): Use proper

5375

+ types for the components of the vector initializer.

5376

+ * tree-cfg.c (verify_gimple_assign_binary): Remove special-casing

5377

+ allowing pointer vectors with PLUS_EXPR/MINUS_EXPR.

5378

+

5379

+2013-12-06 Oleg Endo <olegendo@gcc.gnu.org>

5380

+

5381

+ PR target/51244

5382

+ PR target/59343

5383

+ * config/sh/sh.md (*cbranch_t): Check that there are no labels between

5384

+ the s1 insn and the testing insn. Remove REG_DEAD note from s1 insn.

5385

+

5386

+2013-12-05 Richard Biener <rguenther@suse.de>

5387

+

5388

+ Backport from mainline

5389

+ 2013-11-19 Richard Biener <rguenther@suse.de>

5390

+

5391

+ PR middle-end/58956

5392

+ * tree-ssa-ter.c (find_replaceable_in_bb): Avoid forwarding

5393

+ loads into stmts that may clobber it.

5394

+

5395

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

5396

+

5397

+ PR rtl-optimization/58726

5398

+ * combine.c (force_to_mode): Fix comment typo. Don't destructively

5399

+ modify x for ROTATE, ROTATERT and IF_THEN_ELSE.

5400

+

5401

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

5402

+ Uros Bizjak <ubizjak@gmail.com>

5403

+

5404

+ PR target/59163

5405

+ * config/i386/i386.c (ix86_legitimate_combined_insn): If for

5406

+ !TARGET_AVX there is misaligned MEM operand with vector mode

5407

+ and get_attr_ssememalign is 0, return false.

5408

+ (ix86_expand_special_args_builtin): Add get_pointer_alignment

5409

+ computed alignment and for non-temporal loads/stores also

5410

+ at least GET_MODE_ALIGNMENT as MEM_ALIGN.

5411

+ * config/i386/sse.md

5412

+ (<sse>_loadu<ssemodesuffix><avxsizesuffix>,

5413

+ <sse>_storeu<ssemodesuffix><avxsizesuffix>,

5414

+ <sse2>_loaddqu<avxsizesuffix>,

5415

+ <sse2>_storedqu<avxsizesuffix>, <sse3>_lddqu<avxsizesuffix>,

5416

+ sse_vmrcpv4sf2, sse_vmrsqrtv4sf2, sse2_cvtdq2pd, sse_movhlps,

5417

+ sse_movlhps, sse_storehps, sse_loadhps, sse_loadlps,

5418

+ *vec_interleave_highv2df, *vec_interleave_lowv2df,

5419

+ *vec_extractv2df_1_sse, sse2_loadhpd, sse2_loadlpd, sse2_movsd,

5420

+ sse4_1_<code>v8qiv8hi2, sse4_1_<code>v4qiv4si2,

5421

+ sse4_1_<code>v4hiv4si2, sse4_1_<code>v2qiv2di2,

5422

+ sse4_1_<code>v2hiv2di2, sse4_1_<code>v2siv2di2, sse4_2_pcmpestr,

5423

+ *sse4_2_pcmpestr_unaligned, sse4_2_pcmpestri, sse4_2_pcmpestrm,

5424

+ sse4_2_pcmpestr_cconly, sse4_2_pcmpistr, *sse4_2_pcmpistr_unaligned,

5425

+ sse4_2_pcmpistri, sse4_2_pcmpistrm, sse4_2_pcmpistr_cconly): Add

5426

+ ssememalign attribute.

5427

+ * config/i386/i386.md (ssememalign): New define_attr.

5428

+

5429

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

5430

+

5431

+ PR middle-end/59011

5432

+ * gimplify.c (nonlocal_vla_vars): New variable.

5433

+ (gimplify_var_or_parm_decl): Put VAR_DECLs for VLAs into

5434

+ nonlocal_vla_vars chain.

5435

+ (gimplify_body): Call declare_vars on nonlocal_vla_vars chain

5436

+ if outer_bind has DECL_INITIAL (current_function_decl) block.

5437

+

5438

+ PR target/58864

5439

+ * optabs.c (emit_conditional_move): Save and restore

5440

+ pending_stack_adjust and stack_pointer_delta if cmove can't be used.

5441

+

5442

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

5443

+

5444

+ PR tree-optimization/59358

5445

+ * tree-vrp.c (union_ranges): To check for the partially

5446

+ overlapping ranges or adjacent ranges, also compare *vr0max

5447

+ with vr1max.

5448

+

5449

+2013-12-02 Richard Biener <rguenther@suse.de>

5450

+

5451

+ PR tree-optimization/59139

5452

+ * tree-ssa-loop-niter.c (chain_of_csts_start): Properly match

5453

+ code in get_val_for.

5454

+ (get_val_for): Use gcc_checking_asserts.

5455

+

5456

+2013-11-27 Tom de Vries <tom@codesourcery.com>

5457

+ Marc Glisse <marc.glisse@inria.fr>

5458

+

5459

+ PR middle-end/59037

5460

+ * fold-const.c (fold_indirect_ref_1): Don't create out-of-bounds

5461

+ BIT_FIELD_REF.

5462

+ * gimplify.c (gimple_fold_indirect_ref): Same.

5463

+

5464

+2013-12-01 Eric Botcazou <ebotcazou@adacore.com>

5465

+

5466

+ * config/i386/winnt.c (i386_pe_asm_named_section): Be prepared for an

5467

+ identifier node.

5468

+

5469

+2013-12-01 Bernd Edlinger <bernd.edlinger@hotmail.de>

5470

+

5471

+ * expr.c (emit_group_store): Fix off-by-one BITFIELD_END argument.

5472

+

5473

+2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

5474

+

5475

+ Backport from mainline

5476

+ 2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

5477

+

5478

+ * config/arm/iterators.md (vrint_conds): New int attribute.

5479

+ * config/arm/vfp.md (<vrint_pattern><SDF:mode>2): Set conds attribute.

5480

+ (smax<mode>3): Likewise.

5481

+ (smin<mode>3): Likewise.

5482

+

5483

+2013-11-28 Uros Bizjak <ubizjak@gmail.com>

5484

+

5485

+ Backport from mainline

5486

+ 2013-11-27 Uros Bizjak <ubizjak@gmail.com>

5487

+ Ganesh Gopalasubramanian <Ganesh.Gopalasubramanian@amd.com>

5488

+

5489

+ PR target/56788

5490

+ * gcc.target/i386/xop-frczX.c: New test.

5491

+

5492

+2013-11-28 Terry Guo <terry.guo@arm.com>

5493

+

5494

+ Backport mainline r205391

5495

+ 2013-11-26 Terry Guo <terry.guo@arm.com>

5496

+

5497

+ * config/arm/arm.c (require_pic_register): Handle high pic base

5498

+ register for thumb-1.

5499

+ (arm_load_pic_register): Also initialize high pic base register.

5500

+ * doc/invoke.texi: Update documentation for option -mpic-register.

5501

+

5502

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

5503

+

5504

+ Backported from mainline

5505

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

5506

+

5507

+ PR tree-optimization/59014

5508

+ * tree-vrp.c (register_edge_assert_for_1): Don't look

5509

+ through conversions from non-integral types or through

5510

+ narrowing conversions.

5511

+

5512

+2013-11-27 Eric Botcazou <ebotcazou@adacore.com>

5513

+

5514

+ PR middle-end/59138

5515

+ * expr.c (emit_group_store): Don't write past the end of the structure.

5516

+ (store_bit_field): Fix formatting.

5517

+

5518

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5519

+

5520

+ Backport from mainline

5521

+ 2013-09-17 Sebastian Huber <sebastian.huber@embedded-brains.de>

5522

+

5523

+ * config/sparc/t-rtems: Add leon3 multilibs.

5524

+

5525

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5526

+

5527

+ Backport from mainline

5528

+ 2013-08-09 Eric Botcazou <ebotcazou@adacore.com>

5529

+

5530

+ * configure.ac: Add GAS check for LEON instructions on SPARC.

5531

+ * configure: Regenerate.

5532

+ * config.in: Likewise.

5533

+ * config.gcc (with_cpu): Remove sparc-leon*-* and deal with LEON in the

5534

+ sparc*-*-* block.

5535

+ * config/sparc/sparc.opt (LEON, LEON3): New masks.

5536

+ * config/sparc/sparc.h (ASM_CPU32_DEFAULT_SPEC): Set to AS_LEON_FLAG

5537

+ for LEON or LEON3.

5538

+ (ASM_CPU_SPEC): Pass AS_LEON_FLAG if -mcpu=leon or -mcpu=leon3.

5539

+ (AS_LEON_FLAG): New macro.

5540

+ * config/sparc/sparc.c (sparc_option_override): Set MASK_LEON for leon

5541

+ and MASK_LEON3 for leon3 and unset them if HAVE_AS_LEON is not defined.

5542

+ Deal with LEON and LEON3 for the memory model.

5543

+ * config/sparc/sync.md (atomic_compare_and_swap<mode>): Enable if LEON3

5544

+ (atomic_compare_and_swap<mode>_1): Likewise.

5545

+ (*atomic_compare_and_swap<mode>_1): Likewise.

5546

+

5547

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5548

+

5549

+ Backport from mainline

5550

+ 2013-07-23 Eric Botcazou <ebotcazou@adacore.com>

5551

+

5552

+ * doc/invoke.texi (SPARC Options): Document new leon3 processor value.

5553

+

5554

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5555

+

5556

+ Backport from mainline

5557

+ 2013-07-22 Eric Botcazou <ebotcazou@adacore.com>

5558

+

5559

+ * config.gcc (sparc*-*-*): Accept leon3 processor.

5560

+ (sparc-leon*-*): Merge with sparc*-*-* and add leon3 support.

5561

+ * doc/invoke.texi (SPARC Options): Adjust -mfix-ut699 entry.

5562

+ * config/sparc/sparc-opts.h (enum processor_type): Add PROCESSOR_LEON3.

5563

+ * config/sparc/sparc.opt (enum processor_type): Add leon3.

5564

+ (mfix-ut699): Adjust comment.

5565

+ * config/sparc/sparc.h (TARGET_CPU_leon3): New define.

5566

+ (CPP_CPU32_DEFAULT_SPEC): Add leon3 support.

5567

+ (CPP_CPU_SPEC): Likewise.

5568

+ (ASM_CPU_SPEC): Likewise.

5569

+ * config/sparc/sparc.c (leon3_cost): New constant.

5570

+ (sparc_option_override): Add leon3 support.

5571

+ (mem_ref): New function.

5572

+ (sparc_gate_work_around_errata): Return true if -mfix-ut699 is enabled.

5573

+ (sparc_do_work_around_errata): Look into the instruction in the delay

5574

+ slot and adjust accordingly. Add fix for the data cache nullify issues

5575

+ of the UT699. Change insertion position for the NOP.

5576

+ * config/sparc/leon.md (leon_fpalu, leon_fpmds, write_buf): Delete.

5577

+ (leon3_load): New reservation.

5578

+ (leon_store): Bump latency to 2.

5579

+ (grfpu): New automaton.

5580

+ (grfpu_alu): New unit.

5581

+ (grfpu_ds): Likewise.

5582

+ (leon_fp_alu): Adjust.

5583

+ (leon_fp_mult): Delete.

5584

+ (leon_fp_div): Split into leon_fp_divs and leon_fp_divd.

5585

+ (leon_fp_sqrt): Split into leon_fp_sqrts and leon_fp_sqrtd.

5586

+ * config/sparc/sparc.md (cpu): Add leon3.

5587

+ * config/sparc/sync.md (atomic_exchangesi): Disable if -mfix-ut699.

5588

+ (swapsi): Likewise.

5589

+ (atomic_test_and_set): Likewise.

5590

+ (ldstub): Likewise.

5591

+

5592

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5593

+

5594

+ Backport from mainline

5595

+ 2013-04-10 Steven Bosscher <steven@gcc.gnu.org>

5596

+

5597

+ * config/sparc/sparc.c: Include tree-pass.h.

5598

+ (TARGET_MACHINE_DEPENDENT_REORG): Do not redefine.

5599

+ (sparc_reorg): Rename to sparc_do_work_around_errata. Move to

5600

+ head of file. Change return type. Split off gate function.

5601

+ (sparc_gate_work_around_errata): New function.

5602

+ (pass_work_around_errata): New pass definition.

5603

+ (insert_pass_work_around_errata) New pass insert definition to

5604

+ insert pass_work_around_errata just after delayed-branch scheduling.

5605

+ (sparc_option_override): Insert the pass.

5606

+ * config/sparc/t-sparc (sparc.o): Add TREE_PASS_H dependence.

5607

+

5608

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

5609

+

5610

+ Backport from mainline

5611

+ 2013-05-28 Eric Botcazou <ebotcazou@adacore.com>

5612

+

5613

+ * doc/invoke.texi (SPARC Options): Document -mfix-ut699.

5614

+ * builtins.c (expand_builtin_mathfn) <BUILT_IN_SQRT>: Try to widen the

5615

+ mode if the instruction isn't available in the original mode.

5616

+ * config/sparc/sparc.opt (mfix-ut699): New option.

5617

+ * config/sparc/sparc.md (muldf3_extend): Disable if -mfix-ut699.

5618

+ (divdf3): Turn into expander.

5619

+ (divdf3_nofix): New insn.

5620

+ (divdf3_fix): Likewise.

5621

+ (divsf3): Disable if -mfix-ut699.

5622

+ (sqrtdf2): Turn into expander.

5623

+ (sqrtdf2_nofix): New insn.

5624

+ (sqrtdf2_fix): Likewise.

5625

+ (sqrtsf2): Disable if -mfix-ut699.

5626

+

5627

+2013-11-22 Eric Botcazou <ebotcazou@adacore.com>

5628

+

5629

+ * print-rtl.c (print_rtx) <case MEM>: Output a space if no MEM_EXPR.

5630

+

5631

+2013-11-21 Zhenqiang Chen <zhenqiang.chen@linaro.org>

5632

+

5633

+ PR bootstrap/57683

5634

+ Backport from mainline: r197467 and r198999.

5635

+ 2013-04-03 Jeff Law <law@redhat.com>

5636

+

5637

+ * Makefile.in (lra-constraints.o): Depend on $(OPTABS_H).

5638

+ (lra-eliminations.o): Likewise.

5639

+

5640

+ 2013-05-16 Jeff Law <law@redhat.com>

5641

+

5642

+ * Makefile.in (tree-switch-conversion.o): Depend on $(OPTABS_H).

5643

+

5644

+2013-11-20 Eric Botcazou <ebotcazou@adacore.com>

5645

+

5646

+ PR target/59207

5647

+ * config/sparc/sparc.c (sparc_fold_builtin) <case CODE_FOR_pdist_vis>:

5648

+ Make sure neg2_ovf is set before being used.

5649

+

5650

+2013-11-20 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5651

+ Dominik Vogt <vogt@linux.vnet.ibm.com>

5652

+

5653

+ Backport from mainline

5654

+ * config/s390/s390.c (s390_canonicalize_comparison): Don't fold

5655

+ int comparisons with an out of range condition code.

5656

+ (s390_optimize_nonescaping_tx): Skip empty BBs.

5657

+ Generate the new tbegin RTX when removing the FPR clobbers (with

5658

+ two SETs).

5659

+ (s390_expand_tbegin): Fix the retry loop counter. Copy CC to the

5660

+ result before doing the retry calculations.

5661

+ (s390_init_builtins): Make tbegin "returns_twice" and tabort

5662

+ "noreturn".

5663

+ * config/s390/s390.md (UNSPECV_TBEGIN_TDB): New constant used for

5664

+ the TDB setting part of an tbegin.

5665

+ ("tbegin_1", "tbegin_nofloat_1"): Add a set for the TDB.

5666

+ ("tx_assist"): Set unused argument to an immediate zero instead of

5667

+ loading zero into a GPR and pass it as argument.

5668

+ * config/s390/htmxlintrin.h (__TM_simple_begin, __TM_begin):

5669

+ Remove inline and related attributes.

5670

+ (__TM_nesting_depth, __TM_is_user_abort, __TM_is_named_user_abort)

5671

+ (__TM_is_illegal, __TM_is_footprint_exceeded)

5672

+ (__TM_is_nested_too_deep, __TM_is_conflict): Fix format value

5673

+ check.

5674

+

5675

+2013-11-19 Uros Bizjak <ubizjak@gmail.com>

5676

+

5677

+ Backport from mainline

5678

+ 2013-11-18 Uros Bizjak <ubizjak@gmail.com>

5679

+

5680

+ * config/i386/i386.c (ix86_decompose_address): Use REG_P instead of

5681

+ ix86_address_subreg_operand. Move subreg checks to

5682

+ ix86_validate_address_register. Move address override check to

5683

+ ix86_legitimate_address_p.

5684

+ (ix86_validate_address_register): New function.

5685

+ (ix86_legitimate_address_p): Call ix86_validate_address_register

5686

+ to validate base and index registers. Add address override check

5687

+ from ix86_decompose_address.

5688

+ (ix86_decompose_address): Remove.

5689

+

5690

+ Backport from mainline

5691

+ 2013-11-17 Uros Bizjak <ubizjak@gmail.com>

5692

+

5693

+ PR target/59153

5694

+ * config/i386/i386.c (ix86_address_subreg_operand): Do not

5695

+ reject non-integer subregs.

5696

+ (ix86_decompose_address): Do not reject invalid CONST_INT RTXes.

5697

+ Move check for invalid x32 constant addresses ...

5698

+ (ix86_legitimate_address_p): ... here.

5699

+

5700

+2013-11-19 Richard Biener <rguenther@suse.de>

5701

+

5702

+ Backport from mainline

5703

+ 2013-11-07 Richard Biener <rguenther@suse.de>

5704

+

5705

+ * tree-dfa.c (get_ref_base_and_extent): Fix casting.

5706

+

5707

+2013-11-19 Richard Biener <rguenther@suse.de>

5708

+

5709

+ PR tree-optimization/57517

5710

+ * tree-predcom.c (combinable_refs_p): Verify the combination

5711

+ is always executed when the refs are.

5712

+

5713

+2013-11-19 Richard Biener <rguenther@suse.de>

5714

+

5715

+ Backport from mainline

5716

+ 2013-11-05 Richard Biener <rguenther@suse.de>

5717

+

5718

+ PR middle-end/58941

5719

+ * tree-dfa.c (get_ref_base_and_extent): Merge common code

5720

+ in MEM_REF and TARGET_MEM_REF handling. Make sure to

5721

+ process trailing array detection before diving into the

5722

+ view-converted object (and possibly apply some extra offset).

5723

+

5724

+2013-11-18 Richard Biener <rguenther@suse.de>

5725

+

5726

+ Backport from mainline

5727

+ 2013-10-21 Richard Biener <rguenther@suse.de>

5728

+

5729

+ PR tree-optimization/58794

5730

+ * fold-const.c (operand_equal_p): Compare FIELD_DECL operand

5731

+ of COMPONENT_REFs with OEP_CONSTANT_ADDRESS_OF left in place.

5732

+

5733

+ 2013-10-21 Richard Biener <rguenther@suse.de>

5734

+

5735

+ PR middle-end/58742

5736

+ * fold-const.c (fold_binary_loc): Fold ((T) (X /[ex] C)) * C

5737

+ to (T) X for sign-changing conversions (or no conversion).

5738

+

5739

+ 2013-11-06 Richard Biener <rguenther@suse.de>

5740

+

5741

+ PR tree-optimization/58653

5742

+ * tree-predcom.c (ref_at_iteration): Rewrite to generate

5743

+ a MEM_REF.

5744

+ (prepare_initializers_chain): Adjust.

5745

+

5746

+ PR tree-optimization/59047

5747

+ * tree-predcom.c (ref_at_iteration): Handle bitfield accesses

5748

+ properly.

5749

+

5750

+ 2013-10-15 Richard Biener <rguenther@suse.de>

5751

+

5752

+ PR tree-optimization/58143

5753

+ * tree-ssa-loop-im.c (arith_code_with_undefined_signed_overflow):

5754

+ New function.

5755

+ (rewrite_to_defined_overflow): Likewise.

5756

+ (move_computations_dom_walker::before_dom): Rewrite stmts

5757

+ with undefined signed overflow that are not always executed

5758

+ into unsigned arithmetic.

5759

+

5760

+2013-11-14 Uros Bizjak <ubizjak@gmail.com>

5761

+

5762

+ Backport from mainline

5763

+ 2013-11-10 Uros Bizjak <ubizjak@gmail.com>

5764

+

5765

+ * mode-switching.c (optimize_mode_switching): Mark block as

5766

+ nontransparent, if last_mode at block exit is different from no_mode.

5767

+

5768

+ Backport from mainline

5769

+ 2013-11-06 Uros Bizjak <ubizjak@gmail.com>

5770

+

5771

+ PR target/59021

5772

+ * config/i386/i386.c (ix86_avx_u128_mode_needed): Require

5773

+ AVX_U128_DIRTY mode for call_insn RTXes that use AVX256 registers.

5774

+ (ix86_avx_u128_mode_needed): Return AVX_U128_DIRTY mode for call_insn

5775

+ RTXes that return in AVX256 register.

5776

+

5777

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

5778

+ Uros Bizjak <ubizjak@gmail.com>

5779

+

5780

+ PR target/59101

5781

+ * config/i386/i386.md (*anddi_2): Only allow CCZmode if

5782

+ operands[2] satisfies_constraint_Z that might have bit 31 set.

5783

+

5784

+2013-11-12 H.J. Lu <hongjiu.lu@intel.com>

5785

+

5786

+ Backported from mainline

5787

+ 2013-11-12 H.J. Lu <hongjiu.lu@intel.com>

5788

+

5789

+ PR target/59088

5790

+ * config/i386/i386.c (initial_ix86_tune_features): Set

5791

+ X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL and

5792

+ X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL for m_HASWELL.

5793

+

5794

+2013-11-11 Ramana Radhakrishnan <ramana.radhakrishnan@arm.com>

5795

+

5796

+ Backported from mainline

5797

+ 2013-10-30 Ramana Radhakrishnan <ramana.radhakrishnan@arm.com>

5798

+

5799

+ PR target/58854

5800

+ * config/arm/arm.c (arm_expand_epilogue_apcs_frame): Emit blockage

5801

+

5802

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

5803

+

5804

+ Backported from mainline

5805

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

5806

+

5807

+ PR middle-end/58970

5808

+ * expr.c (get_bit_range): Handle *offset == NULL_TREE.

5809

+ (expand_assignment): If *bitpos is negative, set *offset

5810

+ and adjust *bitpos, so that it is not negative.

5811

+

5812

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

5813

+

5814

+ PR rtl-optimization/58997

5815

+ * loop-iv.c (iv_subreg): For IV_UNKNOWN_EXTEND, expect

5816

+ get_iv_value to be in iv->mode rather than iv->extend_mode.

5817

+ (iv_extend): Likewise. Otherwise, if iv->extend != extend,

5818

+ use lowpart_subreg on get_iv_value before calling simplify_gen_unary.

5819

+ * loop-unswitch.c (may_unswitch_on): Make sure op[i] is in the right

5820

+ mode.

5821

+

5822

+2013-11-10 Karlson2k <k2k@narod.ru>

5823

+ Kai Tietz <ktietz@redhat.com>

5824

+

5825

+ Merged from trunk

5826

+ PR plugins/52872

5827

+ * configure.ac: Adding for exported symbols check

5828

+ and for rdynamic-check executable-extension.

5829

+ * configure: Regenerated.

5830

+

5831

+2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

5832

+

5833

+ PR target/59034

5834

+ * config/i386/i386.md (push peepholer/splitter): Use Pmode

5835

+ with stack_pointer_rtx.

5836

+

5837

+2013-11-05 Uros Bizjak <ubizjak@gmail.com>

5838

+

5839

+ * config/i386/t-rtems (MULTILIB_MATCHES): Fix option typos.

5840

+

5841

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

5842

+

5843

+ PR tree-optimization/58984

5844

+ * ipa-prop.c (ipa_load_from_parm_agg_1): Add SIZE_P argument,

5845

+ set *SIZE_P if non-NULL on success.

5846

+ (ipa_load_from_parm_agg, ipa_analyze_indirect_call_uses): Adjust

5847

+ callers.

5848

+ (ipcp_transform_function): Likewise. Punt if size of access

5849

+ is different from TYPE_SIZE on v->value's type.

5850

+

5851

+2013-11-03 H.J. Lu <hongjiu.lu@intel.com>

5852

+

5853

+ Backport from mainline

5854

+ 2013-10-12 H.J. Lu <hongjiu.lu@intel.com>

5855

+

5856

+ PR target/58690

5857

+ * config/i386/i386.c (ix86_copy_addr_to_reg): New function.

5858

+ (ix86_expand_movmem): Replace copy_addr_to_reg with

5859

+ ix86_copy_addr_to_reg.

5860

+ (ix86_expand_setmem): Likewise.

5861

+

5862

+2013-10-29 Uros Bizjak <ubizjak@gmail.com>

5863

+

5864

+ Backport from mainline

5865

+ 2013-08-08 Richard Sandiford <rdsandiford@googlemail.com>

5866

+

5867

+ PR rtl-optimization/58079

5868

+ * combine.c (combine_simplify_rtx): Avoid using SUBST if

5869

+ simplify_comparison has widened a comparison with an integer.

5870

+

5871

+2013-10-29 Martin Jambor <mjambor@suse.cz>

5872

+

5873

+ PR middle-end/58789

5874

+ Backport from mainline

5875

+ 2013-05-09 Martin Jambor <mjambor@suse.cz>

5876

+

5877

+ PR lto/57084

5878

+ * gimple-fold.c (canonicalize_constructor_val): Call

5879

+ cgraph_get_create_real_symbol_node instead of cgraph_get_create_node.

5880

+

5881

+ Backport from mainline

5882

+ 2013-03-16 Jan Hubicka <jh@suse.cz>

5883

+

5884

+ * cgraph.h (cgraph_get_create_real_symbol_node): Declare.

5885

+ * cgraph.c (cgraph_get_create_real_symbol_node): New function.

5886

+ * cgrpahbuild.c: Use cgraph_get_create_real_symbol_node instead

5887

+ of cgraph_get_create_node.

5888

+ * ipa-prop.c (ipa_make_edge_direct_to_target): Likewise.

5889

+

5890

+2013-10-28 Tom de Vries <tom@codesourcery.com>

5891

+

5892

+ * cfgexpand.c (gimple_expand_cfg): Remove test for parm_birth_insn.

5893

+ Don't commit insertions after NOTE_INSN_FUNCTION_BEG.

5894

+

5895

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

5896

+

5897

+ Backport from mainline

5898

+ 2013-10-22 Uros Bizjak <ubizjak@gmail.com>

5899

+

5900

+ PR target/58779

5901

+ * config/i386/i386.c (put_condition_code) <case GTU, case LEU>:

5902

+ Remove CCCmode handling.

5903

+ <case LTU>: Return 'c' suffix for CCCmode.

5904

+ <case GEU>: Return 'nc' suffix for CCCmode.

5905

+ (ix86_cc_mode) <case GTU, case LEU>: Do not generate overflow checks.

5906

+ * config/i386/i386.md (*sub<mode>3_cconly_overflow): Remove.

5907

+ (*sub<mode>3_cc_overflow): Ditto.

5908

+ (*subsi3_zext_cc_overflow): Ditto.

5909

+

5910

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

5911

+

5912

+ Backport from mainline

5913

+ 2013-10-19 Uros Bizjak <ubizjak@gmail.com>

5914

+

5915

+ PR target/58792

5916

+ * config/i386/i386.c (ix86_function_value_regno): Add DX_REG,

5917

+ ST1_REG and XMM1_REG for 32bit and 64bit targets. Also add DI_REG

5918

+ and SI_REG for 64bit SYSV ABI targets.

5919

+

5920

+2013-08-25 Richard Henderson <rth@twiddle.net>

5921

+

5922

+ PR rtl/58542

5923

+ * optabs.c (maybe_emit_atomic_exchange): Use create_input_operand

5924

+ instead of create_convert_operand_to.

5925

+ (maybe_emit_sync_lock_test_and_set): Likewise.

5926

+ (expand_atomic_compare_and_swap): Likewise.

5927

+ (maybe_emit_compare_and_swap_exchange_loop): Don't convert_modes.

5928

+

5929

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

5930

+

5931

+ PR rtl-optimization/58831

5932

+ * alias.c (init_alias_analysis): At the beginning of each iteration, set

5933

+ the reg_seen[N] bit if static_reg_base_value[N] is non-null.

5934

+

5935

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

5936

+

5937

+ * recog.c (search_ofs): New static variable moved from...

5938

+ (peep2_find_free_register): ...here.

5939

+ (peephole2_optimize): Initialize it.

5940

+

5941

+2013-10-24 David Edelsohn <dje.gcc@gmail.com>

5942

+

5943

+ Backport from mainline

5944

+ 2013-10-23 David Edelsohn <dje.gcc@gmail.com>

5945

+

5946

+ PR target/58838

5947

+ * config/rs6000/rs6000.md (mulsi3_internal1 and splitter): Add

5948

+ TARGET_32BIT final condition.

5949

+ (mulsi3_internal2 and splitter): Same.

5950

+

5951

+2013-10-23 Tom de Vries <tom@codesourcery.com>

5952

+

5953

+ PR tree-optimization/58805

5954

+ * tree-ssa-tail-merge.c (stmt_local_def): Add gimple_vdef check.

5955

+

5956

+2013-10-23 Richard Biener <rguenther@suse.de>

5957

+

5958

+ Backport from mainline

5959

+ 2013-06-24 Richard Biener <rguenther@suse.de>

5960

+

5961

+ PR tree-optimization/57488

5962

+ * tree-ssa-pre.c (insert): Clear NEW sets before each iteration.

5963

+

5964

+2013-10-16 Ganesh Gopalasubramanian <Ganesh.Gopalasubramanian@amd.com>

5965

+

5966

+ Backport from mainline

5967

+ 2013-10-16 Ganesh Gopalasubramanian

5968

+ <Ganesh.Gopalasubramanian@amd.com>

5969

+

5970

+ * config/i386/i386.c (ix86_option_override_internal): Enable FMA4

5971

+ for AMD bdver3.

5972

+

5973

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

5974

+

5975

+ * BASE-VER: Set to 4.8.3.

5976

+ * DEV-PHASE: Set to prerelease.

5977

+

5978

2013-10-16 Release Manager

5979

5980

* GCC 4.8.2 released.

5981

@@ -639,7 +1666,7 @@

5982

2013-07-31 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5983

5984

Backport from mainline

5985

- 2013-03-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5986

+ 2013-03-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

5987

5988

* config/s390/s390.h (TARGET_FLT_EVAL_METHOD): Define.

5989

5990

Index: gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c

5991

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

5992

--- a/src/gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c (.../tags/gcc_4_8_2_release)

5993

+++ b/src/gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c (.../branches/gcc-4_8-branch)

5994

@@ -0,0 +1,11 @@

5995

+/* { dg-do compile } */

5996

+/* { dg-require-effective-target arm_thumb1_ok } */

5997

+/* { dg-options "-mthumb -fpic -msingle-pic-base" } */

5998

+

5999

+int g_test;

6000

+

6001

+int

6002

+foo (int par)

6003

+{

6004

+ g_test = par;

6005

+}

6006

Index: gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c

6007

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

6008

--- a/src/gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c (.../tags/gcc_4_8_2_release)

6009

+++ b/src/gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c (.../branches/gcc-4_8-branch)

6010

@@ -0,0 +1,11 @@

6011

+/* { dg-do compile } */

6012

+/* { dg-require-effective-target arm_thumb1_ok } */

6013

+/* { dg-options "-mthumb -fpic -mpic-register=9" } */

6014

+

6015

+int g_test;

6016

+

6017

+int

6018

+foo (int par)

6019

+{

6020

+ g_test = par;

6021

+}

6022

Index: gcc/testsuite/gcc.target/arm/require-pic-register-loc.c

6023

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

6024

--- a/src/gcc/testsuite/gcc.target/arm/require-pic-register-loc.c (.../tags/gcc_4_8_2_release)

6025

+++ b/src/gcc/testsuite/gcc.target/arm/require-pic-register-loc.c (.../branches/gcc-4_8-branch)

6026

@@ -0,0 +1,29 @@

6027

+/* { dg-do compile } */

6028

+/* { dg-options "-g -fPIC" } */

6029

+

6030

+void *v;

6031

+void a (void *x) { }

6032

+void b (void) { }

6033

+ /* line 7. */

6034

+int /* line 8. */

6035

+main (int argc) /* line 9. */

6036

+{ /* line 10. */

6037

+ if (argc == 12345) /* line 11. */

6038

+ {

6039

+ a (v);

6040

+ return 1;

6041

+ }

6042

+ b ();

6043

+

6044

+ return 0;

6045

+}

6046

+

6047

+/* { dg-final { scan-assembler-not "\.loc 1 7 0" } } */

6048

+/* { dg-final { scan-assembler-not "\.loc 1 8 0" } } */

6049

+/* { dg-final { scan-assembler-not "\.loc 1 9 0" } } */

6050

+

6051

+/* The loc at the start of the prologue. */

6052

+/* { dg-final { scan-assembler-times "\.loc 1 10 0" 1 } } */

6053

+

6054

+/* The loc at the end of the prologue, with the first user line. */

6055

+/* { dg-final { scan-assembler-times "\.loc 1 11 0" 1 } } */

6056

Index: gcc/testsuite/gcc.target/arm/vrinta-ce.c

6057

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

6058

--- a/src/gcc/testsuite/gcc.target/arm/vrinta-ce.c (.../tags/gcc_4_8_2_release)

6059

+++ b/src/gcc/testsuite/gcc.target/arm/vrinta-ce.c (.../branches/gcc-4_8-branch)

6060

@@ -0,0 +1,15 @@

6061

+/* { dg-do compile } */

6062

+/* { dg-require-effective-target arm_v8_vfp_ok } */

6063

+/* { dg-options "-O2 -marm -march=armv8-a" } */

6064

+/* { dg-add-options arm_v8_vfp } */

6065

+

6066

+double foo (double a)

6067

+{

6068

+ if (a > 3.0)

6069

+ return __builtin_round (a);

6070

+

6071

+ return 0.0;

6072

+}

6073

+

6074

+/* { dg-final { scan-assembler-times "vrinta.f64\td\[0-9\]+" 1 } } */

6075

+

6076

Index: gcc/testsuite/gcc.target/arm/pr54300.C

6077

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

6078

--- a/src/gcc/testsuite/gcc.target/arm/pr54300.C (.../tags/gcc_4_8_2_release)

6079

+++ b/src/gcc/testsuite/gcc.target/arm/pr54300.C (.../branches/gcc-4_8-branch)

6080

@@ -0,0 +1,61 @@

6081

+/* { dg-do run } */

6082

+/* { dg-require-effective-target arm_neon } */

6083

+/* { dg-options "-O2" } */

6084

+/* { dg-add-options arm_neon } */

6085

+

6086

+#include <arm_neon.h>

6087

+#include <stdlib.h>

6088

+

6089

+struct __attribute__ ((aligned(8))) _v16u8_ {

6090

+ uint8x16_t val;

6091

+ _v16u8_( const int16x8_t &src) { val = vreinterpretq_u8_s16(src); }

6092

+ operator int16x8_t () const { return vreinterpretq_s16_u8(val); }

6093

+};

6094

+typedef struct _v16u8_ v16u8;

6095

+

6096

+struct __attribute__ ((aligned(4))) _v8u8_ {

6097

+ uint8x8_t val;

6098

+ _v8u8_( const uint8x8_t &src) { val = src; }

6099

+ operator int16x4_t () const { return vreinterpret_s16_u8(val); }

6100

+};

6101

+typedef struct _v8u8_ v8u8;

6102

+

6103

+typedef v16u8 v8i16;

6104

+typedef int32x4_t v4i32;

6105

+typedef const short cv1i16;

6106

+typedef const unsigned char cv1u8;

6107

+typedef const v8i16 cv8i16;

6108

+

6109

+static inline __attribute__((always_inline)) v8u8 zero_64(){ return vdup_n_u8( 0 ); }

6110

+

6111

+static inline __attribute__((always_inline)) v8i16 loadlo_8i16( cv8i16* p ){

6112

+ return vcombine_s16( vld1_s16( (cv1i16 *)p ), zero_64() );

6113

+}

6114

+static inline __attribute__((always_inline)) v8i16 _loadlo_8i16( cv8i16* p, int offset ){

6115

+ return loadlo_8i16( (cv8i16*)(&((cv1u8*)p)[offset]) );

6116

+}

6117

+

6118

+void __attribute__((noinline))

6119

+test(unsigned short *_Inp, int32_t *_Out,

6120

+ unsigned int s1v, unsigned int dv0,

6121

+ unsigned int smask_v)

6122

+{

6123

+ int32x4_t c = vdupq_n_s32(0);

6124

+

6125

+ for(unsigned int sv=0 ; sv!=dv0 ; sv=(sv+s1v)&smask_v )

6126

+ {

6127

+ int32x4_t s;

6128

+ s = vmovl_s16( vget_low_s16( _loadlo_8i16( (cv8i16*) _Inp, sv ) ) );

6129

+ c = vaddq_s32( c, s );

6130

+ }

6131

+ vst1q_s32( _Out, c );

6132

+}

6133

+

6134

+main()

6135

+{

6136

+ unsigned short a[4] = {1, 2, 3, 4};

6137

+ int32_t b[4] = {0, 0, 0, 0};

6138

+ test(a, b, 1, 1, ~0);

6139

+ if (b[0] != 1 || b[1] != 2 || b[2] != 3 || b[3] != 4)

6140

+ abort();

6141

+}

6142

Index: gcc/testsuite/gcc.target/powerpc/rs6000-ldouble-3.c

6143

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

6144

--- a/src/gcc/testsuite/gcc.target/powerpc/rs6000-ldouble-3.c (.../tags/gcc_4_8_2_release)

6145

+++ b/src/gcc/testsuite/gcc.target/powerpc/rs6000-ldouble-3.c (.../branches/gcc-4_8-branch)

6146

@@ -0,0 +1,21 @@

6147

+/* Test accuracy of long double division (glibc bug 15396). */

6148

+/* { dg-do run { target powerpc*-*-linux* powerpc*-*-darwin* powerpc*-*-aix* rs6000-*-* } } */

6149

+/* { dg-options "-mlong-double-128" } */

6150

+

6151

+extern void exit (int);

6152

+extern void abort (void);

6153

+

6154

+volatile long double a = 0x1p-1024L;

6155

+volatile long double b = 0x3p-53L;

6156

+volatile long double r;

6157

+volatile long double expected = 0x1.55555555555555555555555555p-973L;

6158

+

6159

+int

6160

+main (void)

6161

+{

6162

+ r = a / b;

6163

+ /* Allow error up to 2ulp. */

6164

+ if (__builtin_fabsl (r - expected) > 0x1p-1073L)

6165

+ abort ();

6166

+ exit (0);

6167

+}

6168

Index: gcc/testsuite/gcc.target/aarch64/scalar_intrinsics.c

6169

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

6170

--- a/src/gcc/testsuite/gcc.target/aarch64/scalar_intrinsics.c (.../tags/gcc_4_8_2_release)

6171

+++ b/src/gcc/testsuite/gcc.target/aarch64/scalar_intrinsics.c (.../branches/gcc-4_8-branch)

6172

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

6173

/* { dg-do compile } */

6174

/* { dg-options "-O2" } */

6175

6176

-#include "../../../config/aarch64/arm_neon.h"

6177

+#include <arm_neon.h>

6178

6179

+/* Used to force a variable to a SIMD register. */

6180

+#define force_simd(V1) asm volatile ("mov %d0, %1.d[0]" \

6181

+ : "=w"(V1) \

6182

+ : "w"(V1) \

6183

+ : /* No clobbers */);

6184

+

6185

/* { dg-final { scan-assembler-times "\\tadd\\tx\[0-9\]+" 2 } } */

6186

6187

uint64x1_t

6188

@@ -31,7 +37,12 @@

6189

uint64x1_t

6190

test_vceqd_s64 (int64x1_t a, int64x1_t b)

6191

{

6192

- return vceqd_s64 (a, b);

6193

+ uint64x1_t res;

6194

+ force_simd (a);

6195

+ force_simd (b);

6196

+ res = vceqd_s64 (a, b);

6197

+ force_simd (res);

6198

+ return res;

6199

}

6200

6201

/* { dg-final { scan-assembler-times "\\tcmeq\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6202

@@ -39,7 +50,11 @@

6203

uint64x1_t

6204

test_vceqzd_s64 (int64x1_t a)

6205

{

6206

- return vceqzd_s64 (a);

6207

+ uint64x1_t res;

6208

+ force_simd (a);

6209

+ res = vceqzd_s64 (a);

6210

+ force_simd (res);

6211

+ return res;

6212

}

6213

6214

/* { dg-final { scan-assembler-times "\\tcmge\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 2 } } */

6215

@@ -47,21 +62,36 @@

6216

uint64x1_t

6217

test_vcged_s64 (int64x1_t a, int64x1_t b)

6218

{

6219

- return vcged_s64 (a, b);

6220

+ uint64x1_t res;

6221

+ force_simd (a);

6222

+ force_simd (b);

6223

+ res = vcged_s64 (a, b);

6224

+ force_simd (res);

6225

+ return res;

6226

}

6227

6228

uint64x1_t

6229

test_vcled_s64 (int64x1_t a, int64x1_t b)

6230

{

6231

- return vcled_s64 (a, b);

6232

+ uint64x1_t res;

6233

+ force_simd (a);

6234

+ force_simd (b);

6235

+ res = vcled_s64 (a, b);

6236

+ force_simd (res);

6237

+ return res;

6238

}

6239

6240

-/* { dg-final { scan-assembler-times "\\tcmge\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6241

+/* Idiom recognition will cause this testcase not to generate

6242

+ the expected cmge instruction, so do not check for it. */

6243

6244

uint64x1_t

6245

test_vcgezd_s64 (int64x1_t a)

6246

{

6247

- return vcgezd_s64 (a);

6248

+ uint64x1_t res;

6249

+ force_simd (a);

6250

+ res = vcgezd_s64 (a);

6251

+ force_simd (res);

6252

+ return res;

6253

}

6254

6255

/* { dg-final { scan-assembler-times "\\tcmhs\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 1 } } */

6256

@@ -69,7 +99,12 @@

6257

uint64x1_t

6258

test_vcged_u64 (uint64x1_t a, uint64x1_t b)

6259

{

6260

- return vcged_u64 (a, b);

6261

+ uint64x1_t res;

6262

+ force_simd (a);

6263

+ force_simd (b);

6264

+ res = vcged_u64 (a, b);

6265

+ force_simd (res);

6266

+ return res;

6267

}

6268

6269

/* { dg-final { scan-assembler-times "\\tcmgt\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 2 } } */

6270

@@ -77,13 +112,23 @@

6271

uint64x1_t

6272

test_vcgtd_s64 (int64x1_t a, int64x1_t b)

6273

{

6274

- return vcgtd_s64 (a, b);

6275

+ uint64x1_t res;

6276

+ force_simd (a);

6277

+ force_simd (b);

6278

+ res = vcgtd_s64 (a, b);

6279

+ force_simd (res);

6280

+ return res;

6281

}

6282

6283

uint64x1_t

6284

test_vcltd_s64 (int64x1_t a, int64x1_t b)

6285

{

6286

- return vcltd_s64 (a, b);

6287

+ uint64x1_t res;

6288

+ force_simd (a);

6289

+ force_simd (b);

6290

+ res = vcltd_s64 (a, b);

6291

+ force_simd (res);

6292

+ return res;

6293

}

6294

6295

/* { dg-final { scan-assembler-times "\\tcmgt\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6296

@@ -91,7 +136,11 @@

6297

uint64x1_t

6298

test_vcgtzd_s64 (int64x1_t a)

6299

{

6300

- return vcgtzd_s64 (a);

6301

+ uint64x1_t res;

6302

+ force_simd (a);

6303

+ res = vcgtzd_s64 (a);

6304

+ force_simd (res);

6305

+ return res;

6306

}

6307

6308

/* { dg-final { scan-assembler-times "\\tcmhi\\td\[0-9\]+, d\[0-9\]+, d\[0-9\]+" 1 } } */

6309

@@ -99,7 +148,12 @@

6310

uint64x1_t

6311

test_vcgtd_u64 (uint64x1_t a, uint64x1_t b)

6312

{

6313

- return vcgtd_u64 (a, b);

6314

+ uint64x1_t res;

6315

+ force_simd (a);

6316

+ force_simd (b);

6317

+ res = vcgtd_u64 (a, b);

6318

+ force_simd (res);

6319

+ return res;

6320

}

6321

6322

/* { dg-final { scan-assembler-times "\\tcmle\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6323

@@ -107,15 +161,24 @@

6324

uint64x1_t

6325

test_vclezd_s64 (int64x1_t a)

6326

{

6327

- return vclezd_s64 (a);

6328

+ uint64x1_t res;

6329

+ force_simd (a);

6330

+ res = vclezd_s64 (a);

6331

+ force_simd (res);

6332

+ return res;

6333

}

6334

6335

-/* { dg-final { scan-assembler-times "\\tcmlt\\td\[0-9\]+, d\[0-9\]+, #?0" 1 } } */

6336

+/* Idiom recognition will cause this testcase not to generate

6337

+ the expected cmlt instruction, so do not check for it. */

6338

6339

uint64x1_t

6340

test_vcltzd_s64 (int64x1_t a)

6341

{

6342

- return vcltzd_s64 (a);

6343

+ uint64x1_t res;

6344

+ force_simd (a);

6345

+ res = vcltzd_s64 (a);

6346

+ force_simd (res);

6347

+ return res;

6348

}

6349

6350

/* { dg-final { scan-assembler-times "\\tdup\\tb\[0-9\]+, v\[0-9\]+\.b" 2 } } */

6351

@@ -179,13 +242,23 @@

6352

int64x1_t

6353

test_vtst_s64 (int64x1_t a, int64x1_t b)

6354

{

6355

- return vtstd_s64 (a, b);

6356

+ uint64x1_t res;

6357

+ force_simd (a);

6358

+ force_simd (b);

6359

+ res = vtstd_s64 (a, b);

6360

+ force_simd (res);

6361

+ return res;

6362

}

6363

6364

uint64x1_t

6365

test_vtst_u64 (uint64x1_t a, uint64x1_t b)

6366

{

6367

- return vtstd_u64 (a, b);

6368

+ uint64x1_t res;

6369

+ force_simd (a);

6370

+ force_simd (b);

6371

+ res = vtstd_s64 (a, b);

6372

+ force_simd (res);

6373

+ return res;

6374

}

6375

6376

/* { dg-final { scan-assembler-times "\\taddp\\td\[0-9\]+, v\[0-9\]+\.2d" 1 } } */

6377

@@ -722,8 +795,11 @@

6378

return vrshld_u64 (a, b);

6379

}

6380

6381

-/* { dg-final { scan-assembler-times "\\tasr\\tx\[0-9\]+" 1 } } */

6382

+/* Other intrinsics can generate an asr instruction (vcltzd, vcgezd),

6383

+ so we cannot check scan-assembler-times. */

6384

6385

+/* { dg-final { scan-assembler "\\tasr\\tx\[0-9\]+" } } */

6386

+

6387

int64x1_t

6388

test_vshrd_n_s64 (int64x1_t a)

6389

{

6390

Index: gcc/testsuite/gcc.target/i386/pr59405.c

6391

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

6392

--- a/src/gcc/testsuite/gcc.target/i386/pr59405.c (.../tags/gcc_4_8_2_release)

6393

+++ b/src/gcc/testsuite/gcc.target/i386/pr59405.c (.../branches/gcc-4_8-branch)

6394

@@ -0,0 +1,24 @@

6395

+/* { dg-do run } */

6396

+/* { dg-options "-mmmx -mfpmath=387" } */

6397

+

6398

+#include "mmx-check.h"

6399

+

6400

+#include <mmintrin.h>

6401

+

6402

+typedef float float32x2_t __attribute__ ((vector_size (8)));

6403

+

6404

+float

6405

+foo32x2_be (float32x2_t x)

6406

+{

6407

+ _mm_empty ();

6408

+ return x[1];

6409

+}

6410

+

6411

+static void

6412

+mmx_test (void)

6413

+{

6414

+ float32x2_t b = { 0.0f, 1.0f };

6415

+

6416

+ if (foo32x2_be (b) != 1.0f)

6417

+ abort ();

6418

+}

6419

Index: gcc/testsuite/gcc.target/i386/avx-vzeroupper-17.c

6420

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

6421

--- a/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-17.c (.../tags/gcc_4_8_2_release)

6422

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-17.c (.../branches/gcc-4_8-branch)

6423

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

6424

/* { dg-do compile { target lp64 } } */

6425

-/* { dg-options "-O2 -mavx -mabi=ms -mtune=generic -dp" } */

6426

+/* { dg-options "-O2 -mavx -mabi=ms -maccumulate-outgoing-args -dp" } */

6427

6428

typedef float __m256 __attribute__ ((__vector_size__ (32), __may_alias__));

6429

6430

Index: gcc/testsuite/gcc.target/i386/pr59470.c

6431

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

6432

--- a/src/gcc/testsuite/gcc.target/i386/pr59470.c (.../tags/gcc_4_8_2_release)

6433

+++ b/src/gcc/testsuite/gcc.target/i386/pr59470.c (.../branches/gcc-4_8-branch)

6434

@@ -0,0 +1,17 @@

6435

+/* PR middle-end/58956 */

6436

+/* PR middle-end/59470 */

6437

+/* { dg-do run } */

6438

+/* { dg-options "-O2" } */

6439

+

6440

+int a, b, d[1024];

6441

+

6442

+int

6443

+main ()

6444

+{

6445

+ int c = a;

6446

+ asm ("{movl $6, (%2); movl $1, %0|mov dword ptr [%2], 6; mov %0, 1}"

6447

+ : "=r" (d[c]) : "rm" (b), "r" (&a) : "memory");

6448

+ if (d[0] != 1 || d[6] != 0)

6449

+ __builtin_abort ();

6450

+ return 0;

6451

+}

6452

Index: gcc/testsuite/gcc.target/i386/pr59034-1.c

6453

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

6454

--- a/src/gcc/testsuite/gcc.target/i386/pr59034-1.c (.../tags/gcc_4_8_2_release)

6455

+++ b/src/gcc/testsuite/gcc.target/i386/pr59034-1.c (.../branches/gcc-4_8-branch)

6456

@@ -0,0 +1,10 @@

6457

+/* { dg-do compile { target { ! { ia32 } } } } */

6458

+/* { dg-require-effective-target maybe_x32 } */

6459

+/* { dg-options "-O -mx32 -mtune=corei7 -maddress-mode=short" } */

6460

+

6461

+extern int foo(int, ...);

6462

+int bar(void) {

6463

+ long double l = 1.2345E6;

6464

+ foo(0, l);

6465

+ return 0;

6466

+}

6467

Index: gcc/testsuite/gcc.target/i386/pr58690.c

6468

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

6469

--- a/src/gcc/testsuite/gcc.target/i386/pr58690.c (.../tags/gcc_4_8_2_release)

6470

+++ b/src/gcc/testsuite/gcc.target/i386/pr58690.c (.../branches/gcc-4_8-branch)

6471

@@ -0,0 +1,14 @@

6472

+/* { dg-do compile { target { ! { ia32 } } } } */

6473

+/* { dg-require-effective-target maybe_x32 } */

6474

+/* { dg-options "-O2 -mx32 -maddress-mode=short" } */

6475

+

6476

+struct gomp_thread

6477

+{

6478

+ char foo[41];

6479

+};

6480

+extern __thread struct gomp_thread gomp_tls_data;

6481

+void

6482

+foo (void)

6483

+{

6484

+ __builtin_memset (&gomp_tls_data, '\0', sizeof (gomp_tls_data));

6485

+}

6486

Index: gcc/testsuite/gcc.target/i386/avx-vmovapd-256-2.c

6487

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

6488

--- a/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-2.c (.../tags/gcc_4_8_2_release)

6489

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-2.c (.../branches/gcc-4_8-branch)

6490

@@ -15,7 +15,7 @@

6491

avx_test (void)

6492

{

6493

union256d u;

6494

- double e [4] __attribute__ ((aligned (8))) = {0.0};

6495

+ double e [4] __attribute__ ((aligned (32))) = {0.0};

6496

6497

u.x = _mm256_set_pd (39578.467285, 7856.342941, 85632.783567, 47563.234215);

6498

6499

Index: gcc/testsuite/gcc.target/i386/pr57003.c

6500

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

6501

--- a/src/gcc/testsuite/gcc.target/i386/pr57003.c (.../tags/gcc_4_8_2_release)

6502

+++ b/src/gcc/testsuite/gcc.target/i386/pr57003.c (.../branches/gcc-4_8-branch)

6503

@@ -1,6 +1,6 @@

6504

/* PR rtl-optimization/57003 */

6505

/* { dg-do run } */

6506

-/* { dg-options "-O2" } */

6507

+/* { dg-options "-O2 -maccumulate-outgoing-args" } */

6508

6509

#define N 2001

6510

unsigned short *b, *c, *d;

6511

Index: gcc/testsuite/gcc.target/i386/avx-vzeroupper-18.c

6512

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

6513

--- a/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-18.c (.../tags/gcc_4_8_2_release)

6514

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-18.c (.../branches/gcc-4_8-branch)

6515

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

6516

/* { dg-do compile { target lp64 } } */

6517

-/* { dg-options "-O0 -mavx -mabi=ms -mtune=generic -dp" } */

6518

+/* { dg-options "-O0 -mavx -mabi=ms -maccumulate-outgoing-args -dp" } */

6519

6520

typedef float __m256 __attribute__ ((__vector_size__ (32), __may_alias__));

6521

6522

Index: gcc/testsuite/gcc.target/i386/sse2-movapd-1.c

6523

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

6524

--- a/src/gcc/testsuite/gcc.target/i386/sse2-movapd-1.c (.../tags/gcc_4_8_2_release)

6525

+++ b/src/gcc/testsuite/gcc.target/i386/sse2-movapd-1.c (.../branches/gcc-4_8-branch)

6526

@@ -25,7 +25,7 @@

6527

TEST (void)

6528

{

6529

union128d u;

6530

- double e[2] __attribute__ ((aligned (8))) = {2134.3343,1234.635654};

6531

+ double e[2] __attribute__ ((aligned (16))) = {2134.3343,1234.635654};

6532

6533

u.x = test (e);

6534

6535

Index: gcc/testsuite/gcc.target/i386/pr59021.c

6536

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

6537

--- a/src/gcc/testsuite/gcc.target/i386/pr59021.c (.../tags/gcc_4_8_2_release)

6538

+++ b/src/gcc/testsuite/gcc.target/i386/pr59021.c (.../branches/gcc-4_8-branch)

6539

@@ -0,0 +1,23 @@

6540

+/* { dg-do compile } */

6541

+/* { dg-options "-O2 -mavx -mvzeroupper" } */

6542

+

6543

+extern void abort (void);

6544

+

6545

+struct S {

6546

+ int i1;

6547

+ int i2;

6548

+ int i3;

6549

+};

6550

+

6551

+typedef double v4df __attribute__ ((vector_size (32)));

6552

+

6553

+extern int foo (v4df, int i1, int i2, int i3, int i4, int i5, struct S s);

6554

+

6555

+void bar (v4df v, struct S s)

6556

+{

6557

+ int r = foo (v, 1, 2, 3, 4, 5, s);

6558

+ if (r)

6559

+ abort ();

6560

+}

6561

+

6562

+/* { dg-final { scan-assembler-not "vzeroupper" } } */

6563

Index: gcc/testsuite/gcc.target/i386/pr59034-2.c

6564

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

6565

--- a/src/gcc/testsuite/gcc.target/i386/pr59034-2.c (.../tags/gcc_4_8_2_release)

6566

+++ b/src/gcc/testsuite/gcc.target/i386/pr59034-2.c (.../branches/gcc-4_8-branch)

6567

@@ -0,0 +1,10 @@

6568

+/* { dg-do compile { target { ! { ia32 } } } } */

6569

+/* { dg-require-effective-target maybe_x32 } */

6570

+/* { dg-options "-O -mx32 -mtune=corei7 -maddress-mode=long" } */

6571

+

6572

+extern int foo(int, ...);

6573

+int bar(void) {

6574

+ long double l = 1.2345E6;

6575

+ foo(0, l);

6576

+ return 0;

6577

+}

6578

Index: gcc/testsuite/gcc.target/i386/xop-frczX.c

6579

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

6580

--- a/src/gcc/testsuite/gcc.target/i386/xop-frczX.c (.../tags/gcc_4_8_2_release)

6581

+++ b/src/gcc/testsuite/gcc.target/i386/xop-frczX.c (.../branches/gcc-4_8-branch)

6582

@@ -0,0 +1,60 @@

6583

+/* { dg-do run } */

6584

+/* { dg-require-effective-target xop } */

6585

+/* { dg-options "-O2 -mxop" } */

6586

+

6587

+#include "xop-check.h"

6588

+

6589

+#include <x86intrin.h>

6590

+

6591

+void

6592

+check_mm_vmfrcz_sd (__m128d __A, __m128d __B)

6593

+{

6594

+ union128d a, b, c;

6595

+ double d[2];

6596

+

6597

+ a.x = __A;

6598

+ b.x = __B;

6599

+ c.x = _mm_frcz_sd (__A, __B);

6600

+ d[0] = b.a[0] - (int)b.a[0] ;

6601

+ d[1] = a.a[1];

6602

+ if (check_union128d (c, d))

6603

+ abort ();

6604

+}

6605

+

6606

+void

6607

+check_mm_vmfrcz_ss (__m128 __A, __m128 __B)

6608

+{

6609

+ union128 a, b, c;

6610

+ float f[4];

6611

+

6612

+ a.x = __A;

6613

+ b.x = __B;

6614

+ c.x = _mm_frcz_ss (__A, __B);

6615

+ f[0] = b.a[0] - (int)b.a[0] ;

6616

+ f[1] = a.a[1];

6617

+ f[2] = a.a[2];

6618

+ f[3] = a.a[3];

6619

+ if (check_union128 (c, f))

6620

+ abort ();

6621

+}

6622

+

6623

+static void

6624

+xop_test (void)

6625

+{

6626

+ union128 a, b;

6627

+ union128d c,d;

6628

+ int i;

6629

+

6630

+ for (i = 0; i < 4; i++)

6631

+ {

6632

+ a.a[i] = i + 3.5;

6633

+ b.a[i] = i + 7.9;

6634

+ }

6635

+ for (i = 0; i < 2; i++)

6636

+ {

6637

+ c.a[i] = i + 3.5;

6638

+ d.a[i] = i + 7.987654321;

6639

+ }

6640

+ check_mm_vmfrcz_ss (a.x, b.x);

6641

+ check_mm_vmfrcz_sd (c.x, d.x);

6642

+}

6643

Index: gcc/testsuite/gcc.target/i386/pr59625.c

6644

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

6645

--- a/src/gcc/testsuite/gcc.target/i386/pr59625.c (.../tags/gcc_4_8_2_release)

6646

+++ b/src/gcc/testsuite/gcc.target/i386/pr59625.c (.../branches/gcc-4_8-branch)

6647

@@ -0,0 +1,36 @@

6648

+/* PR target/59625 */

6649

+/* { dg-do compile } */

6650

+/* { dg-options "-O2 -mtune=atom" } */

6651

+

6652

+int

6653

+foo (void)

6654

+{

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

+ asm goto ("" : : : : lab);

6670

+ asm goto ("" : : : : lab);

6671

+ asm goto ("" : : : : lab);

6672

+ asm goto ("" : : : : lab);

6673

+ asm goto ("" : : : : lab);

6674

+ asm goto ("" : : : : lab);

6675

+ return 0;

6676

+lab:

6677

+ return 1;

6678

+}

6679

+

6680

+/* Verify we don't consider asm goto as a jump for four jumps limit

6681

+ optimization. asm goto doesn't have to contain a jump at all,

6682

+ the branching to labels can happen through different means. */

6683

+/* { dg-final { scan-assembler-not "(p2align\[^\n\r\]*\[\n\r]*\[^\n\r\]*){8}p2align" } } */

6684

Index: gcc/testsuite/gcc.target/i386/sse2-movapd-2.c

6685

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

6686

--- a/src/gcc/testsuite/gcc.target/i386/sse2-movapd-2.c (.../tags/gcc_4_8_2_release)

6687

+++ b/src/gcc/testsuite/gcc.target/i386/sse2-movapd-2.c (.../branches/gcc-4_8-branch)

6688

@@ -25,7 +25,7 @@

6689

TEST (void)

6690

{

6691

union128d u;

6692

- double e[2] __attribute__ ((aligned (8))) = {0.0};

6693

+ double e[2] __attribute__ ((aligned (16))) = {0.0};

6694

6695

u.x = _mm_set_pd (2134.3343,1234.635654);

6696

6697

Index: gcc/testsuite/gcc.target/i386/pr58137.c

6698

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

6699

--- a/src/gcc/testsuite/gcc.target/i386/pr58137.c (.../tags/gcc_4_8_2_release)

6700

+++ b/src/gcc/testsuite/gcc.target/i386/pr58137.c (.../branches/gcc-4_8-branch)

6701

@@ -0,0 +1,33 @@

6702

+/* { dg-do compile } */

6703

+/* { dg-options "-O3 -mavx2" } */

6704

+

6705

+typedef unsigned int U32;

6706

+

6707

+struct sv {

6708

+ void* sv_any;

6709

+ U32 sv_refcnt;

6710

+ U32 sv_flags;

6711

+};

6712

+typedef struct sv SV;

6713

+

6714

+struct xrv {

6715

+ SV * xrv_rv;

6716

+};

6717

+typedef struct xrv XRV;

6718

+

6719

+extern XRV * PL_xrv_root;

6720

+

6721

+void

6722

+more_xrv (void)

6723

+{

6724

+ register XRV* xrv;

6725

+ register XRV* xrvend;

6726

+ xrv = PL_xrv_root;

6727

+ xrvend = &xrv[200 / sizeof (XRV) - 1];

6728

+ while (xrv < xrvend)

6729

+ {

6730

+ xrv->xrv_rv = (SV*)(xrv + 1);

6731

+ xrv++;

6732

+ }

6733

+ xrv->xrv_rv = 0;

6734

+}

6735

Index: gcc/testsuite/gcc.target/i386/avx-vzeroupper-16.c

6736

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

6737

--- a/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-16.c (.../tags/gcc_4_8_2_release)

6738

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vzeroupper-16.c (.../branches/gcc-4_8-branch)

6739

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

6740

/* { dg-do compile { target lp64 } } */

6741

-/* { dg-options "-O2 -mavx -mabi=ms -mtune=generic -dp" } */

6742

+/* { dg-options "-O2 -mavx -mabi=ms -maccumulate-outgoing-args -dp" } */

6743

6744

typedef float __m256 __attribute__ ((__vector_size__ (32), __may_alias__));

6745

6746

Index: gcc/testsuite/gcc.target/i386/pr30315.c

6747

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

6748

--- a/src/gcc/testsuite/gcc.target/i386/pr30315.c (.../tags/gcc_4_8_2_release)

6749

+++ b/src/gcc/testsuite/gcc.target/i386/pr30315.c (.../branches/gcc-4_8-branch)

6750

@@ -1,6 +1,6 @@

6751

/* { dg-do compile } */

6752

/* { dg-options "-O2" } */

6753

-/* { dg-final { scan-assembler-times "cmp" 4 } } */

6754

+/* { dg-final { scan-assembler-not "cmp" } } */

6755

6756

extern void abort (void);

6757

int c;

6758

@@ -34,39 +34,10 @@

6759

}

6760

#define PLUSCCONLY(T, t) PLUSCCONLY1(T, t, a) PLUSCCONLY1(T, t, b)

6761

6762

-#define MINUSCC(T, t) \

6763

-T minuscc##t (T a, T b) \

6764

-{ \

6765

- T difference = a - b; \

6766

- if (difference > a) \

6767

- abort (); \

6768

- return difference; \

6769

-}

6770

-

6771

-#define DECCC(T, t) \

6772

-T deccc##t (T a, T b) \

6773

-{ \

6774

- T difference = a - b; \

6775

- if (difference > a) \

6776

- c --; \

6777

- return difference; \

6778

-}

6779

-

6780

-#define MINUSCCONLY(T, t) \

6781

-void minuscconly##t (T a, T b) \

6782

-{ \

6783

- T difference = a - b; \

6784

- if (difference > a) \

6785

- abort (); \

6786

-}

6787

-

6788

#define TEST(T, t) \

6789

PLUSCC(T, t) \

6790

PLUSCCONLY(T, t) \

6791

- INCCC(T, t) \

6792

- MINUSCC(T, t) \

6793

- MINUSCCONLY(T, t) \

6794

- DECCC(T, t)

6795

+ INCCC(T, t)

6796

6797

TEST (unsigned long, l)

6798

TEST (unsigned int, i)

6799

@@ -84,14 +55,3 @@

6800

6801

PLUSCCZEXT(a)

6802

PLUSCCZEXT(b)

6803

-

6804

-#define MINUSCCZEXT \

6805

-unsigned long minuscczext (unsigned int a, unsigned int b) \

6806

-{ \

6807

- unsigned int difference = a - b; \

6808

- if (difference > a) \

6809

- abort (); \

6810

- return difference; \

6811

-}

6812

-

6813

-MINUSCCZEXT

6814

Index: gcc/testsuite/gcc.target/i386/pr43869.c

6815

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

6816

--- a/src/gcc/testsuite/gcc.target/i386/pr43869.c (.../tags/gcc_4_8_2_release)

6817

+++ b/src/gcc/testsuite/gcc.target/i386/pr43869.c (.../branches/gcc-4_8-branch)

6818

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

6819

/* { dg-do compile { target lp64 } } */

6820

+/* { dg-options "-maccumulate-outgoing-args" } */

6821

6822

int __attribute__((__noinline__))

6823

bugged(float f1, float f2, float f3, float f4,

6824

Index: gcc/testsuite/gcc.target/i386/pr43662.c

6825

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

6826

--- a/src/gcc/testsuite/gcc.target/i386/pr43662.c (.../tags/gcc_4_8_2_release)

6827

+++ b/src/gcc/testsuite/gcc.target/i386/pr43662.c (.../branches/gcc-4_8-branch)

6828

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

6829

/* { dg-do compile { target lp64 } } */

6830

-/* { dg-options "-O2" } */

6831

+/* { dg-options "-O2 -maccumulate-outgoing-args" } */

6832

6833

void __attribute__ ((ms_abi)) foo (void)

6834

{

6835

Index: gcc/testsuite/gcc.target/i386/avx-vmovapd-256-1.c

6836

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

6837

--- a/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-1.c (.../tags/gcc_4_8_2_release)

6838

+++ b/src/gcc/testsuite/gcc.target/i386/avx-vmovapd-256-1.c (.../branches/gcc-4_8-branch)

6839

@@ -15,7 +15,7 @@

6840

avx_test (void)

6841

{

6842

union256d u;

6843

- double e [4] __attribute__ ((aligned (8))) = {41124.234,2344.2354,8653.65635,856.43576};

6844

+ double e [4] __attribute__ ((aligned (32))) = {41124.234,2344.2354,8653.65635,856.43576};

6845

6846

u.x = test (e);

6847

6848

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/pr38891.c

6849

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

6850

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/pr38891.c (.../tags/gcc_4_8_2_release)

6851

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/pr38891.c (.../branches/gcc-4_8-branch)

6852

@@ -1,7 +1,7 @@

6853

/* Test for cross x86_64<->w64 abi standard calls.

6854

*/

6855

/* { dg-do compile } */

6856

-/* { dg-options "-mno-sse" } */

6857

+/* { dg-options "-mno-sse -maccumulate-outgoing-args" } */

6858

#include "callabi.h"

6859

6860

long double

6861

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-1.c

6862

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

6863

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-1.c (.../tags/gcc_4_8_2_release)

6864

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-1.c (.../branches/gcc-4_8-branch)

6865

@@ -2,7 +2,7 @@

6866

*/

6867

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6868

/* { dg-do run } */

6869

-/* { dg-options "-std=gnu99" } */

6870

+/* { dg-options "-std=gnu99 -maccumulate-outgoing-args" } */

6871

#include "callabi.h"

6872

6873

extern __SIZE_TYPE__ strlen (const char *);

6874

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-2.c

6875

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

6876

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-2.c (.../tags/gcc_4_8_2_release)

6877

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-2.c (.../branches/gcc-4_8-branch)

6878

@@ -2,7 +2,7 @@

6879

*/

6880

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6881

/* { dg-do run } */

6882

-/* { dg-options "-std=gnu99" } */

6883

+/* { dg-options "-std=gnu99 -maccumulate-outgoing-args" } */

6884

#include "callabi.h"

6885

6886

extern void abort (void);

6887

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-3.c

6888

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

6889

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-3.c (.../tags/gcc_4_8_2_release)

6890

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-3.c (.../branches/gcc-4_8-branch)

6891

@@ -2,7 +2,7 @@

6892

*/

6893

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6894

/* { dg-do run } */

6895

-/* { dg-options "-std=gnu99" } */

6896

+/* { dg-options "-std=gnu99 -maccumulate-outgoing-args" } */

6897

#include "callabi.h"

6898

6899

extern void abort (void);

6900

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4a.c

6901

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

6902

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4a.c (.../tags/gcc_4_8_2_release)

6903

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4a.c (.../branches/gcc-4_8-branch)

6904

@@ -1,6 +1,6 @@

6905

/* Test for cross x86_64<->w64 abi va_list calls. */

6906

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

6907

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6908

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6909

/* { dg-additional-sources "vaarg-4b.c" } */

6910

6911

extern __SIZE_TYPE__ __attribute__ ((sysv_abi)) strlen (const char *);

6912

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5a.c

6913

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

6914

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5a.c (.../tags/gcc_4_8_2_release)

6915

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5a.c (.../branches/gcc-4_8-branch)

6916

@@ -1,6 +1,6 @@

6917

/* Test for cross x86_64<->w64 abi va_list calls. */

6918

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

6919

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6920

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6921

/* { dg-additional-sources "vaarg-5b.c" } */

6922

6923

extern void __attribute__ ((sysv_abi)) abort (void);

6924

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4b.c

6925

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

6926

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4b.c (.../tags/gcc_4_8_2_release)

6927

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-4b.c (.../branches/gcc-4_8-branch)

6928

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

6929

/* Test for cross x86_64<->w64 abi va_list calls. */

6930

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6931

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6932

6933

#include <stdarg.h>

6934

6935

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5b.c

6936

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

6937

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5b.c (.../tags/gcc_4_8_2_release)

6938

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/vaarg-5b.c (.../branches/gcc-4_8-branch)

6939

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

6940

/* Test for cross x86_64<->w64 abi va_list calls. */

6941

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin" } */

6942

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -fno-builtin -maccumulate-outgoing-args" } */

6943

6944

#include <stdarg.h>

6945

6946

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-1.c

6947

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

6948

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-1.c (.../tags/gcc_4_8_2_release)

6949

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-1.c (.../branches/gcc-4_8-branch)

6950

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

6951

/* { dg-do compile } */

6952

-/* { dg-options "-O2 -mabi=sysv" } */

6953

+/* { dg-options "-O2 -mabi=sysv -maccumulate-outgoing-args" } */

6954

6955

__attribute__ ((ms_abi))

6956

int foo (void)

6957

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-2.c

6958

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

6959

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-2.c (.../tags/gcc_4_8_2_release)

6960

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/leaf-2.c (.../branches/gcc-4_8-branch)

6961

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

6962

/* { dg-do compile } */

6963

-/* { dg-options "-O2 -mabi=sysv" } */

6964

+/* { dg-options "-O2 -mabi=sysv -maccumulate-outgoing-args" } */

6965

6966

extern int glb1, gbl2, gbl3;

6967

6968

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-1.c

6969

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

6970

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-1.c (.../tags/gcc_4_8_2_release)

6971

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-1.c (.../branches/gcc-4_8-branch)

6972

@@ -2,7 +2,7 @@

6973

*/

6974

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

6975

/* { dg-do run } */

6976

-/* { dg-options "-std=gnu99 -ffast-math" } */

6977

+/* { dg-options "-std=gnu99 -ffast-math -maccumulate-outgoing-args" } */

6978

#include "callabi.h"

6979

6980

extern void abort (void);

6981

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2a.c

6982

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

6983

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2a.c (.../tags/gcc_4_8_2_release)

6984

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2a.c (.../branches/gcc-4_8-branch)

6985

@@ -1,6 +1,6 @@

6986

/* Test for cross x86_64<->w64 abi standard calls via variable. */

6987

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

6988

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

6989

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

6990

/* { dg-additional-sources "func-indirect-2b.c" } */

6991

6992

extern void __attribute__ ((sysv_abi)) abort (void);

6993

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect.c

6994

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

6995

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect.c (.../tags/gcc_4_8_2_release)

6996

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect.c (.../branches/gcc-4_8-branch)

6997

@@ -2,7 +2,7 @@

6998

*/

6999

/* Origin: Kai Tietz <kai.tietz@onevision.com> */

7000

/* { dg-do run } */

7001

-/* { dg-options "-std=gnu99 -ffast-math" } */

7002

+/* { dg-options "-std=gnu99 -ffast-math -maccumulate-outgoing-args" } */

7003

#include "callabi.h"

7004

7005

extern void abort (void);

7006

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2a.c

7007

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

7008

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2a.c (.../tags/gcc_4_8_2_release)

7009

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2a.c (.../branches/gcc-4_8-branch)

7010

@@ -1,6 +1,6 @@

7011

/* Test for cross x86_64<->w64 abi standard calls. */

7012

/* { dg-do run { target i?86-*-linux* x86_64-*-linux* } } */

7013

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

7014

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

7015

/* { dg-additional-sources "func-2b.c" } */

7016

7017

extern void __attribute__ ((sysv_abi)) abort (void);

7018

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2b.c

7019

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

7020

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2b.c (.../tags/gcc_4_8_2_release)

7021

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-indirect-2b.c (.../branches/gcc-4_8-branch)

7022

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

7023

/* Test for cross x86_64<->w64 abi standard calls via variable. */

7024

-/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

7025

+/* { dg-options "-O2 -mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

7026

7027

typedef int (*func)(void *, char *, char *, short, long long);

7028

7029

Index: gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2b.c

7030

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

7031

--- a/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2b.c (.../tags/gcc_4_8_2_release)

7032

+++ b/src/gcc/testsuite/gcc.target/x86_64/abi/callabi/func-2b.c (.../branches/gcc-4_8-branch)

7033

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

7034

/* Test for cross x86_64<->w64 abi standard calls. */

7035

-/* { dg-options "-mabi=ms -std=gnu99 -ffast-math -fno-builtin" } */

7036

+/* { dg-options "-mabi=ms -std=gnu99 -ffast-math -fno-builtin -maccumulate-outgoing-args" } */

7037

7038

long double func_cross (long double a, double b, float c, long d, int e,

7039

char f)

7040

Index: gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c

7041

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

7042

--- a/src/gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c (.../tags/gcc_4_8_2_release)

7043

+++ b/src/gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c (.../branches/gcc-4_8-branch)

7044

@@ -1,37 +0,0 @@

7045

-/* This checks the availability of the XL compiler intrinsics for

7046

- transactional execution with the expected prototypes. */

7047

-

7048

-/* { dg-do compile } */

7049

-/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7050

-

7051

-#include <htmxlintrin.h>

7052

-

7053

-int a = 0;

7054

-unsigned long g;

7055

-

7056

-int

7057

-foo ()

7058

-{

7059

- struct __htm_tdb *tdb_struct;

7060

- void * const tdb = tdb_struct;

7061

- long result;

7062

- unsigned char code;

7063

-

7064

- result = __TM_simple_begin ();

7065

- result = __TM_begin (tdb);

7066

- result = __TM_end ();

7067

- __TM_abort ();

7068

- __TM_named_abort (42);

7069

- __TM_non_transactional_store (&g, 42);

7070

- result = __TM_nesting_depth (tdb);

7071

-

7072

- result = __TM_is_user_abort (tdb);

7073

- result = __TM_is_named_user_abort (tdb, &code);

7074

- result = __TM_is_illegal (tdb);

7075

- result = __TM_is_footprint_exceeded (tdb);

7076

- result = __TM_is_nested_too_deep (tdb);

7077

- result = __TM_is_conflict (tdb);

7078

- result = __TM_is_failure_persistent (result);

7079

- result = __TM_failure_address (tdb);

7080

- result = __TM_failure_code (tdb);

7081

-}

7082

Index: gcc/testsuite/gcc.target/s390/htm-1.c

7083

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

7084

--- a/src/gcc/testsuite/gcc.target/s390/htm-1.c (.../tags/gcc_4_8_2_release)

7085

+++ b/src/gcc/testsuite/gcc.target/s390/htm-1.c (.../branches/gcc-4_8-branch)

7086

@@ -1,73 +0,0 @@

7087

-/* This checks the availability of the low-level builtins introduced

7088

- for transactional execution. */

7089

-

7090

-/* { dg-do compile } */

7091

-/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7092

-

7093

-#include <stdint.h>

7094

-#include <htmintrin.h>

7095

-

7096

-int global = 0;

7097

-uint64_t g;

7098

-struct __htm_tdb global_tdb;

7099

-

7100

-int

7101

-foo (struct __htm_tdb* tdb, int reg, int *mem, uint64_t *mem64)

7102

-{

7103

-

7104

- int cc;

7105

- int n;

7106

-

7107

- cc = __builtin_tbegin (0);

7108

- cc = __builtin_tbegin (tdb);

7109

- cc = __builtin_tbegin (&global_tdb);

7110

-

7111

- cc = __builtin_tbegin_nofloat (0);

7112

- cc = __builtin_tbegin_nofloat (&global_tdb);

7113

-

7114

- cc = __builtin_tbegin_retry (0, 42);

7115

- cc = __builtin_tbegin_retry (0, reg);

7116

- cc = __builtin_tbegin_retry (0, *mem);

7117

- cc = __builtin_tbegin_retry (0, global);

7118

- cc = __builtin_tbegin_retry (tdb, 42);

7119

- cc = __builtin_tbegin_retry (&global_tdb, 42);

7120

-

7121

- cc = __builtin_tbegin_retry_nofloat (0, 42);

7122

- cc = __builtin_tbegin_retry_nofloat (0, reg);

7123

- cc = __builtin_tbegin_retry_nofloat (0, *mem);

7124

- cc = __builtin_tbegin_retry_nofloat (0, global);

7125

- cc = __builtin_tbegin_retry_nofloat (&global_tdb, 42);

7126

-

7127

- __builtin_tbeginc ();

7128

-

7129

- n = __builtin_tx_nesting_depth();

7130

-

7131

- __builtin_non_tx_store(&g, 23);

7132

- __builtin_non_tx_store(mem64, 23);

7133

- __builtin_non_tx_store(&g, reg);

7134

- __builtin_non_tx_store(&g, *mem);

7135

- __builtin_non_tx_store(&g, global);

7136

-

7137

- __builtin_tabort (42 + 255);

7138

- __builtin_tabort (reg);

7139

- /* { dg-final { scan-assembler-times "tabort\t255" 1 } } */

7140

- __builtin_tabort (reg + 255);

7141

- __builtin_tabort (*mem);

7142

- __builtin_tabort (global);

7143

- /* Here global + 255 gets reloaded into a reg. Better would be to

7144

- just reload global or *mem and get the +255 for free as address

7145

- arithmetic. */

7146

- __builtin_tabort (*mem + 255);

7147

- __builtin_tabort (global + 255);

7148

-

7149

- __builtin_tend();

7150

-

7151

- __builtin_tx_assist (23);

7152

- __builtin_tx_assist (reg);

7153

- __builtin_tx_assist (*mem);

7154

- __builtin_tx_assist (global);

7155

-}

7156

-

7157

-/* Make sure the tdb NULL argument ends up as immediate value in the

7158

- instruction. */

7159

-/* { dg-final { scan-assembler-times "tbegin\t0," 10 } } */

7160

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c

7161

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

7162

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c (.../tags/gcc_4_8_2_release)

7163

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c (.../branches/gcc-4_8-branch)

7164

@@ -0,0 +1,27 @@

7165

+/* Functional tests for the function hotpatching feature. */

7166

+

7167

+/* { dg-do run } */

7168

+/* { dg-options "-O3 -mzarch -mhotpatch" } */

7169

+

7170

+#include <stdio.h>

7171

+

7172

+void hp1(void)

7173

+{

7174

+ printf("hello, world!\n");

7175

+}

7176

+

7177

+inline void hp2(void)

7178

+{

7179

+ printf("hello, world!\n");

7180

+}

7181

+

7182

+__attribute__ ((always_inline))

7183

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7184

+{

7185

+ printf("hello, world!\n");

7186

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7187

+

7188

+int main (void)

7189

+{

7190

+ return 0;

7191

+}

7192

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c

7193

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

7194

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c (.../tags/gcc_4_8_2_release)

7195

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c (.../branches/gcc-4_8-branch)

7196

@@ -0,0 +1,27 @@

7197

+/* Functional tests for the function hotpatching feature. */

7198

+

7199

+/* { dg-do run } */

7200

+/* { dg-options "-O3 -mzarch -mhotpatch=0" } */

7201

+

7202

+#include <stdio.h>

7203

+

7204

+void hp1(void)

7205

+{

7206

+ printf("hello, world!\n");

7207

+}

7208

+

7209

+inline void hp2(void)

7210

+{

7211

+ printf("hello, world!\n");

7212

+}

7213

+

7214

+__attribute__ ((always_inline))

7215

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7216

+{

7217

+ printf("hello, world!\n");

7218

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7219

+

7220

+int main (void)

7221

+{

7222

+ return 0;

7223

+}

7224

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c

7225

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

7226

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c (.../tags/gcc_4_8_2_release)

7227

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c (.../branches/gcc-4_8-branch)

7228

@@ -0,0 +1,27 @@

7229

+/* Functional tests for the function hotpatching feature. */

7230

+

7231

+/* { dg-do run } */

7232

+/* { dg-options "-O3 -mzarch -mhotpatch=1" } */

7233

+

7234

+#include <stdio.h>

7235

+

7236

+void hp1(void)

7237

+{

7238

+ printf("hello, world!\n");

7239

+}

7240

+

7241

+inline void hp2(void)

7242

+{

7243

+ printf("hello, world!\n");

7244

+}

7245

+

7246

+__attribute__ ((always_inline))

7247

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7248

+{

7249

+ printf("hello, world!\n");

7250

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7251

+

7252

+int main (void)

7253

+{

7254

+ return 0;

7255

+}

7256

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c

7257

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

7258

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c (.../tags/gcc_4_8_2_release)

7259

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c (.../branches/gcc-4_8-branch)

7260

@@ -0,0 +1,11 @@

7261

+/* Functional tests for the function hotpatching feature. */

7262

+

7263

+/* { dg-do compile } */

7264

+/* { dg-options "-O3 -mzarch -mhotpatch=-1" } */

7265

+

7266

+int main (void)

7267

+{

7268

+ return 0;

7269

+}

7270

+

7271

+/* { dg-excess-errors "argument to '-mhotpatch=' should be a non-negative integer" } */

7272

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c

7273

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

7274

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c (.../tags/gcc_4_8_2_release)

7275

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c (.../branches/gcc-4_8-branch)

7276

@@ -0,0 +1,28 @@

7277

+/* Functional tests for the function hotpatching feature. */

7278

+

7279

+/* { dg-do compile } */

7280

+/* { dg-options "-O3 -mzarch -mhotpatch=1000000" } */

7281

+

7282

+#include <stdio.h>

7283

+

7284

+void hp1(void)

7285

+{

7286

+ printf("hello, world!\n");

7287

+}

7288

+

7289

+__attribute__ ((hotpatch(1000000)))

7290

+void hp2(void)

7291

+{

7292

+ printf("hello, world!\n");

7293

+}

7294

+

7295

+__attribute__ ((hotpatch(1000001)))

7296

+void hp3(void)

7297

+{ /* { dg-error "requested 'hotpatch' attribute is not a non-negative integer constant or too large .max. 1000000." } */

7298

+ printf("hello, world!\n");

7299

+}

7300

+

7301

+int main (void)

7302

+{

7303

+ return 0;

7304

+}

7305

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c

7306

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

7307

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c (.../tags/gcc_4_8_2_release)

7308

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c (.../branches/gcc-4_8-branch)

7309

@@ -0,0 +1,11 @@

7310

+/* Functional tests for the function hotpatching feature. */

7311

+

7312

+/* { dg-do compile } */

7313

+/* { dg-options "-O3 -mzarch -mhotpatch=1000001" } */

7314

+

7315

+int main (void)

7316

+{

7317

+ return 0;

7318

+}

7319

+

7320

+/* { dg-excess-errors "argument to '-mhotpatch=' is too large .max. 1000000." } */

7321

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c

7322

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

7323

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c (.../tags/gcc_4_8_2_release)

7324

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c (.../branches/gcc-4_8-branch)

7325

@@ -0,0 +1,165 @@

7326

+/* This checks the availability of the low-level builtins introduced

7327

+ for transactional execution. */

7328

+

7329

+/* { dg-do compile } */

7330

+/* { dg-require-effective-target htm } */

7331

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7332

+

7333

+#include <stdint.h>

7334

+#include <htmintrin.h>

7335

+

7336

+int global = 0;

7337

+uint64_t g;

7338

+struct __htm_tdb global_tdb;

7339

+

7340

+int

7341

+foo (struct __htm_tdb* tdb, int reg, int *mem, uint64_t *mem64)

7342

+{

7343

+

7344

+ int cc;

7345

+ int n;

7346

+

7347

+ __builtin_tbegin ((void *)0);

7348

+ __builtin_tbegin ((void *)-99999);

7349

+ __builtin_tbegin ((void *)99999);

7350

+ while (__builtin_tbegin ((void *)0) != 0)

7351

+ {

7352

+ }

7353

+ cc = __builtin_tbegin ((void *)0x12345678);

7354

+ cc = __builtin_tbegin (tdb);

7355

+ cc = __builtin_tbegin (&global_tdb);

7356

+ cc = __builtin_tbegin ((void *)(long long)(reg + 0x12345678));

7357

+ cc = __builtin_tbegin ((void *)(long long)(reg));

7358

+

7359

+ __builtin_tbegin_nofloat ((void *)0);

7360

+ __builtin_tbegin_nofloat ((void *)-99999);

7361

+ __builtin_tbegin_nofloat ((void *)99999);

7362

+ cc = __builtin_tbegin_nofloat ((void *)0x12345678);

7363

+ cc = __builtin_tbegin_nofloat (tdb);

7364

+ cc = __builtin_tbegin_nofloat (&global_tdb);

7365

+ cc = __builtin_tbegin_nofloat ((void *)(long long)(reg + 0x12345678));

7366

+ cc = __builtin_tbegin_nofloat ((void *)(long long)(reg));

7367

+

7368

+ __builtin_tbegin_retry ((void *)0, 0);

7369

+ cc = __builtin_tbegin_retry ((void *)0, 1);

7370

+ cc = __builtin_tbegin_retry ((void *)0, -1);

7371

+ cc = __builtin_tbegin_retry ((void *)0, 42);

7372

+ cc = __builtin_tbegin_retry ((void *)0, reg);

7373

+ cc = __builtin_tbegin_retry ((void *)0, *mem);

7374

+ cc = __builtin_tbegin_retry ((void *)0, global);

7375

+ cc = __builtin_tbegin_retry (tdb, 42);

7376

+ cc = __builtin_tbegin_retry (&global_tdb, 42);

7377

+ cc = __builtin_tbegin_retry ((void *)0x12345678, global);

7378

+ cc = __builtin_tbegin_retry (

7379

+ (void *)(long long) (reg + 0x12345678), global + 1);

7380

+ cc = __builtin_tbegin_retry (

7381

+ (void *)(long long)(reg), global - 1);

7382

+

7383

+ __builtin_tbegin_retry_nofloat ((void *)0, 0);

7384

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, 1);

7385

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, -1);

7386

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, 42);

7387

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, reg);

7388

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, *mem);

7389

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, global);

7390

+ cc = __builtin_tbegin_retry_nofloat (tdb, 42);

7391

+ cc = __builtin_tbegin_retry_nofloat (&global_tdb, 42);

7392

+ cc = __builtin_tbegin_retry_nofloat ((void *)0x12345678, global);

7393

+ cc = __builtin_tbegin_retry_nofloat (

7394

+ (void *)(long long) (reg + 0x12345678), global + 1);

7395

+ cc = __builtin_tbegin_retry_nofloat (

7396

+ (void *)(long long)(reg), global - 1);

7397

+

7398

+ __builtin_tbeginc ();

7399

+

7400

+ __builtin_tx_nesting_depth ();

7401

+ n = __builtin_tx_nesting_depth ();

7402

+

7403

+ __builtin_non_tx_store (mem64, 0);

7404

+ {

7405

+ const uint64_t val_var = 0x1122334455667788;

7406

+

7407

+ __builtin_non_tx_store (mem64, val_var);

7408

+ }

7409

+ __builtin_non_tx_store (mem64, (uint64_t)reg);

7410

+ __builtin_non_tx_store (mem64, g);

7411

+ __builtin_non_tx_store ((uint64_t *)0, 0);

7412

+ __builtin_non_tx_store ((uint64_t *)0x12345678, 0);

7413

+ __builtin_non_tx_store (&g, 23);

7414

+ __builtin_non_tx_store (&g, reg);

7415

+ __builtin_non_tx_store (&g, *mem);

7416

+ __builtin_non_tx_store (&g, global);

7417

+

7418

+ __builtin_tend();

7419

+

7420

+ __builtin_tx_assist (0);

7421

+ __builtin_tx_assist (1);

7422

+ __builtin_tx_assist (reg);

7423

+ __builtin_tx_assist (*mem);

7424

+ __builtin_tx_assist (global);

7425

+}

7426

+

7427

+/* The taborts must go into separate function since they are

7428

+ "noreturn". */

7429

+

7430

+void

7431

+tabort1 ()

7432

+{

7433

+ __builtin_tabort (256);

7434

+}

7435

+

7436

+void

7437

+tabort2 (int reg)

7438

+{

7439

+ __builtin_tabort (reg);

7440

+}

7441

+

7442

+void

7443

+tabort3 (int reg)

7444

+{

7445

+ /* { dg-final { scan-assembler-times "tabort\t255" 1 } } */

7446

+ __builtin_tabort (reg + 255);

7447

+}

7448

+

7449

+void

7450

+tabort4 (int *mem)

7451

+{

7452

+ __builtin_tabort (*mem);

7453

+}

7454

+

7455

+void

7456

+tabort5 ()

7457

+{

7458

+ __builtin_tabort (global);

7459

+}

7460

+

7461

+void

7462

+tabort6 (int *mem)

7463

+{

7464

+ /* Here global + 255 gets reloaded into a reg. Better would be to

7465

+ just reload global or *mem and get the +255 for free as address

7466

+ arithmetic. */

7467

+ __builtin_tabort (*mem + 255);

7468

+}

7469

+

7470

+void

7471

+tabort7 ()

7472

+{

7473

+ __builtin_tabort (global + 255);

7474

+}

7475

+

7476

+void

7477

+tabort8 ()

7478

+{

7479

+ __builtin_tabort (-1);

7480

+}

7481

+

7482

+

7483

+/* Make sure the tdb NULL argument ends up as immediate value in the

7484

+ instruction. */

7485

+/* { dg-final { scan-assembler-times "tbegin\t0," 17 } } */

7486

+/* { dg-final { scan-assembler-times "tbegin\t" 41 } } */

7487

+/* Check number of occurences of certain instructions. */

7488

+/* { dg-final { scan-assembler-times "tbeginc\t" 1 } } */

7489

+/* { dg-final { scan-assembler-times "tabort\t" 8 } } */

7490

+/* { dg-final { scan-assembler "ppa\t" } } */

7491

Index: gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c

7492

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

7493

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c (.../tags/gcc_4_8_2_release)

7494

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c (.../branches/gcc-4_8-branch)

7495

@@ -0,0 +1,68 @@

7496

+/* Functional tests for the function hotpatching feature. */

7497

+

7498

+/* { dg-do run } */

7499

+/* { dg-options "-O3 -mzarch -mno-hotpatch" } */

7500

+

7501

+#include <stdio.h>

7502

+

7503

+__attribute__ ((hotpatch))

7504

+void hp1(void)

7505

+{

7506

+ printf("hello, world!\n");

7507

+}

7508

+

7509

+__attribute__ ((hotpatch))

7510

+inline void hp2(void)

7511

+{

7512

+ printf("hello, world!\n");

7513

+}

7514

+

7515

+__attribute__ ((hotpatch))

7516

+__attribute__ ((always_inline))

7517

+void hp3(void) /* { dg-warning "always_inline function might not be inlinable" } */

7518

+{

7519

+ printf("hello, world!\n");

7520

+} /* { dg-warning "function 'hp3' with the 'always_inline' attribute is not hotpatchable" } */

7521

+

7522

+__attribute__ ((hotpatch(0)))

7523

+void hp4(void)

7524

+{

7525

+ printf("hello, world!\n");

7526

+}

7527

+

7528

+__attribute__ ((hotpatch(0)))

7529

+inline void hp5(void)

7530

+{

7531

+ printf("hello, world!\n");

7532

+}

7533

+

7534

+__attribute__ ((hotpatch(0)))

7535

+__attribute__ ((always_inline))

7536

+void hp6(void) /* { dg-warning "always_inline function might not be inlinable" } */

7537

+{

7538

+ printf("hello, world!\n");

7539

+} /* { dg-warning "function 'hp6' with the 'always_inline' attribute is not hotpatchable" } */

7540

+

7541

+__attribute__ ((hotpatch(1)))

7542

+void hp7(void)

7543

+{

7544

+ printf("hello, world!\n");

7545

+}

7546

+

7547

+__attribute__ ((hotpatch(1)))

7548

+inline void hp8(void)

7549

+{

7550

+ printf("hello, world!\n");

7551

+}

7552

+

7553

+__attribute__ ((hotpatch(1)))

7554

+__attribute__ ((always_inline))

7555

+void hp9(void) /* { dg-warning "always_inline function might not be inlinable" } */

7556

+{

7557

+ printf("hello, world!\n");

7558

+} /* { dg-warning "function 'hp9' with the 'always_inline' attribute is not hotpatchable" } */

7559

+

7560

+int main (void)

7561

+{

7562

+ return 0;

7563

+}

7564

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c

7565

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

7566

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c (.../tags/gcc_4_8_2_release)

7567

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c (.../branches/gcc-4_8-branch)

7568

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

7569

+/* { dg-do compile } */

7570

+/* { dg-require-effective-target htm } */

7571

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7572

+

7573

+void must_not_compile1 (void)

7574

+{

7575

+ __builtin_tabort (0); /* { dg-error "Invalid transaction abort code:" } */

7576

+}

7577

+

7578

+void must_not_compile2 (void)

7579

+{

7580

+ __builtin_tabort (255); /* { dg-error "Invalid transaction abort code:" } */

7581

+}

7582

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c

7583

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

7584

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c (.../tags/gcc_4_8_2_release)

7585

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c (.../branches/gcc-4_8-branch)

7586

@@ -0,0 +1,37 @@

7587

+/* This checks the availability of the XL compiler intrinsics for

7588

+ transactional execution with the expected prototypes. */

7589

+

7590

+/* { dg-do compile } */

7591

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7592

+

7593

+#include <htmxlintrin.h>

7594

+

7595

+int a = 0;

7596

+unsigned long g;

7597

+

7598

+int

7599

+foo ()

7600

+{

7601

+ struct __htm_tdb *tdb_struct;

7602

+ void * const tdb = tdb_struct;

7603

+ long result;

7604

+ unsigned char code;

7605

+

7606

+ result = __TM_simple_begin ();

7607

+ result = __TM_begin (tdb);

7608

+ result = __TM_end ();

7609

+ __TM_abort ();

7610

+ __TM_named_abort (42);

7611

+ __TM_non_transactional_store (&g, 42);

7612

+ result = __TM_nesting_depth (tdb);

7613

+

7614

+ result = __TM_is_user_abort (tdb);

7615

+ result = __TM_is_named_user_abort (tdb, &code);

7616

+ result = __TM_is_illegal (tdb);

7617

+ result = __TM_is_footprint_exceeded (tdb);

7618

+ result = __TM_is_nested_too_deep (tdb);

7619

+ result = __TM_is_conflict (tdb);

7620

+ result = __TM_is_failure_persistent (result);

7621

+ result = __TM_failure_address (tdb);

7622

+ result = __TM_failure_code (tdb);

7623

+}

7624

Index: gcc/testsuite/gcc.target/s390/s390.exp

7625

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

7626

--- a/src/gcc/testsuite/gcc.target/s390/s390.exp (.../tags/gcc_4_8_2_release)

7627

+++ b/src/gcc/testsuite/gcc.target/s390/s390.exp (.../branches/gcc-4_8-branch)

7628

@@ -24,6 +24,19 @@

7629

# Load support procs.

7630

load_lib gcc-dg.exp

7631

7632

+# Return 1 if htm (etnd - extract nesting depth) instructions can be

7633

+# compiled.

7634

+proc check_effective_target_htm { } {

7635

+ if { ![check_runtime s390_check_htm [subst {

7636

+ int main (void)

7637

+ {

7638

+ unsigned int nd = 77;

7639

+ asm (".insn rre,0xb2ec0000,%0,0" : "=d" (nd));

7640

+ return nd;

7641

+ }

7642

+ }]] } { return 0 } else { return 1 }

7643

+}

7644

+

7645

# If a testcase doesn't have special options, use these.

7646

global DEFAULT_CFLAGS

7647

if ![info exists DEFAULT_CFLAGS] then {

7648

Index: gcc/testsuite/gcc.target/s390/hotpatch-1.c

7649

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

7650

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-1.c (.../tags/gcc_4_8_2_release)

7651

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-1.c (.../branches/gcc-4_8-branch)

7652

@@ -0,0 +1,20 @@

7653

+/* Functional tests for the function hotpatching feature. */

7654

+

7655

+/* { dg-do run } */

7656

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7657

+

7658

+#include <stdio.h>

7659

+

7660

+void hp1(void)

7661

+{

7662

+ printf("hello, world!\n");

7663

+}

7664

+

7665

+int main (void)

7666

+{

7667

+ return 0;

7668

+}

7669

+

7670

+/* Check number of occurences of certain instructions. */

7671

+/* { dg-final { scan-assembler-times "nopr\t%r7" 12 } } */

7672

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7673

Index: gcc/testsuite/gcc.target/s390/hotpatch-2.c

7674

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

7675

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-2.c (.../tags/gcc_4_8_2_release)

7676

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-2.c (.../branches/gcc-4_8-branch)

7677

@@ -0,0 +1,20 @@

7678

+/* Functional tests for the function hotpatching feature. */

7679

+

7680

+/* { dg-do run } */

7681

+/* { dg-options "-O3 -mzarch -mhotpatch=1 --save-temps" } */

7682

+

7683

+#include <stdio.h>

7684

+

7685

+void hp1(void)

7686

+{

7687

+ printf("hello, world!\n");

7688

+}

7689

+

7690

+int main (void)

7691

+{

7692

+ return 0;

7693

+}

7694

+

7695

+/* Check number of occurences of certain instructions. */

7696

+/* { dg-final { scan-assembler-times "nopr\t%r7" 1 } } */

7697

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7698

Index: gcc/testsuite/gcc.target/s390/hotpatch-3.c

7699

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

7700

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-3.c (.../tags/gcc_4_8_2_release)

7701

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-3.c (.../branches/gcc-4_8-branch)

7702

@@ -0,0 +1,20 @@

7703

+/* Functional tests for the function hotpatching feature. */

7704

+

7705

+/* { dg-do run } */

7706

+/* { dg-options "-O3 -mzarch -mhotpatch=0 --save-temps" } */

7707

+

7708

+#include <stdio.h>

7709

+

7710

+void hp1(void)

7711

+{

7712

+ printf("hello, world!\n");

7713

+}

7714

+

7715

+int main (void)

7716

+{

7717

+ return 0;

7718

+}

7719

+

7720

+/* Check number of occurences of certain instructions. */

7721

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

7722

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7723

Index: gcc/testsuite/gcc.target/s390/hotpatch-4.c

7724

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

7725

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-4.c (.../tags/gcc_4_8_2_release)

7726

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-4.c (.../branches/gcc-4_8-branch)

7727

@@ -0,0 +1,26 @@

7728

+/* Functional tests for the function hotpatching feature. */

7729

+

7730

+/* { dg-do run } */

7731

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7732

+

7733

+#include <stdio.h>

7734

+

7735

+inline void hp1(void)

7736

+{

7737

+ printf("hello, world!\n");

7738

+}

7739

+

7740

+__attribute__ ((always_inline))

7741

+void hp2(void) /* { dg-warning "always_inline function might not be inlinable" } */

7742

+{

7743

+ printf("hello, world!\n");

7744

+} /* { dg-warning "function 'hp2' with the 'always_inline' attribute is not hotpatchable" } */

7745

+

7746

+int main (void)

7747

+{

7748

+ return 0;

7749

+}

7750

+

7751

+/* Check number of occurences of certain instructions. */

7752

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

7753

+/* { dg-final { scan-assembler-not "nop\t0" } } */

7754

Index: gcc/testsuite/gcc.target/s390/hotpatch-5.c

7755

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

7756

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-5.c (.../tags/gcc_4_8_2_release)

7757

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-5.c (.../branches/gcc-4_8-branch)

7758

@@ -0,0 +1,21 @@

7759

+/* Functional tests for the function hotpatching feature. */

7760

+

7761

+/* { dg-do run } */

7762

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7763

+

7764

+#include <stdio.h>

7765

+

7766

+__attribute__ ((hotpatch))

7767

+void hp1(void)

7768

+{

7769

+ printf("hello, world!\n");

7770

+}

7771

+

7772

+int main (void)

7773

+{

7774

+ return 0;

7775

+}

7776

+

7777

+/* Check number of occurences of certain instructions. */

7778

+/* { dg-final { scan-assembler-times "nopr\t%r7" 12 } } */

7779

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7780

Index: gcc/testsuite/gcc.target/s390/hotpatch-6.c

7781

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

7782

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-6.c (.../tags/gcc_4_8_2_release)

7783

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-6.c (.../branches/gcc-4_8-branch)

7784

@@ -0,0 +1,21 @@

7785

+/* Functional tests for the function hotpatching feature. */

7786

+

7787

+/* { dg-do run } */

7788

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

7789

+

7790

+#include <stdio.h>

7791

+

7792

+__attribute__ ((hotpatch(1)))

7793

+void hp1(void)

7794

+{

7795

+ printf("hello, world!\n");

7796

+}

7797

+

7798

+int main (void)

7799

+{

7800

+ return 0;

7801

+}

7802

+

7803

+/* Check number of occurences of certain instructions. */

7804

+/* { dg-final { scan-assembler-times "nopr\t%r7" 1 } } */

7805

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

7806

Index: gcc/testsuite/gcc.target/s390/htm-builtins-1.c

7807

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

7808

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-1.c (.../tags/gcc_4_8_2_release)

7809

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-1.c (.../branches/gcc-4_8-branch)

7810

@@ -0,0 +1,1073 @@

7811

+/* Functional tests of the htm __builtin_... macros. */

7812

+

7813

+/* { dg-do run } */

7814

+/* { dg-require-effective-target htm } */

7815

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

7816

+

7817

+/* ---------------------------- included header files ---------------------- */

7818

+

7819

+#include <stdio.h>

7820

+#include <string.h>

7821

+#include <stdint.h>

7822

+#include <htmintrin.h>

7823

+

7824

+/* ---------------------------- local definitions -------------------------- */

7825

+

7826

+#define DEFAULT_MAX_REPETITIONS 5

7827

+#define DEFAULT_REQUIRED_QUORUM ((DEFAULT_MAX_REPETITIONS) - 1)

7828

+#define NUM_WARMUP_RUNS 10

7829

+

7830

+/* ---------------------------- local macros ------------------------------- */

7831

+

7832

+#define TEST_DF_REP(name) \

7833

+ { #name, name, DEFAULT_MAX_REPETITIONS, DEFAULT_REQUIRED_QUORUM }

7834

+#define TEST_NO_REP(name) { #name, name, 1, 1 }

7835

+

7836

+/* ---------------------------- local types -------------------------------- */

7837

+

7838

+typedef int (*test_func_t)(void);

7839

+

7840

+typedef struct

7841

+{

7842

+ const char *name;

7843

+ test_func_t test_func;

7844

+ int max_repetitions;

7845

+ int required_quorum;

7846

+} test_table_entry_t;

7847

+

7848

+/* ---------------------------- local variables ---------------------------- */

7849

+

7850

+__attribute__ ((aligned(256))) static struct __htm_tdb local_tdb256;

7851

+static struct __htm_tdb local_tdb;

7852

+static int do_dump_tdb = 0;

7853

+

7854

+/* ---------------------------- exported variables (globals) --------------- */

7855

+

7856

+__attribute__ ((aligned(256))) struct

7857

+{

7858

+ float float_1;

7859

+ float float_2;

7860

+ float float_3;

7861

+} global = { 1.0, 2.5, 0.0 };

7862

+

7863

+__attribute__ ((aligned(256))) struct

7864

+{

7865

+ volatile uint64_t c1;

7866

+ volatile uint64_t c2;

7867

+ volatile uint64_t c3;

7868

+} counters = { 0, 0, 0 };

7869

+

7870

+/* ---------------------------- local helper functions --------------------- */

7871

+

7872

+static void dump_tdb (struct __htm_tdb *tdb)

7873

+{

7874

+ unsigned char *p;

7875

+ int i;

7876

+ int j;

7877

+

7878

+ if (do_dump_tdb == 0)

7879

+ {

7880

+ return;

7881

+ }

7882

+ p = (unsigned char *)tdb;

7883

+ for (i = 0; i < 16; i++)

7884

+ {

7885

+ fprintf (stderr, "0x%02x ", i * 16);

7886

+ for (j = 0; j < 16; j++)

7887

+ {

7888

+ fprintf (stderr, "%02x", (int)p[i * 16 + j]);

7889

+ if (j < 15)

7890

+ {

7891

+ fprintf (stderr, " ");

7892

+ }

7893

+ if (j == 7)

7894

+ {

7895

+ fprintf (stderr, " ");

7896

+ }

7897

+ }

7898

+ fprintf (stderr, "\n");

7899

+ }

7900

+

7901

+ return;

7902

+}

7903

+

7904

+/* ---------------------------- local test functions ----------------------- */

7905

+

7906

+/* Check values of the constants defined in htmintrin.h. */

7907

+static int test_constants (void)

7908

+{

7909

+ if (_HTM_TBEGIN_STARTED != 0)

7910

+ {

7911

+ return 100 * _HTM_TBEGIN_STARTED + 1;

7912

+ }

7913

+ if (_HTM_TBEGIN_INDETERMINATE != 1)

7914

+ {

7915

+ return 100 * _HTM_TBEGIN_INDETERMINATE + 2;

7916

+ }

7917

+ if (_HTM_TBEGIN_TRANSIENT != 2)

7918

+ {

7919

+ return 100 * _HTM_TBEGIN_TRANSIENT + 3;

7920

+ }

7921

+ if (_HTM_TBEGIN_PERSISTENT != 3)

7922

+ {

7923

+ return 100 * _HTM_TBEGIN_PERSISTENT + 4;

7924

+ }

7925

+

7926

+ return 0;

7927

+}

7928

+

7929

+static int test_tbegin_ntstg_tend (void)

7930

+{

7931

+ int rc;

7932

+

7933

+ counters.c1 = 0;

7934

+ counters.c2 = 0;

7935

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

7936

+ {

7937

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

7938

+ counters.c2 = 2;

7939

+ rc = __builtin_tend ();

7940

+ if (rc != 0)

7941

+ {

7942

+ return 100 * rc + 5;

7943

+ }

7944

+ if (counters.c1 != 1)

7945

+ {

7946

+ return 100 * counters.c1 + 2;

7947

+ }

7948

+ if (counters.c2 != 2)

7949

+ {

7950

+ return 100 * counters.c2 + 3;

7951

+ }

7952

+ }

7953

+ else

7954

+ {

7955

+ return 100 * rc + 4;

7956

+ }

7957

+

7958

+ return 0;

7959

+}

7960

+

7961

+static int test_tbegin_ntstg_tabort (void)

7962

+{

7963

+ float f;

7964

+

7965

+ counters.c1 = 0;

7966

+ counters.c2 = 0;

7967

+ f = 0;

7968

+ if (__builtin_tbegin ((void *)0) == 0)

7969

+ {

7970

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

7971

+ counters.c2 = 2;

7972

+ f = 1;

7973

+ __builtin_tabort (256);

7974

+ return 1;

7975

+ }

7976

+ if (counters.c1 != 1)

7977

+ {

7978

+ return 100 * counters.c1 + 2;

7979

+ }

7980

+ if (counters.c2 != 0)

7981

+ {

7982

+ return 100 * counters.c2 + 3;

7983

+ }

7984

+ if (f != 0)

7985

+ {

7986

+ return 100 * f + 4;

7987

+ }

7988

+

7989

+ return 0;

7990

+}

7991

+

7992

+static int test_tbegin_nofloat (void)

7993

+{

7994

+ int rc;

7995

+

7996

+ counters.c1 = 0;

7997

+ counters.c2 = 0;

7998

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

7999

+ {

8000

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

8001

+ counters.c2 = 2;

8002

+ rc = __builtin_tend ();

8003

+ if (rc != 0)

8004

+ {

8005

+ return 100 * rc + 5;

8006

+ }

8007

+ if (counters.c1 != 1)

8008

+ {

8009

+ return 100 * counters.c1 + 2;

8010

+ }

8011

+ if (counters.c2 != 2)

8012

+ {

8013

+ return 100 * counters.c2 + 3;

8014

+ }

8015

+ }

8016

+ else

8017

+ {

8018

+ return 100 * rc + 4;

8019

+ }

8020

+

8021

+ return 0;

8022

+}

8023

+

8024

+static int test_tbegin_retry (void)

8025

+{

8026

+ int rc;

8027

+

8028

+ counters.c1 = 0;

8029

+ counters.c2 = 0;

8030

+ counters.c3 = 0;

8031

+ if ((rc = __builtin_tbegin_retry ((void *)0, 5)) == 0)

8032

+ {

8033

+ int do_abort;

8034

+

8035

+ do_abort = (counters.c1 == 0) ? 1 : 0;

8036

+ __builtin_non_tx_store (

8037

+ (uint64_t *)&counters.c1, counters.c1 + 1);

8038

+ if (do_abort == 1)

8039

+ {

8040

+ __builtin_tabort (256);

8041

+ }

8042

+ counters.c2 = counters.c2 + 10;

8043

+ __builtin_non_tx_store ((uint64_t *)&counters.c3, 3);

8044

+ rc = __builtin_tend ();

8045

+ if (rc != 0)

8046

+ {

8047

+ return 100 * rc + 5;

8048

+ }

8049

+ if (counters.c1 != 2)

8050

+ {

8051

+ return 100 * counters.c1 + 2;

8052

+ }

8053

+ if (counters.c2 != 10)

8054

+ {

8055

+ return 100 * counters.c2 + 3;

8056

+ }

8057

+ if (counters.c3 != 3)

8058

+ {

8059

+ return 100 * counters.c3 + 6;

8060

+ }

8061

+ }

8062

+ else

8063

+ {

8064

+ return 100 * rc + 4;

8065

+ }

8066

+

8067

+ return 0;

8068

+}

8069

+

8070

+static int test_tbegin_retry_nofloat (void)

8071

+{

8072

+ int rc;

8073

+

8074

+ counters.c1 = 0;

8075

+ counters.c2 = 0;

8076

+ counters.c3 = 0;

8077

+ if ((rc = __builtin_tbegin_retry_nofloat ((void *)0, 5)) == 0)

8078

+ {

8079

+ int do_abort;

8080

+

8081

+ do_abort = (counters.c1 == 0) ? 1 : 0;

8082

+ __builtin_non_tx_store (

8083

+ (uint64_t *)&counters.c1, counters.c1 + 1);

8084

+ if (do_abort == 1)

8085

+ {

8086

+ __builtin_tabort (256);

8087

+ }

8088

+ counters.c2 = counters.c2 + 10;

8089

+ __builtin_non_tx_store ((uint64_t *)&counters.c3, 3);

8090

+ rc = __builtin_tend ();

8091

+ if (rc != 0)

8092

+ {

8093

+ return 100 * rc + 5;

8094

+ }

8095

+ if (counters.c1 != 2)

8096

+ {

8097

+ return 100 * counters.c1 + 2;

8098

+ }

8099

+ if (counters.c2 != 10)

8100

+ {

8101

+ return 100 * counters.c2 + 3;

8102

+ }

8103

+ if (counters.c3 != 3)

8104

+ {

8105

+ return 100 * counters.c3 + 6;

8106

+ }

8107

+ }

8108

+ else

8109

+ {

8110

+ return 100 * rc + 4;

8111

+ }

8112

+

8113

+ return 0;

8114

+}

8115

+

8116

+static int test_tbegin_aborts (void)

8117

+{

8118

+ float f;

8119

+ int rc;

8120

+

8121

+ f = 77;

8122

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8123

+ {

8124

+ f = 88;

8125

+ __builtin_tabort (256);

8126

+ return 2;

8127

+ }

8128

+ else if (rc != 2)

8129

+ {

8130

+ return 3;

8131

+ }

8132

+ if (f != 77)

8133

+ {

8134

+ return 4;

8135

+ }

8136

+ f = 66;

8137

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8138

+ {

8139

+ f = 99;

8140

+ __builtin_tabort (257);

8141

+ return 5;

8142

+ }

8143

+ else if (rc != 3)

8144

+ {

8145

+ return 100 * rc + 6;

8146

+ }

8147

+ if (f != 66)

8148

+ {

8149

+ return 100 * f + 7;

8150

+ }

8151

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8152

+ {

8153

+ global.float_3 = global.float_1 + global.float_2;

8154

+ rc = __builtin_tend ();

8155

+ if (rc != 0)

8156

+ {

8157

+ return 100 * rc + 8;

8158

+ }

8159

+ }

8160

+ else

8161

+ {

8162

+ return 100 * rc + 9;

8163

+ }

8164

+ if (global.float_3 != global.float_1 + global.float_2)

8165

+ {

8166

+ return 100 * rc + 10;

8167

+ }

8168

+

8169

+ return 0;

8170

+}

8171

+

8172

+static __attribute__((noinline)) void indirect_abort(int abort_code)

8173

+{

8174

+ __builtin_tabort (abort_code);

8175

+

8176

+ return;

8177

+}

8178

+

8179

+static int test_tbegin_indirect_aborts (void)

8180

+{

8181

+ float f;

8182

+ int rc;

8183

+

8184

+ f = 77;

8185

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8186

+ {

8187

+ f = 88;

8188

+ indirect_abort(256);

8189

+ return 2;

8190

+ }

8191

+ else if (rc != 2)

8192

+ {

8193

+ return 100 * rc + 3;

8194

+ }

8195

+ if (f != 77)

8196

+ {

8197

+ return 100 * rc + 4;

8198

+ }

8199

+ f = 66;

8200

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8201

+ {

8202

+ f = 99;

8203

+ indirect_abort(257);

8204

+ return 5;

8205

+ }

8206

+ else if (rc != 3)

8207

+ {

8208

+ return 100 * rc + 6;

8209

+ }

8210

+ if (f != 66)

8211

+ {

8212

+ return 100 * f + 7;

8213

+ }

8214

+

8215

+ return 0;

8216

+}

8217

+

8218

+static int test_tbegin_nofloat_aborts (void)

8219

+{

8220

+ int rc;

8221

+

8222

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8223

+ {

8224

+ __builtin_tabort (256);

8225

+ return 2;

8226

+ }

8227

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8228

+ {

8229

+ __builtin_tabort (257);

8230

+ return 1005;

8231

+ }

8232

+ else if (rc != 3)

8233

+ {

8234

+ return 1000 * rc + 6;

8235

+ }

8236

+

8237

+ return 0;

8238

+}

8239

+

8240

+static int test_tbegin_nofloat_indirect_aborts (void)

8241

+{

8242

+ int rc;

8243

+

8244

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8245

+ {

8246

+ indirect_abort (256);

8247

+ return 2;

8248

+ }

8249

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

8250

+ {

8251

+ indirect_abort (257);

8252

+ return 1005;

8253

+ }

8254

+ else if (rc != 3)

8255

+ {

8256

+ return 1000 * rc + 6;

8257

+ }

8258

+

8259

+ return 0;

8260

+}

8261

+

8262

+static

8263

+int _test_tbegin_retry_aborts (int retries, uint64_t abort_code)

8264

+{

8265

+ int rc;

8266

+

8267

+ counters.c1 = 0;

8268

+ if ((rc = __builtin_tbegin_retry ((void *)0, retries)) == 0)

8269

+ {

8270

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, counters.c1 + 1);

8271

+ __builtin_tabort (abort_code);

8272

+ return 2;

8273

+ }

8274

+ else

8275

+ {

8276

+ if ((abort_code & 1) == 0)

8277

+ {

8278

+ if (rc != 2)

8279

+ {

8280

+ return 100 * rc + 2003;

8281

+ }

8282

+ else if (counters.c1 != (uint64_t)retries + 1)

8283

+ {

8284

+ return 1000 * counters.c1 + 100 * retries + 4;

8285

+ }

8286

+ }

8287

+ else

8288

+ {

8289

+ if (rc != 3)

8290

+ {

8291

+ return 100 * rc + 3005;

8292

+ }

8293

+ else if (counters.c1 != 1)

8294

+ {

8295

+ return 1000 * counters.c1 + 100 * retries + 6;

8296

+ }

8297

+ }

8298

+ }

8299

+

8300

+ return 0;

8301

+}

8302

+

8303

+static int test_tbegin_retry_aborts (void)

8304

+{

8305

+ int rc;

8306

+ int retries;

8307

+

8308

+ for (retries = 1; retries <= 3; retries++)

8309

+ {

8310

+ rc = _test_tbegin_retry_aborts (retries, 256);

8311

+ if (rc != 0)

8312

+ {

8313

+ return 10000 + rc;

8314

+ }

8315

+ }

8316

+ for (retries = 1; retries <= 3; retries++)

8317

+ {

8318

+ rc = _test_tbegin_retry_aborts (retries, 257);

8319

+ if (rc != 0)

8320

+ {

8321

+ return 20000 + rc;

8322

+ }

8323

+ }

8324

+ if ((rc = __builtin_tbegin_retry ((void *)0, 5)) == 0)

8325

+ {

8326

+ global.float_3 = global.float_1 + global.float_2;

8327

+ rc = __builtin_tend ();

8328

+ if (rc != 0)

8329

+ {

8330

+ return 30000 + 100 * rc + 6;

8331

+ }

8332

+ }

8333

+ else

8334

+ {

8335

+ return 30000 + 100 * rc + 7;

8336

+ }

8337

+

8338

+ return 0;

8339

+}

8340

+

8341

+static int _test_tbegin_retry_nofloat_aborts (int retries, uint64_t abort_code)

8342

+{

8343

+ int rc;

8344

+

8345

+ counters.c1 = 0;

8346

+ if ((rc = __builtin_tbegin_retry_nofloat ((void *)0, retries)) == 0)

8347

+ {

8348

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, counters.c1 + 1);

8349

+ __builtin_tabort (abort_code);

8350

+ return 2;

8351

+ }

8352

+ else

8353

+ {

8354

+ if ((abort_code & 1) == 0)

8355

+ {

8356

+ if (rc != 2)

8357

+ {

8358

+ return 100 * rc + 2003;

8359

+ }

8360

+ else if (counters.c1 != (uint64_t)retries + 1)

8361

+ {

8362

+ return 1000 * counters.c1 + 100 * retries + 4;

8363

+ }

8364

+ }

8365

+ else

8366

+ {

8367

+ if (rc != 3)

8368

+ {

8369

+ return 100 * rc + 3005;

8370

+ }

8371

+ else if (counters.c1 != 1)

8372

+ {

8373

+ return 1000 * counters.c1 + 100 * retries + 6;

8374

+ }

8375

+ }

8376

+ }

8377

+

8378

+ return 0;

8379

+}

8380

+

8381

+static int test_tbegin_retry_nofloat_aborts (void)

8382

+{

8383

+ int rc;

8384

+ int retries;

8385

+

8386

+ for (retries = 1; retries <= 3; retries++)

8387

+ {

8388

+ rc = _test_tbegin_retry_nofloat_aborts (retries, 256);

8389

+ if (rc != 0)

8390

+ {

8391

+ return 10 * retries + rc;

8392

+ }

8393

+ }

8394

+ for (retries = 1; retries <= 3; retries++)

8395

+ {

8396

+ rc = _test_tbegin_retry_nofloat_aborts (retries, 257);

8397

+ if (rc != 0)

8398

+ {

8399

+ return 10000 + 10 * retries + rc;

8400

+ }

8401

+ }

8402

+

8403

+ return 0;

8404

+}

8405

+

8406

+static int test_tbegin_tdb (void)

8407

+{

8408

+ int rc;

8409

+

8410

+ local_tdb.format = 0;

8411

+ if ((rc = __builtin_tbegin (&local_tdb)) == 0)

8412

+ {

8413

+ rc = __builtin_tend ();

8414

+ if (rc != 0)

8415

+ {

8416

+ return 100 * rc + 1;

8417

+ }

8418

+ if (local_tdb.format != 0)

8419

+ {

8420

+ dump_tdb (&local_tdb);

8421

+ return 100 * local_tdb.format + 2;

8422

+ }

8423

+ }

8424

+ else

8425

+ {

8426

+ return 100 * rc + 3;

8427

+ }

8428

+ local_tdb.format = 0;

8429

+ if ((rc = __builtin_tbegin (&local_tdb)) == 0)

8430

+ {

8431

+ __builtin_tabort (257);

8432

+ return 4;

8433

+ }

8434

+ else

8435

+ {

8436

+ if (rc != 3)

8437

+ {

8438

+ return 100 * rc + 5;

8439

+ }

8440

+ if (local_tdb.format != 1)

8441

+ {

8442

+ dump_tdb (&local_tdb);

8443

+ return 100 * local_tdb.format + 6;

8444

+ }

8445

+ }

8446

+ local_tdb256.format = 0;

8447

+ if ((rc = __builtin_tbegin (&local_tdb256)) == 0)

8448

+ {

8449

+ rc = __builtin_tend ();

8450

+ if (rc != 0)

8451

+ {

8452

+ return 1100 * rc + 1;

8453

+ }

8454

+ if (local_tdb256.format != 0)

8455

+ {

8456

+ dump_tdb (&local_tdb256);

8457

+ return 1100 * local_tdb256.format + 2;

8458

+ }

8459

+ }

8460

+ else

8461

+ {

8462

+ return 1100 * rc + 3;

8463

+ }

8464

+ local_tdb256.format = 0;

8465

+ if ((rc = __builtin_tbegin (&local_tdb256)) == 0)

8466

+ {

8467

+ __builtin_tabort (257);

8468

+ return 2004;

8469

+ }

8470

+ else

8471

+ {

8472

+ if (rc != 3)

8473

+ {

8474

+ return 2100 * rc + 5;

8475

+ }

8476

+ if (local_tdb256.format != 1)

8477

+ {

8478

+ dump_tdb (&local_tdb256);

8479

+ return 2100 * local_tdb256.format + 6;

8480

+ }

8481

+ }

8482

+

8483

+ return 0;

8484

+}

8485

+

8486

+static int test_tbegin_nofloat_tdb (void)

8487

+{

8488

+ int rc;

8489

+

8490

+ local_tdb.format = 0;

8491

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb)) == 0)

8492

+ {

8493

+ rc = __builtin_tend ();

8494

+ if (rc != 0)

8495

+ {

8496

+ return 100 * rc + 1;

8497

+ }

8498

+ if (local_tdb.format != 0)

8499

+ {

8500

+ dump_tdb (&local_tdb);

8501

+ return 100 * local_tdb.format + 2;

8502

+ }

8503

+ }

8504

+ else

8505

+ {

8506

+ return 3;

8507

+ }

8508

+ local_tdb.format = 0;

8509

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb)) == 0)

8510

+ {

8511

+ __builtin_tabort (257);

8512

+ return 4;

8513

+ }

8514

+ else

8515

+ {

8516

+ if (rc != 3)

8517

+ {

8518

+ return 100 * rc + 5;

8519

+ }

8520

+ if (local_tdb.format != 1)

8521

+ {

8522

+ dump_tdb (&local_tdb);

8523

+ return 100 * local_tdb.format + 6;

8524

+ }

8525

+ }

8526

+ local_tdb256.format = 0;

8527

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb256)) == 0)

8528

+ {

8529

+ rc = __builtin_tend ();

8530

+ if (rc != 0)

8531

+ {

8532

+ return 1100 * rc + 1;

8533

+ }

8534

+ if (local_tdb256.format != 0)

8535

+ {

8536

+ dump_tdb (&local_tdb256);

8537

+ return 1100 * local_tdb256.format + 2;

8538

+ }

8539

+ }

8540

+ else

8541

+ {

8542

+ return 1003;

8543

+ }

8544

+ local_tdb256.format = 0;

8545

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb256)) == 0)

8546

+ {

8547

+ __builtin_tabort (257);

8548

+ return 2004;

8549

+ }

8550

+ else

8551

+ {

8552

+ if (rc != 3)

8553

+ {

8554

+ return 2100 * rc + 5;

8555

+ }

8556

+ if (local_tdb256.format != 1)

8557

+ {

8558

+ dump_tdb (&local_tdb256);

8559

+ return 2100 * local_tdb256.format + 6;

8560

+ }

8561

+ }

8562

+

8563

+ return 0;

8564

+}

8565

+

8566

+static int test_tbegin_retry_tdb (void)

8567

+{

8568

+ int rc;

8569

+

8570

+ local_tdb256.format = 0;

8571

+ if ((rc = __builtin_tbegin_retry (&local_tdb256, 2)) == 0)

8572

+ {

8573

+ rc = __builtin_tend ();

8574

+ if (rc != 0)

8575

+ {

8576

+ return 1100 * rc + 1;

8577

+ }

8578

+ if (local_tdb256.format != 0)

8579

+ {

8580

+ dump_tdb (&local_tdb256);

8581

+ return 1100 * local_tdb256.format + 2;

8582

+ }

8583

+ }

8584

+ else

8585

+ {

8586

+ return 1003;

8587

+ }

8588

+ local_tdb256.format = 0;

8589

+ if ((rc = __builtin_tbegin_retry (&local_tdb256, 2)) == 0)

8590

+ {

8591

+ __builtin_tabort (257);

8592

+ return 2004;

8593

+ }

8594

+ else

8595

+ {

8596

+ if (rc != 3)

8597

+ {

8598

+ return 2100 * rc + 5;

8599

+ }

8600

+ if (local_tdb256.format != 1)

8601

+ {

8602

+ dump_tdb (&local_tdb256);

8603

+ return 2100 * local_tdb256.format + 6;

8604

+ }

8605

+ }

8606

+

8607

+ return 0;

8608

+}

8609

+

8610

+static int test_tbegin_retry_nofloat_tdb (void)

8611

+{

8612

+ int rc;

8613

+

8614

+ local_tdb.format = 0;

8615

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb, 2)) == 0)

8616

+ {

8617

+ rc = __builtin_tend ();

8618

+ if (rc != 0)

8619

+ {

8620

+ return 100 * rc + 1;

8621

+ }

8622

+ if (local_tdb.format != 0)

8623

+ {

8624

+ dump_tdb (&local_tdb);

8625

+ return 100 * local_tdb.format + 2;

8626

+ }

8627

+ }

8628

+ else

8629

+ {

8630

+ return 100 * rc + 3;

8631

+ }

8632

+ local_tdb.format = 0;

8633

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb, 2)) == 0)

8634

+ {

8635

+ __builtin_tabort (257);

8636

+ return 4;

8637

+ }

8638

+ else

8639

+ {

8640

+ if (rc != 3)

8641

+ {

8642

+ return 100 * rc + 5;

8643

+ }

8644

+ if (local_tdb.format != 1)

8645

+ {

8646

+ dump_tdb (&local_tdb);

8647

+ return 100 * local_tdb.format + 6;

8648

+ }

8649

+ }

8650

+ local_tdb256.format = 0;

8651

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb256, 2)) == 0)

8652

+ {

8653

+ rc = __builtin_tend ();

8654

+ if (rc != 0)

8655

+ {

8656

+ return 1100 * rc + 1;

8657

+ }

8658

+ if (local_tdb256.format != 0)

8659

+ {

8660

+ dump_tdb (&local_tdb256);

8661

+ return 1100 * local_tdb256.format + 2;

8662

+ }

8663

+ }

8664

+ else

8665

+ {

8666

+ return 1100 * rc + 3;

8667

+ }

8668

+ local_tdb256.format = 0;

8669

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb256, 2)) == 0)

8670

+ {

8671

+ __builtin_tabort (257);

8672

+ return 2004;

8673

+ }

8674

+ else

8675

+ {

8676

+ if (rc != 3)

8677

+ {

8678

+ return 2100 * rc + 5;

8679

+ }

8680

+ if (local_tdb256.format != 1)

8681

+ {

8682

+ dump_tdb (&local_tdb256);

8683

+ return 2100 * local_tdb256.format + 6;

8684

+ }

8685

+ }

8686

+

8687

+ return 0;

8688

+}

8689

+

8690

+static int test_etnd (void)

8691

+{

8692

+ int rc;

8693

+

8694

+ counters.c1 = 0;

8695

+ counters.c2 = 0;

8696

+ counters.c3 = 0;

8697

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

8698

+ {

8699

+ counters.c1 = __builtin_tx_nesting_depth ();

8700

+ if (__builtin_tbegin ((void *)0) == 0)

8701

+ {

8702

+ counters.c2 = __builtin_tx_nesting_depth ();

8703

+ if (__builtin_tbegin ((void *)0) == 0)

8704

+ {

8705

+ counters.c3 = __builtin_tx_nesting_depth ();

8706

+ __builtin_tend ();

8707

+ }

8708

+ __builtin_tend ();

8709

+ }

8710

+ __builtin_tend ();

8711

+ }

8712

+ else

8713

+ {

8714

+ return 100 * rc + 1;

8715

+ }

8716

+ if (counters.c1 != 1)

8717

+ {

8718

+ return 100 * counters.c1 + 2;

8719

+ }

8720

+ if (counters.c2 != 2)

8721

+ {

8722

+ return 100 * counters.c2 + 3;

8723

+ }

8724

+ if (counters.c3 != 3)

8725

+ {

8726

+ return 100 * counters.c3 + 4;

8727

+ }

8728

+

8729

+ return 0;

8730

+}

8731

+

8732

+static int test_tbeginc (void)

8733

+{

8734

+ int rc;

8735

+

8736

+ counters.c1 = 0;

8737

+ __builtin_tbeginc ();

8738

+ counters.c1 = 1;

8739

+ rc = __builtin_tend ();

8740

+ if (rc != 0)

8741

+ {

8742

+ return 10000 * rc + 1;

8743

+ }

8744

+ if (counters.c1 != 1)

8745

+ {

8746

+ return 100000 * counters.c1 + 3;

8747

+ }

8748

+

8749

+ return 0;

8750

+}

8751

+

8752

+/* ---------------------------- local testing framework functions ---------- */

8753

+

8754

+static int run_one_test (const test_table_entry_t *test_entry)

8755

+{

8756

+ int do_print_passes;

8757

+ int succeeded;

8758

+ int rc;

8759

+ int i;

8760

+

8761

+ /* Warmup run to get all necessary data and instruction pages into the page

8762

+ * tables. */

8763

+ {

8764

+ int run;

8765

+

8766

+ do_dump_tdb = 0;

8767

+ for (run = 0; run < NUM_WARMUP_RUNS; run++)

8768

+ {

8769

+ test_entry->test_func ();

8770

+ }

8771

+ do_dump_tdb = 1;

8772

+ }

8773

+ do_print_passes = (

8774

+ test_entry->required_quorum != 1 ||

8775

+ test_entry->max_repetitions != 1);

8776

+ printf ("RRR RUN %s\n", test_entry->name);

8777

+ if (do_print_passes == 1)

8778

+ {

8779

+ printf (

8780

+ " (requires %d successful out of %d runs)\n",

8781

+ test_entry->required_quorum,

8782

+ test_entry->max_repetitions);

8783

+ }

8784

+ succeeded = 0;

8785

+ rc = 0;

8786

+ for (rc = 0, i = 0; i < test_entry->max_repetitions; i++)

8787

+ {

8788

+ if (do_print_passes == 1)

8789

+ {

8790

+ if (i == 0)

8791

+ {

8792

+ printf (" ");

8793

+ }

8794

+ else

8795

+ {

8796

+ printf (",");

8797

+ }

8798

+ }

8799

+ rc = test_entry->test_func ();

8800

+ if (rc == 0)

8801

+ {

8802

+ if (do_print_passes == 1)

8803

+ {

8804

+ printf (" success");

8805

+ }

8806

+ succeeded++;

8807

+ if (succeeded >= test_entry->required_quorum)

8808

+ {

8809

+ break;

8810

+ }

8811

+ }

8812

+ else

8813

+ {

8814

+ printf (" failed (rc = %d)", rc);

8815

+ }

8816

+ }

8817

+ if (do_print_passes == 1 || rc != 0)

8818

+ {

8819

+ printf ("\n");

8820

+ }

8821

+ if (succeeded >= test_entry->required_quorum)

8822

+ {

8823

+ printf ("+++ OK %s\n", test_entry->name);

8824

+

8825

+ return 0;

8826

+ }

8827

+ else

8828

+ {

8829

+ printf ("--- FAIL %s\n", test_entry->name);

8830

+

8831

+ return (rc != 0) ? rc : -1;

8832

+ }

8833

+}

8834

+

8835

+static int run_all_tests (const test_table_entry_t *test_table)

8836

+{

8837

+ const test_table_entry_t *test;

8838

+ int rc;

8839

+

8840

+ for (

8841

+ rc = 0, test = &test_table[0];

8842

+ test->test_func != NULL && rc == 0; test++)

8843

+ {

8844

+ rc = run_one_test (test);

8845

+ }

8846

+

8847

+ return rc;

8848

+}

8849

+

8850

+/* ---------------------------- interface functions ------------------------ */

8851

+

8852

+int main (void)

8853

+{

8854

+ const test_table_entry_t test_table[] = {

8855

+ TEST_NO_REP (test_constants),

8856

+ TEST_DF_REP (test_tbegin_ntstg_tend),

8857

+ TEST_DF_REP (test_tbegin_ntstg_tabort),

8858

+ TEST_DF_REP (test_tbegin_nofloat),

8859

+ TEST_NO_REP (test_tbegin_retry),

8860

+ TEST_NO_REP (test_tbegin_retry_nofloat),

8861

+ TEST_DF_REP (test_tbegin_aborts),

8862

+ TEST_DF_REP (test_tbegin_indirect_aborts),

8863

+ TEST_DF_REP (test_tbegin_nofloat_aborts),

8864

+ TEST_DF_REP (test_tbegin_nofloat_indirect_aborts),

8865

+ TEST_NO_REP (test_tbegin_retry_aborts),

8866

+ TEST_NO_REP (test_tbegin_retry_nofloat_aborts),

8867

+ TEST_DF_REP (test_tbegin_tdb),

8868

+ TEST_DF_REP (test_tbegin_nofloat_tdb),

8869

+ TEST_NO_REP (test_tbegin_retry_tdb),

8870

+ TEST_NO_REP (test_tbegin_retry_nofloat_tdb),

8871

+ TEST_DF_REP (test_etnd),

8872

+ TEST_DF_REP (test_tbeginc),

8873

+ { (void *)0, 0, 0 }

8874

+ };

8875

+

8876

+ {

8877

+ int rc;

8878

+

8879

+ rc = run_all_tests (test_table);

8880

+

8881

+ return rc;

8882

+ }

8883

+}

8884

Index: gcc/testsuite/gcc.target/s390/hotpatch-7.c

8885

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

8886

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-7.c (.../tags/gcc_4_8_2_release)

8887

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-7.c (.../branches/gcc-4_8-branch)

8888

@@ -0,0 +1,21 @@

8889

+/* Functional tests for the function hotpatching feature. */

8890

+

8891

+/* { dg-do run } */

8892

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

8893

+

8894

+#include <stdio.h>

8895

+

8896

+__attribute__ ((hotpatch(0)))

8897

+void hp1(void)

8898

+{

8899

+ printf("hello, world!\n");

8900

+}

8901

+

8902

+int main (void)

8903

+{

8904

+ return 0;

8905

+}

8906

+

8907

+/* Check number of occurences of certain instructions. */

8908

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

8909

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

8910

Index: gcc/testsuite/gcc.target/s390/htm-builtins-2.c

8911

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

8912

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-2.c (.../tags/gcc_4_8_2_release)

8913

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-2.c (.../branches/gcc-4_8-branch)

8914

@@ -0,0 +1,682 @@

8915

+/* Functional tests of the htm __TM_... macros. */

8916

+

8917

+/* { dg-do run } */

8918

+/* { dg-require-effective-target htm } */

8919

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

8920

+

8921

+/* ---------------------------- included header files ---------------------- */

8922

+

8923

+#include <stdio.h>

8924

+#include <string.h>

8925

+#include <inttypes.h>

8926

+#include <htmxlintrin.h>

8927

+

8928

+/* ---------------------------- local definitions -------------------------- */

8929

+

8930

+#define DEFAULT_MAX_REPETITIONS 5

8931

+#define DEFAULT_REQUIRED_QUORUM ((DEFAULT_MAX_REPETITIONS) - 1)

8932

+#define DEFAULT_ABORT_ADDRESS (0x12345678u)

8933

+

8934

+/* ---------------------------- local macros ------------------------------- */

8935

+

8936

+#define TEST_DF_REP(name) \

8937

+ { #name, name, DEFAULT_MAX_REPETITIONS, DEFAULT_REQUIRED_QUORUM }

8938

+#define TEST_NO_REP(name) { #name, name, 1, 1 }

8939

+

8940

+/* ---------------------------- local types -------------------------------- */

8941

+

8942

+typedef int (*test_func_t)(void);

8943

+

8944

+typedef struct

8945

+{

8946

+ const char *name;

8947

+ test_func_t test_func;

8948

+ int max_repetitions;

8949

+ int required_quorum;

8950

+} test_table_entry_t;

8951

+

8952

+typedef enum

8953

+{

8954

+ ABORT_T_SYSTEM = 0,

8955

+ ABORT_T_USER = 1,

8956

+} abort_user_t;

8957

+

8958

+typedef enum

8959

+{

8960

+ ABORT_T_NONE = 0,

8961

+ ABORT_T_ILLEGAL,

8962

+ ABORT_T_FOOTPRINT_EXCEEDED,

8963

+ ABORT_T_NESTED_TOO_DEEP,

8964

+ ABORT_T_CONFLICT,

8965

+

8966

+ ABORT_T_INVALID_ABORT_CODE

8967

+} abort_t;

8968

+

8969

+/* ---------------------------- local variables ---------------------------- */

8970

+

8971

+__attribute__ ((aligned(256))) static struct __htm_tdb local_tdb256;

8972

+static struct __htm_tdb local_tdb;

8973

+

8974

+static abort_t const abort_classes[] =

8975

+{

8976

+ ABORT_T_INVALID_ABORT_CODE,

8977

+ ABORT_T_NONE,

8978

+ ABORT_T_NONE,

8979

+ ABORT_T_NONE,

8980

+

8981

+ ABORT_T_ILLEGAL,

8982

+ ABORT_T_NONE,

8983

+ ABORT_T_NONE,

8984

+ ABORT_T_FOOTPRINT_EXCEEDED,

8985

+

8986

+ ABORT_T_FOOTPRINT_EXCEEDED,

8987

+ ABORT_T_CONFLICT,

8988

+ ABORT_T_CONFLICT,

8989

+ ABORT_T_ILLEGAL,

8990

+

8991

+ ABORT_T_NONE,

8992

+ ABORT_T_NESTED_TOO_DEEP,

8993

+ ABORT_T_NONE,

8994

+ ABORT_T_NONE,

8995

+

8996

+ ABORT_T_NONE

8997

+};

8998

+

8999

+static size_t num_abort_classes = sizeof(abort_classes) / sizeof(abort_t);

9000

+

9001

+/* ---------------------------- exported variables (globals) --------------- */

9002

+

9003

+int global_int = 0;

9004

+uint64_t global_u64 = 0;

9005

+float global_float_1 = 1.0;

9006

+float global_float_2 = 2.5;

9007

+float global_float_3 = 0.0;

9008

+__attribute__ ((aligned(256))) struct

9009

+{

9010

+ volatile uint64_t c1;

9011

+ volatile uint64_t c2;

9012

+ volatile uint64_t c3;

9013

+} counters = { 0, 0, 0 };

9014

+

9015

+/* ---------------------------- local helper functions --------------------- */

9016

+

9017

+static void dump_tdb(struct __htm_tdb *tdb)

9018

+{

9019

+ unsigned char *p;

9020

+ int i;

9021

+ int j;

9022

+

9023

+ p = (unsigned char *)tdb;

9024

+ for (i = 0; i < 16; i++)

9025

+ {

9026

+ fprintf(stderr, "0x%02x ", i * 16);

9027

+ for (j = 0; j < 16; j++)

9028

+ {

9029

+ fprintf(stderr, "%02x", (int)p[i * 16 + j]);

9030

+ if (j < 15)

9031

+ {

9032

+ fprintf(stderr, " ");

9033

+ }

9034

+ if (j == 7)

9035

+ {

9036

+ fprintf(stderr, " ");

9037

+ }

9038

+ }

9039

+ fprintf(stderr, "\n");

9040

+ }

9041

+

9042

+ return;

9043

+}

9044

+

9045

+static void make_fake_tdb(struct __htm_tdb *tdb)

9046

+{

9047

+ memset(tdb, 0, sizeof(*tdb));

9048

+ tdb->format = 1;

9049

+ tdb->nesting_depth = 1;

9050

+ tdb->atia = DEFAULT_ABORT_ADDRESS;

9051

+ tdb->abort_code = 11;

9052

+

9053

+ return;

9054

+}

9055

+

9056

+static int check_abort_code_in_tdb(struct __htm_tdb *tdb, uint64_t abort_code)

9057

+{

9058

+ long expect_rc;

9059

+ long rc;

9060

+

9061

+ if (abort_code != 0)

9062

+ {

9063

+ long addr;

9064

+

9065

+ addr = __TM_failure_address(&local_tdb);

9066

+ if (addr != DEFAULT_ABORT_ADDRESS)

9067

+ {

9068

+ return 11;

9069

+ }

9070

+ }

9071

+ {

9072

+ long long tdb_abort_code;

9073

+

9074

+ tdb_abort_code = __TM_failure_code(tdb);

9075

+ if ((uint64_t)tdb_abort_code != abort_code)

9076

+ {

9077

+ fprintf(

9078

+ stderr, "tm_ac %" PRIu64 ", ac %" PRIu64

9079

+ ", tdb_ac %" PRIu64 "\n",

9080

+ (uint64_t)tdb_abort_code, abort_code,

9081

+ (uint64_t)tdb->abort_code);

9082

+ return 10;

9083

+ }

9084

+ }

9085

+ expect_rc = (abort_code >= 256) ? 1 : 0;

9086

+ rc = __TM_is_user_abort(tdb);

9087

+ if (rc != expect_rc)

9088

+ {

9089

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9090

+ return 1;

9091

+ }

9092

+ {

9093

+ unsigned char code;

9094

+

9095

+ code = 0xffu;

9096

+ rc = __TM_is_named_user_abort(tdb, &code);

9097

+ if (rc != expect_rc)

9098

+ {

9099

+ fprintf(

9100

+ stderr, "rc %ld, expect_rc %ld\n", rc,

9101

+ expect_rc);

9102

+ return 2;

9103

+ }

9104

+ if (expect_rc == 1 && code != abort_code - 256)

9105

+ {

9106

+ return 3;

9107

+ }

9108

+ }

9109

+ if (abort_code > (uint64_t)num_abort_classes)

9110

+ {

9111

+ abort_code = (uint64_t)num_abort_classes;

9112

+ }

9113

+ expect_rc = (abort_classes[abort_code] == ABORT_T_ILLEGAL) ? 1 : 0;

9114

+ rc = __TM_is_illegal(tdb);

9115

+ if (rc != expect_rc)

9116

+ {

9117

+ dump_tdb(tdb);

9118

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9119

+ return 4;

9120

+ }

9121

+ expect_rc =

9122

+ (abort_classes[abort_code] == ABORT_T_FOOTPRINT_EXCEEDED) ?

9123

+ 1 : 0;

9124

+ rc = __TM_is_footprint_exceeded(tdb);

9125

+ if (rc != expect_rc)

9126

+ {

9127

+ dump_tdb(tdb);

9128

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9129

+ return 5;

9130

+ }

9131

+ expect_rc =

9132

+ (abort_classes[abort_code] == ABORT_T_NESTED_TOO_DEEP) ? 1 : 0;

9133

+ rc = __TM_is_nested_too_deep(tdb);

9134

+ if (rc != expect_rc)

9135

+ {

9136

+ dump_tdb(tdb);

9137

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9138

+ return 6;

9139

+ }

9140

+ expect_rc = (abort_classes[abort_code] == ABORT_T_CONFLICT) ? 1 : 0;

9141

+ rc = __TM_is_conflict(tdb);

9142

+ if (rc != expect_rc)

9143

+ {

9144

+ dump_tdb(tdb);

9145

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

9146

+ return 7;

9147

+ }

9148

+

9149

+ return 0;

9150

+}

9151

+

9152

+/* ---------------------------- local test functions ----------------------- */

9153

+

9154

+/* Not a test; make sure that the involved global cachelines are reserved for

9155

+ * writing. */

9156

+static int init_cache(void)

9157

+{

9158

+ make_fake_tdb(&local_tdb);

9159

+ make_fake_tdb(&local_tdb256);

9160

+ global_int = 0;

9161

+ global_u64 = 0;

9162

+ global_float_1 = 1.0;

9163

+ global_float_2 = 2.5;

9164

+ global_float_3 = 0.0;

9165

+ counters.c1 = 0;

9166

+ counters.c2 = 0;

9167

+ counters.c3 = 0;

9168

+

9169

+ return 0;

9170

+}

9171

+

9172

+static int test_abort_classification(void)

9173

+{

9174

+ int i;

9175

+

9176

+ make_fake_tdb(&local_tdb);

9177

+ for (i = 0; i <= 256; i++)

9178

+ {

9179

+ int rc;

9180

+

9181

+ local_tdb.abort_code = (uint64_t)i;

9182

+ rc = check_abort_code_in_tdb(&local_tdb, (uint64_t)i);

9183

+ if (rc != 0)

9184

+ {

9185

+ return 100 * i + rc;

9186

+ }

9187

+ }

9188

+

9189

+ return 0;

9190

+}

9191

+

9192

+static int test_cc_classification(void)

9193

+{

9194

+ long rc;

9195

+

9196

+ rc = __TM_is_failure_persistent(0);

9197

+ if (rc != 0)

9198

+ {

9199

+ return 1;

9200

+ }

9201

+ rc = __TM_is_failure_persistent(1);

9202

+ if (rc != 0)

9203

+ {

9204

+ return 2;

9205

+ }

9206

+ rc = __TM_is_failure_persistent(2);

9207

+ if (rc != 0)

9208

+ {

9209

+ return 3;

9210

+ }

9211

+ rc = __TM_is_failure_persistent(3);

9212

+ if (rc != 1)

9213

+ {

9214

+ return 4;

9215

+ }

9216

+

9217

+ return 0;

9218

+}

9219

+

9220

+static int test_tbegin_ntstg_tend(void)

9221

+{

9222

+ long rc;

9223

+

9224

+ counters.c1 = 0;

9225

+ counters.c2 = 0;

9226

+ if ((rc = __TM_simple_begin()) == 0)

9227

+ {

9228

+ __TM_non_transactional_store((uint64_t *)&counters.c1, 1);

9229

+ counters.c2 = 2;

9230

+ rc = __TM_end();

9231

+ if (rc != 0)

9232

+ {

9233

+ return 100 * rc + 5;

9234

+ }

9235

+ if (counters.c1 != 1)

9236

+ {

9237

+ return 100 * counters.c1 + 2;

9238

+ }

9239

+ if (counters.c2 != 2)

9240

+ {

9241

+ return 100 * counters.c2 + 3;

9242

+ }

9243

+ }

9244

+ else

9245

+ {

9246

+ return 100 * rc + 4;

9247

+ }

9248

+

9249

+ return 0;

9250

+}

9251

+

9252

+static int test_tbegin_ntstg_tabort(void)

9253

+{

9254

+ register float f;

9255

+

9256

+ counters.c1 = 0;

9257

+ counters.c2 = 0;

9258

+ f = 0;

9259

+ if (__TM_simple_begin() == 0)

9260

+ {

9261

+ __TM_non_transactional_store((uint64_t *)&counters.c1, 1);

9262

+ counters.c2 = 2;

9263

+ f = 1;

9264

+ __TM_named_abort(0);

9265

+ return 1;

9266

+ }

9267

+ if (counters.c1 != 1)

9268

+ {

9269

+ return 100 * counters.c1 + 2;

9270

+ }

9271

+ if (counters.c2 != 0)

9272

+ {

9273

+ return 100 * counters.c2 + 3;

9274

+ }

9275

+ if (f != 0)

9276

+ {

9277

+ return 100 * f + 4;

9278

+ }

9279

+

9280

+ return 0;

9281

+}

9282

+

9283

+static int test_tbegin_aborts(void)

9284

+{

9285

+ float f;

9286

+ long rc;

9287

+

9288

+ f = 77;

9289

+ if ((rc = __TM_simple_begin()) == 0)

9290

+ {

9291

+ f = 88;

9292

+ __TM_abort();

9293

+ return 2;

9294

+ }

9295

+ else if (rc != 2)

9296

+ {

9297

+ return 3;

9298

+ }

9299

+ if (f != 77)

9300

+ {

9301

+ return 4;

9302

+ }

9303

+ f = 66;

9304

+ if ((rc = __TM_simple_begin()) == 0)

9305

+ {

9306

+ f = 99;

9307

+ __TM_named_abort(3);

9308

+ return 5;

9309

+ }

9310

+ else if (rc != 3)

9311

+ {

9312

+ return 100 * rc + 6;

9313

+ }

9314

+ if (f != 66)

9315

+ {

9316

+ return 100 * f + 7;

9317

+ }

9318

+ if ((rc = __TM_simple_begin()) == 0)

9319

+ {

9320

+ global_float_3 = global_float_1 + global_float_2;

9321

+ rc = __TM_end();

9322

+ if (rc != 0)

9323

+ {

9324

+ return 100 * rc + 8;

9325

+ }

9326

+ }

9327

+ else

9328

+ {

9329

+ return 100 * rc + 9;

9330

+ }

9331

+ if (global_float_3 != global_float_1 + global_float_2)

9332

+ {

9333

+ return 100 * rc + 10;

9334

+ }

9335

+

9336

+ return 0;

9337

+}

9338

+

9339

+static int test_tbegin_tdb(void)

9340

+{

9341

+ long rc;

9342

+

9343

+ local_tdb.format = 0;

9344

+ if ((rc = __TM_begin(&local_tdb)) == 0)

9345

+ {

9346

+ rc = __TM_end();

9347

+ if (rc != 0)

9348

+ {

9349

+ return 100 * rc + 1;

9350

+ }

9351

+ if (local_tdb.format != 0)

9352

+ {

9353

+ dump_tdb(&local_tdb);

9354

+ return 100 * local_tdb.format + 2;

9355

+ }

9356

+ }

9357

+ else

9358

+ {

9359

+ return 100 * rc + 3;

9360

+ }

9361

+ local_tdb.format = 0;

9362

+ if ((rc = __TM_begin(&local_tdb)) == 0)

9363

+ {

9364

+ __TM_named_abort(1);

9365

+ return 4;

9366

+ }

9367

+ else

9368

+ {

9369

+ if (rc != 3)

9370

+ {

9371

+ return 100 * rc + 5;

9372

+ }

9373

+ if (local_tdb.format != 1)

9374

+ {

9375

+ dump_tdb(&local_tdb);

9376

+ return 100 * local_tdb.format + 6;

9377

+ }

9378

+ }

9379

+ local_tdb256.format = 0;

9380

+ if ((rc = __TM_begin(&local_tdb256)) == 0)

9381

+ {

9382

+ rc = __TM_end();

9383

+ if (rc != 0)

9384

+ {

9385

+ return 1100 * rc + 1;

9386

+ }

9387

+ if (local_tdb256.format != 0)

9388

+ {

9389

+ dump_tdb(&local_tdb256);

9390

+ return 1100 * local_tdb256.format + 2;

9391

+ }

9392

+ }

9393

+ else

9394

+ {

9395

+ return 1100 * rc + 3;

9396

+ }

9397

+#if 1 /*!!!does not work*/

9398

+ local_tdb256.format = 0;

9399

+ if ((rc = __TM_begin(&local_tdb256)) == 0)

9400

+ {

9401

+ __TM_named_abort(1);

9402

+ return 2004;

9403

+ }

9404

+ else

9405

+ {

9406

+ if (rc != 3)

9407

+ {

9408

+ return 2100 * rc + 5;

9409

+ }

9410

+ if (local_tdb256.format != 1)

9411

+ {

9412

+ dump_tdb(&local_tdb256);

9413

+ return 2100 * local_tdb256.format + 6;

9414

+ }

9415

+ }

9416

+#endif

9417

+

9418

+ return 0;

9419

+}

9420

+

9421

+static int test_etnd(void)

9422

+{

9423

+ long rc;

9424

+

9425

+ {

9426

+ long nd;

9427

+

9428

+ make_fake_tdb(&local_tdb);

9429

+ local_tdb.nesting_depth = 0;

9430

+ nd = __TM_nesting_depth(&local_tdb);

9431

+ if (nd != 0)

9432

+ {

9433

+ return 1;

9434

+ }

9435

+ local_tdb.nesting_depth = 7;

9436

+ nd = __TM_nesting_depth(&local_tdb);

9437

+ if (nd != 7)

9438

+ {

9439

+ return 7;

9440

+ }

9441

+ local_tdb.format = 0;

9442

+ nd = __TM_nesting_depth(&local_tdb);

9443

+ if (nd != 0)

9444

+ {

9445

+ return 2;

9446

+ }

9447

+ }

9448

+ counters.c1 = 0;

9449

+ counters.c1 = 0;

9450

+ counters.c2 = 0;

9451

+ counters.c3 = 0;

9452

+ if ((rc = __TM_simple_begin()) == 0)

9453

+ {

9454

+ counters.c1 = __TM_nesting_depth(0);

9455

+ if (__TM_simple_begin() == 0)

9456

+ {

9457

+ counters.c2 = __TM_nesting_depth(0);

9458

+ if (__TM_simple_begin() == 0)

9459

+ {

9460

+ counters.c3 = __TM_nesting_depth(0);

9461

+ __TM_end();

9462

+ }

9463

+ __TM_end();

9464

+ }

9465

+ __TM_end();

9466

+ }

9467

+ else

9468

+ {

9469

+ return 100 * rc + 1;

9470

+ }

9471

+ if (counters.c1 != 1)

9472

+ {

9473

+ return 100 * counters.c1 + 2;

9474

+ }

9475

+ if (counters.c2 != 2)

9476

+ {

9477

+ return 100 * counters.c2 + 3;

9478

+ }

9479

+ if (counters.c3 != 3)

9480

+ {

9481

+ return 100 * counters.c3 + 4;

9482

+ }

9483

+

9484

+ return 0;

9485

+}

9486

+

9487

+/* ---------------------------- local testing framework functions ---------- */

9488

+

9489

+static int run_one_test(const test_table_entry_t *test_entry)

9490

+{

9491

+ int do_print_passes;

9492

+ int succeeded;

9493

+ int rc;

9494

+ int i;

9495

+

9496

+ do_print_passes = (

9497

+ test_entry->required_quorum != 1 ||

9498

+ test_entry->max_repetitions != 1);

9499

+ printf("RRR RUN %s\n", test_entry->name);

9500

+ if (do_print_passes == 1)

9501

+ {

9502

+ printf(

9503

+ " (requires %d successful out of %d runs)\n",

9504

+ test_entry->required_quorum,

9505

+ test_entry->max_repetitions);

9506

+ }

9507

+ succeeded = 0;

9508

+ rc = 0;

9509

+ for (rc = 0, i = 0; i < test_entry->max_repetitions; i++)

9510

+ {

9511

+ if (do_print_passes == 1)

9512

+ {

9513

+ if (i == 0)

9514

+ {

9515

+ printf(" ");

9516

+ }

9517

+ else

9518

+ {

9519

+ printf(",");

9520

+ }

9521

+ }

9522

+ rc = test_entry->test_func();

9523

+ if (rc == 0)

9524

+ {

9525

+ if (do_print_passes == 1)

9526

+ {

9527

+ printf(" success");

9528

+ }

9529

+ succeeded++;

9530

+ if (succeeded >= test_entry->required_quorum)

9531

+ {

9532

+ break;

9533

+ }

9534

+ }

9535

+ else

9536

+ {

9537

+ printf(" failed (rc = %d)", rc);

9538

+ }

9539

+ }

9540

+ if (do_print_passes == 1 || rc != 0)

9541

+ {

9542

+ printf("\n");

9543

+ }

9544

+ if (succeeded >= test_entry->required_quorum)

9545

+ {

9546

+ printf("+++ OK %s\n", test_entry->name);

9547

+

9548

+ return 0;

9549

+ }

9550

+ else

9551

+ {

9552

+ printf("--- FAIL %s\n", test_entry->name);

9553

+

9554

+ return (rc != 0) ? rc : -1;

9555

+ }

9556

+}

9557

+

9558

+static int run_all_tests(const test_table_entry_t *test_table)

9559

+{

9560

+ const test_table_entry_t *test;

9561

+ int rc;

9562

+

9563

+ for (

9564

+ rc = 0, test = &test_table[0];

9565

+ test->test_func != NULL && rc == 0; test++)

9566

+ {

9567

+ rc = run_one_test(test);

9568

+ }

9569

+

9570

+ return rc;

9571

+}

9572

+

9573

+/* ---------------------------- interface functions ------------------------ */

9574

+

9575

+int main(void)

9576

+{

9577

+ const test_table_entry_t test_table[] = {

9578

+ TEST_NO_REP(init_cache),

9579

+ TEST_NO_REP(test_abort_classification),

9580

+ TEST_NO_REP(test_cc_classification),

9581

+ TEST_DF_REP(test_tbegin_ntstg_tend),

9582

+ TEST_DF_REP(test_tbegin_ntstg_tabort),

9583

+ TEST_DF_REP(test_tbegin_aborts),

9584

+ TEST_DF_REP(test_tbegin_tdb),

9585

+ TEST_DF_REP(test_etnd),

9586

+ { (void *)0, 0, 0 }

9587

+ };

9588

+

9589

+ {

9590

+ int rc;

9591

+

9592

+ rc = run_all_tests(test_table);

9593

+

9594

+ return rc;

9595

+ }

9596

+}

9597

Index: gcc/testsuite/gcc.target/s390/hotpatch-8.c

9598

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

9599

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-8.c (.../tags/gcc_4_8_2_release)

9600

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-8.c (.../branches/gcc-4_8-branch)

9601

@@ -0,0 +1,28 @@

9602

+/* Functional tests for the function hotpatching feature. */

9603

+

9604

+/* { dg-do run } */

9605

+/* { dg-options "-O3 -mzarch -mhotpatch --save-temps" } */

9606

+

9607

+#include <stdio.h>

9608

+

9609

+__attribute__ ((hotpatch))

9610

+inline void hp1(void)

9611

+{

9612

+ printf("hello, world!\n");

9613

+}

9614

+

9615

+__attribute__ ((hotpatch))

9616

+__attribute__ ((always_inline))

9617

+void hp2(void) /* { dg-warning "always_inline function might not be inlinable" } */

9618

+{

9619

+ printf("hello, world!\n");

9620

+} /* { dg-warning "function 'hp2' with the 'always_inline' attribute is not hotpatchable" } */

9621

+

9622

+int main (void)

9623

+{

9624

+ return 0;

9625

+}

9626

+

9627

+/* Check number of occurences of certain instructions. */

9628

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

9629

+/* { dg-final { scan-assembler-not "nop\t0" } } */

9630

Index: gcc/testsuite/gcc.target/s390/hotpatch-9.c

9631

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

9632

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-9.c (.../tags/gcc_4_8_2_release)

9633

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-9.c (.../branches/gcc-4_8-branch)

9634

@@ -0,0 +1,21 @@

9635

+/* Functional tests for the function hotpatching feature. */

9636

+

9637

+/* { dg-do run } */

9638

+/* { dg-options "-O3 -mzarch -mhotpatch=1 --save-temps" } */

9639

+

9640

+#include <stdio.h>

9641

+

9642

+__attribute__ ((hotpatch(2)))

9643

+void hp1(void)

9644

+{

9645

+ printf("hello, world!\n");

9646

+}

9647

+

9648

+int main (void)

9649

+{

9650

+ return 0;

9651

+}

9652

+

9653

+/* Check number of occurences of certain instructions. */

9654

+/* { dg-final { scan-assembler-times "nopr\t%r7" 2 } } */

9655

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

9656

Index: gcc/testsuite/gcc.target/s390/hotpatch-10.c

9657

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

9658

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-10.c (.../tags/gcc_4_8_2_release)

9659

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-10.c (.../branches/gcc-4_8-branch)

9660

@@ -0,0 +1,21 @@

9661

+/* Functional tests for the function hotpatching feature. */

9662

+

9663

+/* { dg-do run } */

9664

+/* { dg-options "-O3 -mzarch -mno-hotpatch --save-temps" } */

9665

+

9666

+#include <stdio.h>

9667

+

9668

+__attribute__ ((hotpatch(2)))

9669

+void hp1(void)

9670

+{

9671

+ printf("hello, world!\n");

9672

+}

9673

+

9674

+int main (void)

9675

+{

9676

+ return 0;

9677

+}

9678

+

9679

+/* Check number of occurences of certain instructions. */

9680

+/* { dg-final { scan-assembler-times "nopr\t%r7" 2 } } */

9681

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

9682

Index: gcc/testsuite/gcc.target/s390/hotpatch-11.c

9683

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

9684

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-11.c (.../tags/gcc_4_8_2_release)

9685

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-11.c (.../branches/gcc-4_8-branch)

9686

@@ -0,0 +1,20 @@

9687

+/* Functional tests for the function hotpatching feature. */

9688

+

9689

+/* { dg-do run } */

9690

+/* { dg-options "-O3 -mzarch -mhotpatch -mno-hotpatch --save-temps" } */

9691

+

9692

+#include <stdio.h>

9693

+

9694

+void hp1(void)

9695

+{

9696

+ printf("hello, world!\n");

9697

+}

9698

+

9699

+int main (void)

9700

+{

9701

+ return 0;

9702

+}

9703

+

9704

+/* Check number of occurences of certain instructions. */

9705

+/* { dg-final { scan-assembler-not "nopr\t%r7" } } */

9706

+/* { dg-final { scan-assembler-not "nop\t0" } } */

9707

Index: gcc/testsuite/gcc.target/s390/hotpatch-12.c

9708

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

9709

--- a/src/gcc/testsuite/gcc.target/s390/hotpatch-12.c (.../tags/gcc_4_8_2_release)

9710

+++ b/src/gcc/testsuite/gcc.target/s390/hotpatch-12.c (.../branches/gcc-4_8-branch)

9711

@@ -0,0 +1,20 @@

9712

+/* Functional tests for the function hotpatching feature. */

9713

+

9714

+/* { dg-do run } */

9715

+/* { dg-options "-O3 -mzarch -mno-hotpatch -mhotpatch=1 --save-temps" } */

9716

+

9717

+#include <stdio.h>

9718

+

9719

+void hp1(void)

9720

+{

9721

+ printf("hello, world!\n");

9722

+}

9723

+

9724

+int main (void)

9725

+{

9726

+ return 0;

9727

+}

9728

+

9729

+/* Check number of occurences of certain instructions. */

9730

+/* { dg-final { scan-assembler-times "nopr\t%r7" 1 } } */

9731

+/* { dg-final { scan-assembler-times "nop\t0" 1 } } */

9732

Index: gcc/testsuite/gcc.target/mips/bswap-1.c

9733

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

9734

--- a/src/gcc/testsuite/gcc.target/mips/bswap-1.c (.../tags/gcc_4_8_2_release)

9735

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-1.c (.../branches/gcc-4_8-branch)

9736

@@ -0,0 +1,10 @@

9737

+/* { dg-options "isa_rev>=2" } */

9738

+/* { dg-skip-if "bswap recognition needs expensive optimizations" { *-*-* } { "-O0" "-O1" } { "" } } */

9739

+

9740

+NOMIPS16 unsigned short

9741

+foo (unsigned short x)

9742

+{

9743

+ return ((x << 8) & 0xff00) | ((x >> 8) & 0xff);

9744

+}

9745

+

9746

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9747

Index: gcc/testsuite/gcc.target/mips/bswap-2.c

9748

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

9749

--- a/src/gcc/testsuite/gcc.target/mips/bswap-2.c (.../tags/gcc_4_8_2_release)

9750

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-2.c (.../branches/gcc-4_8-branch)

9751

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

9752

+/* { dg-options "isa_rev>=2" } */

9753

+

9754

+NOMIPS16 unsigned short

9755

+foo (unsigned short x)

9756

+{

9757

+ return __builtin_bswap16 (x);

9758

+}

9759

+

9760

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9761

Index: gcc/testsuite/gcc.target/mips/pr59137.c

9762

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

9763

--- a/src/gcc/testsuite/gcc.target/mips/pr59137.c (.../tags/gcc_4_8_2_release)

9764

+++ b/src/gcc/testsuite/gcc.target/mips/pr59137.c (.../branches/gcc-4_8-branch)

9765

@@ -0,0 +1,34 @@

9766

+/* { dg-do run } */

9767

+/* { dg-options "-mno-plt" } */

9768

+

9769

+extern void abort (void);

9770

+

9771

+struct lispstruct

9772

+{

9773

+ int e;

9774

+ int t;

9775

+};

9776

+

9777

+struct lispstruct Cnil_body;

9778

+struct lispstruct Ct_body;

9779

+int nvalues;

9780

+

9781

+struct lispstruct * __attribute__ ((noinline))

9782

+fLlistp (struct lispstruct *x0)

9783

+{

9784

+ if (x0 == &Cnil_body

9785

+ || (((unsigned long) x0 >= 0x80000000) ? 0

9786

+ : (!x0->e ? (x0 != &Cnil_body) : x0->t)))

9787

+ x0 = &Ct_body;

9788

+ else

9789

+ x0 = &Cnil_body;

9790

+ nvalues = 1;

9791

+ return x0;

9792

+}

9793

+

9794

+int main ()

9795

+{

9796

+ if (fLlistp ((struct lispstruct *) 0xa0000001) != &Cnil_body)

9797

+ abort ();

9798

+ return 0;

9799

+}

9800

Index: gcc/testsuite/gcc.target/mips/bswap-3.c

9801

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

9802

--- a/src/gcc/testsuite/gcc.target/mips/bswap-3.c (.../tags/gcc_4_8_2_release)

9803

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-3.c (.../branches/gcc-4_8-branch)

9804

@@ -0,0 +1,14 @@

9805

+/* { dg-options "isa_rev>=2" } */

9806

+/* { dg-skip-if "bswap recognition needs expensive optimizations" { *-*-* } { "-O0" "-O1" } { "" } } */

9807

+

9808

+NOMIPS16 unsigned int

9809

+foo (unsigned int x)

9810

+{

9811

+ return (((x << 24) & 0xff000000)

9812

+ | ((x << 8) & 0xff0000)

9813

+ | ((x >> 8) & 0xff00)

9814

+ | ((x >> 24) & 0xff));

9815

+}

9816

+

9817

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9818

+/* { dg-final { scan-assembler "\tror\t" } } */

9819

Index: gcc/testsuite/gcc.target/mips/bswap-4.c

9820

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

9821

--- a/src/gcc/testsuite/gcc.target/mips/bswap-4.c (.../tags/gcc_4_8_2_release)

9822

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-4.c (.../branches/gcc-4_8-branch)

9823

@@ -0,0 +1,10 @@

9824

+/* { dg-options "isa_rev>=2" } */

9825

+

9826

+NOMIPS16 unsigned int

9827

+foo (unsigned int x)

9828

+{

9829

+ return __builtin_bswap32 (x);

9830

+}

9831

+

9832

+/* { dg-final { scan-assembler "\twsbh\t" } } */

9833

+/* { dg-final { scan-assembler "\tror\t" } } */

9834

Index: gcc/testsuite/gcc.target/mips/bswap-5.c

9835

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

9836

--- a/src/gcc/testsuite/gcc.target/mips/bswap-5.c (.../tags/gcc_4_8_2_release)

9837

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-5.c (.../branches/gcc-4_8-branch)

9838

@@ -0,0 +1,20 @@

9839

+/* { dg-options "isa_rev>=2 -mgp64" } */

9840

+/* { dg-skip-if "bswap recognition needs expensive optimizations" { *-*-* } { "-O0" "-O1" } { "" } } */

9841

+

9842

+typedef unsigned long long uint64_t;

9843

+

9844

+NOMIPS16 uint64_t

9845

+foo (uint64_t x)

9846

+{

9847

+ return (((x << 56) & 0xff00000000000000ull)

9848

+ | ((x << 40) & 0xff000000000000ull)

9849

+ | ((x << 24) & 0xff0000000000ull)

9850

+ | ((x << 8) & 0xff00000000ull)

9851

+ | ((x >> 8) & 0xff000000)

9852

+ | ((x >> 24) & 0xff0000)

9853

+ | ((x >> 40) & 0xff00)

9854

+ | ((x >> 56) & 0xff));

9855

+}

9856

+

9857

+/* { dg-final { scan-assembler "\tdsbh\t" } } */

9858

+/* { dg-final { scan-assembler "\tdshd\t" } } */

9859

Index: gcc/testsuite/gcc.target/mips/bswap-6.c

9860

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

9861

--- a/src/gcc/testsuite/gcc.target/mips/bswap-6.c (.../tags/gcc_4_8_2_release)

9862

+++ b/src/gcc/testsuite/gcc.target/mips/bswap-6.c (.../branches/gcc-4_8-branch)

9863

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

9864

+/* { dg-options "isa_rev>=2 -mgp64" } */

9865

+

9866

+typedef unsigned long long uint64_t;

9867

+

9868

+NOMIPS16 uint64_t

9869

+foo (uint64_t x)

9870

+{

9871

+ return __builtin_bswap64 (x);

9872

+}

9873

+

9874

+/* { dg-final { scan-assembler "\tdsbh\t" } } */

9875

+/* { dg-final { scan-assembler "\tdshd\t" } } */

9876

Index: gcc/testsuite/gcc.target/sh/pr51244-19.c

9877

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

9878

--- a/src/gcc/testsuite/gcc.target/sh/pr51244-19.c (.../tags/gcc_4_8_2_release)

9879

+++ b/src/gcc/testsuite/gcc.target/sh/pr51244-19.c (.../branches/gcc-4_8-branch)

9880

@@ -22,11 +22,16 @@

9881

unwanted sequences. Thus, if we see any movt insns, something is not

9882

working as expected. This test requires -O2 because the T bit stores

9883

in question will be eliminated in additional insn split passes after

9884

- reload. */

9885

+ reload.

9886

+

9887

+ Notice: When this test case was initially added, the T bit optimization

9888

+ was buggy and this test case resulted in wrong code. The movt

9889

+ instructions actually have to be present in this case to get

9890

+ correct code. */

9891

/* { dg-do compile { target "sh*-*-*" } } */

9892

/* { dg-options "-O2" } */

9893

/* { dg-skip-if "" { "sh*-*-*" } { "-m5*" } { "" } } */

9894

-/* { dg-final { scan-assembler-not "movt" } } */

9895

+/* { dg-final { scan-assembler "movt" } } */

9896

9897

struct request

9898

{

9899

Index: gcc/testsuite/gcc.target/sh/pr54089-3.c

9900

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

9901

--- a/src/gcc/testsuite/gcc.target/sh/pr54089-3.c (.../tags/gcc_4_8_2_release)

9902

+++ b/src/gcc/testsuite/gcc.target/sh/pr54089-3.c (.../branches/gcc-4_8-branch)

9903

@@ -5,7 +5,7 @@

9904

/* { dg-options "-O1" } */

9905

/* { dg-skip-if "" { "sh*-*-*" } { "*" } { "-m1*" "-m2" "-m2e*" } } */

9906

/* { dg-final { scan-assembler-not "and" } } */

9907

-/* { dg-final { scan-assembler-not "31" } } */

9908

+/* { dg-final { scan-assembler-not "#31" } } */

9909

9910

int

9911

test00 (unsigned int a, int* b, int c, int* d, unsigned int e)

9912

Index: gcc/testsuite/gfortran.dg/gomp/pr59467.f90

9913

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

9914

--- a/src/gcc/testsuite/gfortran.dg/gomp/pr59467.f90 (.../tags/gcc_4_8_2_release)

9915

+++ b/src/gcc/testsuite/gfortran.dg/gomp/pr59467.f90 (.../branches/gcc-4_8-branch)

9916

@@ -0,0 +1,24 @@

9917

+! PR libgomp/59467

9918

+! { dg-do compile }

9919

+! { dg-options "-fopenmp" }

9920

+ FUNCTION t()

9921

+ INTEGER :: a, b, t

9922

+ a = 0

9923

+ b = 0

9924

+ !$OMP PARALLEL REDUCTION(+:b)

9925

+ !$OMP SINGLE ! { dg-error "is not threadprivate or private in outer context" }

9926

+ !$OMP ATOMIC WRITE

9927

+ a = 6

9928

+ !$OMP END SINGLE COPYPRIVATE (a)

9929

+ b = a

9930

+ !$OMP END PARALLEL

9931

+ t = b

9932

+ b = 0

9933

+ !$OMP PARALLEL REDUCTION(+:b)

9934

+ !$OMP SINGLE

9935

+ !$OMP ATOMIC WRITE

9936

+ b = 6

9937

+ !$OMP END SINGLE COPYPRIVATE (b)

9938

+ !$OMP END PARALLEL

9939

+ t = t + b

9940

+ END FUNCTION

9941

Index: gcc/testsuite/gfortran.dg/reshape_6.f90

9942

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

9943

--- a/src/gcc/testsuite/gfortran.dg/reshape_6.f90 (.../tags/gcc_4_8_2_release)

9944

+++ b/src/gcc/testsuite/gfortran.dg/reshape_6.f90 (.../branches/gcc-4_8-branch)

9945

@@ -0,0 +1,19 @@

9946

+! { dg-do compile }

9947

+! PR fortran/58989

9948

+!

9949

+program test

9950

+

9951

+ real(8), dimension(4,4) :: fluxes

9952

+ real(8), dimension(2,2,2,2) :: f

9953

+ integer, dimension(3) :: dmmy

9954

+ integer, parameter :: indx(4)=(/2,2,2,2/)

9955

+

9956

+ fluxes = 1

9957

+

9958

+ dmmy = (/2,2,2/)

9959

+

9960

+ f = reshape(fluxes,(/dmmy,2/)) ! Caused an ICE

9961

+ f = reshape(fluxes,(/2,2,2,2/)) ! Works as expected

9962

+ f = reshape(fluxes,indx) ! Works as expected

9963

+

9964

+end program test

9965

Index: gcc/testsuite/gfortran.dg/derived_external_function_1.f90

9966

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

9967

--- a/src/gcc/testsuite/gfortran.dg/derived_external_function_1.f90 (.../tags/gcc_4_8_2_release)

9968

+++ b/src/gcc/testsuite/gfortran.dg/derived_external_function_1.f90 (.../branches/gcc-4_8-branch)

9969

@@ -0,0 +1,27 @@

9970

+! { dg-do run }

9971

+!

9972

+! PR fortran/58771

9973

+!

9974

+! Contributed by Vittorio Secca <zeccav@gmail.com>

9975

+!

9976

+! ICEd on the write statement with f() because the derived type backend

9977

+! declaration not built.

9978

+!

9979

+module m

9980

+ type t

9981

+ integer(4) g

9982

+ end type

9983

+end

9984

+

9985

+type(t) function f() result(ff)

9986

+ use m

9987

+ ff%g = 42

9988

+end

9989

+

9990

+ use m

9991

+ character (20) :: line1, line2

9992

+ type(t) f

9993

+ write (line1, *) f()

9994

+ write (line2, *) 42_4

9995

+ if (line1 .ne. line2) call abort

9996

+end

9997

Index: gcc/testsuite/gfortran.dg/constructor_9.f90

9998

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

9999

--- a/src/gcc/testsuite/gfortran.dg/constructor_9.f90 (.../tags/gcc_4_8_2_release)

10000

+++ b/src/gcc/testsuite/gfortran.dg/constructor_9.f90 (.../branches/gcc-4_8-branch)

10001

@@ -0,0 +1,22 @@

10002

+! { dg-do compile }

10003

+! { dg-options "-Wall" }

10004

+!

10005

+! PR 58471: [4.8/4.9 Regression] ICE on invalid with missing type constructor and -Wall

10006

+!

10007

+! Contributed by Andrew Benson <abensonca@gmail.com>

10008

+

10009

+module cf

10010

+ implicit none

10011

+ type :: cfmde

10012

+ end type

10013

+ interface cfmde

10014

+ module procedure mdedc ! { dg-error "is neither function nor subroutine" }

10015

+ end interface

10016

+contains

10017

+ subroutine cfi()

10018

+ type(cfmde), pointer :: cfd

10019

+ cfd=cfmde() ! { dg-error "Can't convert" }

10020

+ end subroutine

10021

+end module

10022

+

10023

+! { dg-final { cleanup-modules "cf" } }

10024

Index: gcc/testsuite/gfortran.dg/generic_28.f90

10025

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

10026

--- a/src/gcc/testsuite/gfortran.dg/generic_28.f90 (.../tags/gcc_4_8_2_release)

10027

+++ b/src/gcc/testsuite/gfortran.dg/generic_28.f90 (.../branches/gcc-4_8-branch)

10028

@@ -0,0 +1,18 @@

10029

+! { dg-do compile }

10030

+!

10031

+! PR 58998: [4.8/4.9 Regression] Generic interface problem with gfortran

10032

+!

10033

+! Contributed by Paul van Delst

10034

+

10035

+ interface iargc

10036

+ procedure iargc_8

10037

+ end interface

10038

+

10039

+contains

10040

+

10041

+ integer(8) function iargc_8()

10042

+ integer(4) iargc

10043

+ iargc_8 = iargc()

10044

+ end function

10045

+

10046

+end

10047

Index: gcc/testsuite/gfortran.dg/proc_ptr_43.f90

10048

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

10049

--- a/src/gcc/testsuite/gfortran.dg/proc_ptr_43.f90 (.../tags/gcc_4_8_2_release)

10050

+++ b/src/gcc/testsuite/gfortran.dg/proc_ptr_43.f90 (.../branches/gcc-4_8-branch)

10051

@@ -0,0 +1,19 @@

10052

+! { dg-do compile }

10053

+!

10054

+! PR 58099: [4.8/4.9 Regression] [F03] over-zealous procedure-pointer error checking

10055

+!

10056

+! Contributed by Daniel Price <daniel.price@monash.edu>

10057

+

10058

+ implicit none

10059

+ procedure(real), pointer :: wfunc

10060

+

10061

+ wfunc => w_cubic

10062

+

10063

+contains

10064

+

10065

+ pure real function w_cubic(q2)

10066

+ real, intent(in) :: q2

10067

+ w_cubic = 0.

10068

+ end function

10069

+

10070

+end

10071

Index: gcc/testsuite/gfortran.dg/extends_15.f90

10072

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

10073

--- a/src/gcc/testsuite/gfortran.dg/extends_15.f90 (.../tags/gcc_4_8_2_release)

10074

+++ b/src/gcc/testsuite/gfortran.dg/extends_15.f90 (.../branches/gcc-4_8-branch)

10075

@@ -0,0 +1,16 @@

10076

+! { dg-do compile }

10077

+!

10078

+! PR 58355: [4.7/4.8/4.9 Regression] [F03] ICE with TYPE, EXTENDS before parent TYPE defined

10079

+!

10080

+! Contributed by Andrew Benson <abensonca@gmail.com>

10081

+

10082

+module ct

10083

+ public :: t1

10084

+

10085

+ type, extends(t1) :: t2 ! { dg-error "has not been previously defined" }

10086

+

10087

+ type :: t1

10088

+ end type

10089

+end

10090

+

10091

+! { dg-final { cleanup-modules "ct" } }

10092

Index: gcc/testsuite/gfortran.dg/optional_class_1.f90

10093

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

10094

--- a/src/gcc/testsuite/gfortran.dg/optional_class_1.f90 (.../tags/gcc_4_8_2_release)

10095

+++ b/src/gcc/testsuite/gfortran.dg/optional_class_1.f90 (.../branches/gcc-4_8-branch)

10096

@@ -0,0 +1,45 @@

10097

+! { dg-do run }

10098

+!

10099

+! PR fortran/57445

10100

+!

10101

+! Contributed by Tobias Burnus <burnus@gcc.gnu.org>

10102

+!

10103

+! Spurious assert was added at revision 192495

10104

+!

10105

+module m

10106

+ implicit none

10107

+ type t

10108

+ integer :: i

10109

+ end type t

10110

+contains

10111

+ subroutine opt(xa, xc, xaa, xca)

10112

+ type(t), allocatable, intent(out), optional :: xa

10113

+ class(t), allocatable, intent(out), optional :: xc

10114

+ type(t), allocatable, intent(out), optional :: xaa(:)

10115

+ class(t), allocatable, intent(out), optional :: xca(:)

10116

+ if (present (xca)) call foo_opt(xca=xca)

10117

+ end subroutine opt

10118

+ subroutine foo_opt(xa, xc, xaa, xca)

10119

+ type(t), allocatable, intent(out), optional :: xa

10120

+ class(t), allocatable, intent(out), optional :: xc

10121

+ type(t), allocatable, intent(out), optional :: xaa(:)

10122

+ class(t), allocatable, intent(out), optional :: xca(:)

10123

+ if (present (xca)) then

10124

+ if (allocated (xca)) deallocate (xca)

10125

+ allocate (xca(3), source = [t(9),t(99),t(999)])

10126

+ end if

10127

+ end subroutine foo_opt

10128

+end module m

10129

+ use m

10130

+ class(t), allocatable :: xca(:)

10131

+ allocate (xca(1), source = t(42))

10132

+ select type (xca)

10133

+ type is (t)

10134

+ if (any (xca%i .ne. [42])) call abort

10135

+ end select

10136

+ call opt (xca = xca)

10137

+ select type (xca)

10138

+ type is (t)

10139

+ if (any (xca%i .ne. [9,99,999])) call abort

10140

+ end select

10141

+end

10142

Index: gcc/testsuite/gfortran.dg/dynamic_dispatch_12.f90

10143

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

10144

--- a/src/gcc/testsuite/gfortran.dg/dynamic_dispatch_12.f90 (.../tags/gcc_4_8_2_release)

10145

+++ b/src/gcc/testsuite/gfortran.dg/dynamic_dispatch_12.f90 (.../branches/gcc-4_8-branch)

10146

@@ -0,0 +1,74 @@

10147

+! { dg-do run }

10148

+!

10149

+! PR 59654: [4.8/4.9 Regression] [OOP] Broken function table with complex OO use case

10150

+!

10151

+! Contributed by Thomas Clune <Thomas.L.Clune@nasa.gov>

10152

+

10153

+module TestResult_mod

10154

+ implicit none

10155

+

10156

+ type TestResult

10157

+ integer :: numRun = 0

10158

+ contains

10159

+ procedure :: run

10160

+ procedure, nopass :: getNumRun

10161

+ end type

10162

+

10163

+contains

10164

+

10165

+ subroutine run (this)

10166

+ class (TestResult) :: this

10167

+ this%numRun = this%numRun + 1

10168

+ end subroutine

10169

+

10170

+ subroutine getNumRun()

10171

+ end subroutine

10172

+

10173

+end module

10174

+

10175

+

10176

+module BaseTestRunner_mod

10177

+ implicit none

10178

+

10179

+ type :: BaseTestRunner

10180

+ contains

10181

+ procedure, nopass :: norun

10182

+ end type

10183

+

10184

+contains

10185

+

10186

+ function norun () result(result)

10187

+ use TestResult_mod, only: TestResult

10188

+ type (TestResult) :: result

10189

+ end function

10190

+

10191

+end module

10192

+

10193

+

10194

+module TestRunner_mod

10195

+ use BaseTestRunner_mod, only: BaseTestRunner

10196

+ implicit none

10197

+end module

10198

+

10199

+

10200

+program main

10201

+ use TestRunner_mod, only: BaseTestRunner

10202

+ use TestResult_mod, only: TestResult

10203

+ implicit none

10204

+

10205

+ type (TestResult) :: result

10206

+

10207

+ call runtest (result)

10208

+

10209

+contains

10210

+

10211

+ subroutine runtest (result)

10212

+ use TestResult_mod, only: TestResult

10213

+ class (TestResult) :: result

10214

+ call result%run()

10215

+ if (result%numRun /= 1) call abort()

10216

+ end subroutine

10217

+

10218

+end

10219

+

10220

+! { dg-final { cleanup-modules "TestResult_mod BaseTestRunner_mod TestRunner_mod" } }

10221

Index: gcc/testsuite/gfortran.dg/unlimited_polymorphic_15.f90

10222

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

10223

--- a/src/gcc/testsuite/gfortran.dg/unlimited_polymorphic_15.f90 (.../tags/gcc_4_8_2_release)

10224

+++ b/src/gcc/testsuite/gfortran.dg/unlimited_polymorphic_15.f90 (.../branches/gcc-4_8-branch)

10225

@@ -0,0 +1,17 @@

10226

+! { dg-do compile }

10227

+!

10228

+! PR 59493: [OOP] ICE: Segfault on Class(*) pointer association

10229

+!

10230

+! Contributed by Hossein Talebi <talebi.hossein@gmail.com>

10231

+

10232

+ implicit none

10233

+

10234

+ type ty_mytype1

10235

+ end type

10236

+

10237

+ class(ty_mytype1), allocatable, target:: cla1

10238

+ class(*), pointer :: ptr

10239

+

10240

+ ptr => cla1

10241

+

10242

+end

10243

Index: gcc/testsuite/gcc.c-torture/execute/pr58984.c

10244

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

10245

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58984.c (.../tags/gcc_4_8_2_release)

10246

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58984.c (.../branches/gcc-4_8-branch)

10247

@@ -0,0 +1,57 @@

10248

+/* PR tree-optimization/58984 */

10249

+

10250

+struct S { int f0 : 8; int : 6; int f1 : 5; };

10251

+struct T { char f0; int : 6; int f1 : 5; };

10252

+

10253

+int a, *c = &a, e, n, b, m;

10254

+

10255

+static int

10256

+foo (struct S p)

10257

+{

10258

+ const unsigned short *f[36];

10259

+ for (; e < 2; e++)

10260

+ {

10261

+ const unsigned short **i = &f[0];

10262

+ *c ^= 1;

10263

+ if (p.f1)

10264

+ {

10265

+ *i = 0;

10266

+ return b;

10267

+ }

10268

+ }

10269

+ return 0;

10270

+}

10271

+

10272

+static int

10273

+bar (struct T p)

10274

+{

10275

+ const unsigned short *f[36];

10276

+ for (; e < 2; e++)

10277

+ {

10278

+ const unsigned short **i = &f[0];

10279

+ *c ^= 1;

10280

+ if (p.f1)

10281

+ {

10282

+ *i = 0;

10283

+ return b;

10284

+ }

10285

+ }

10286

+ return 0;

10287

+}

10288

+

10289

+int

10290

+main ()

10291

+{

10292

+ struct S o = { 1, 1 };

10293

+ foo (o);

10294

+ m = n || o.f0;

10295

+ if (a != 1)

10296

+ __builtin_abort ();

10297

+ e = 0;

10298

+ struct T p = { 1, 1 };

10299

+ bar (p);

10300

+ m |= n || p.f0;

10301

+ if (a != 0)

10302

+ __builtin_abort ();

10303

+ return 0;

10304

+}

10305

Index: gcc/testsuite/gcc.c-torture/execute/20131127-1.c

10306

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

10307

--- a/src/gcc/testsuite/gcc.c-torture/execute/20131127-1.c (.../tags/gcc_4_8_2_release)

10308

+++ b/src/gcc/testsuite/gcc.c-torture/execute/20131127-1.c (.../branches/gcc-4_8-branch)

10309

@@ -0,0 +1,34 @@

10310

+/* PR middle-end/59138 */

10311

+/* Testcase by John Regehr <regehr@cs.utah.edu> */

10312

+

10313

+extern void abort (void);

10314

+

10315

+#pragma pack(1)

10316

+

10317

+struct S0 {

10318

+ int f0;

10319

+ int f1;

10320

+ int f2;

10321

+ short f3;

10322

+};

10323

+

10324

+short a = 1;

10325

+

10326

+struct S0 b = { 1 }, c, d, e;

10327

+

10328

+struct S0 fn1() { return c; }

10329

+

10330

+void fn2 (void)

10331

+{

10332

+ b = fn1 ();

10333

+ a = 0;

10334

+ d = e;

10335

+}

10336

+

10337

+int main (void)

10338

+{

10339

+ fn2 ();

10340

+ if (a != 0)

10341

+ abort ();

10342

+ return 0;

10343

+}

10344

Index: gcc/testsuite/gcc.c-torture/execute/pr59358.c

10345

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

10346

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59358.c (.../tags/gcc_4_8_2_release)

10347

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59358.c (.../branches/gcc-4_8-branch)

10348

@@ -0,0 +1,44 @@

10349

+/* PR tree-optimization/59358 */

10350

+

10351

+__attribute__((noinline, noclone)) int

10352

+foo (int *x, int y)

10353

+{

10354

+ int z = *x;

10355

+ if (y > z && y <= 16)

10356

+ while (y > z)

10357

+ z *= 2;

10358

+ return z;

10359

+}

10360

+

10361

+int

10362

+main ()

10363

+{

10364

+ int i;

10365

+ for (i = 1; i < 17; i++)

10366

+ {

10367

+ int j = foo (&i, 16);

10368

+ int k;

10369

+ if (i >= 8 && i <= 15)

10370

+ k = 16 + (i - 8) * 2;

10371

+ else if (i >= 4 && i <= 7)

10372

+ k = 16 + (i - 4) * 4;

10373

+ else if (i == 3)

10374

+ k = 24;

10375

+ else

10376

+ k = 16;

10377

+ if (j != k)

10378

+ __builtin_abort ();

10379

+ j = foo (&i, 7);

10380

+ if (i >= 7)

10381

+ k = i;

10382

+ else if (i >= 4)

10383

+ k = 8 + (i - 4) * 2;

10384

+ else if (i == 3)

10385

+ k = 12;

10386

+ else

10387

+ k = 8;

10388

+ if (j != k)

10389

+ __builtin_abort ();

10390

+ }

10391

+ return 0;

10392

+}

10393

Index: gcc/testsuite/gcc.c-torture/execute/pr59014-2.c

10394

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

10395

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59014-2.c (.../tags/gcc_4_8_2_release)

10396

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59014-2.c (.../branches/gcc-4_8-branch)

10397

@@ -0,0 +1,23 @@

10398

+/* PR tree-optimization/59014 */

10399

+

10400

+__attribute__((noinline, noclone)) long long int

10401

+foo (long long int x, long long int y)

10402

+{

10403

+ if (((int) x | (int) y) != 0)

10404

+ return 6;

10405

+ return x + y;

10406

+}

10407

+

10408

+int

10409

+main ()

10410

+{

10411

+ if (sizeof (long long) == sizeof (int))

10412

+ return 0;

10413

+ int shift_half = sizeof (int) * __CHAR_BIT__ / 2;

10414

+ long long int x = (3LL << shift_half) << shift_half;

10415

+ long long int y = (5LL << shift_half) << shift_half;

10416

+ long long int z = foo (x, y);

10417

+ if (z != ((8LL << shift_half) << shift_half))

10418

+ __builtin_abort ();

10419

+ return 0;

10420

+}

10421

Index: gcc/testsuite/gcc.c-torture/execute/pr59101.c

10422

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

10423

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59101.c (.../tags/gcc_4_8_2_release)

10424

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59101.c (.../branches/gcc-4_8-branch)

10425

@@ -0,0 +1,15 @@

10426

+/* PR target/59101 */

10427

+

10428

+__attribute__((noinline, noclone)) int

10429

+foo (int a)

10430

+{

10431

+ return (~a & 4102790424LL) > 0 | 6;

10432

+}

10433

+

10434

+int

10435

+main ()

10436

+{

10437

+ if (foo (0) != 7)

10438

+ __builtin_abort ();

10439

+ return 0;

10440

+}

10441

Index: gcc/testsuite/gcc.c-torture/execute/pr58831.c

10442

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

10443

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58831.c (.../tags/gcc_4_8_2_release)

10444

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58831.c (.../branches/gcc-4_8-branch)

10445

@@ -0,0 +1,40 @@

10446

+#include <assert.h>

10447

+

10448

+int a, *b, c, d, f, **i, p, q, *r;

10449

+short o, j;

10450

+

10451

+static int __attribute__((noinline, noclone))

10452

+fn1 (int *p1, int **p2)

10453

+{

10454

+ int **e = &b;

10455

+ for (; p; p++)

10456

+ *p1 = 1;

10457

+ *e = *p2 = &d;

10458

+

10459

+ assert (r);

10460

+

10461

+ return c;

10462

+}

10463

+

10464

+static int ** __attribute__((noinline, noclone))

10465

+fn2 (void)

10466

+{

10467

+ for (f = 0; f != 42; f++)

10468

+ {

10469

+ int *g[3] = {0, 0, 0};

10470

+ for (o = 0; o; o--)

10471

+ for (; a > 1;)

10472

+ {

10473

+ int **h[1] = { &g[2] };

10474

+ }

10475

+ }

10476

+ return &r;

10477

+}

10478

+

10479

+int

10480

+main (void)

10481

+{

10482

+ i = fn2 ();

10483

+ fn1 (b, i);

10484

+ return 0;

10485

+}

10486

Index: gcc/testsuite/gcc.c-torture/execute/pr58726.c

10487

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

10488

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58726.c (.../tags/gcc_4_8_2_release)

10489

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58726.c (.../branches/gcc-4_8-branch)

10490

@@ -0,0 +1,26 @@

10491

+/* PR rtl-optimization/58726 */

10492

+

10493

+int a, c;

10494

+union { int f1; int f2 : 1; } b;

10495

+

10496

+short

10497

+foo (short p)

10498

+{

10499

+ return p < 0 ? p : a;

10500

+}

10501

+

10502

+int

10503

+main ()

10504

+{

10505

+ if (sizeof (short) * __CHAR_BIT__ != 16

10506

+ || sizeof (int) * __CHAR_BIT__ != 32)

10507

+ return 0;

10508

+ b.f1 = 56374;

10509

+ unsigned short d;

10510

+ int e = b.f2;

10511

+ d = e == 0 ? b.f1 : 0;

10512

+ c = foo (d);

10513

+ if (c != (short) 56374)

10514

+ __builtin_abort ();

10515

+ return 0;

10516

+}

10517

Index: gcc/testsuite/gcc.c-torture/execute/pr59014.c

10518

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

10519

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59014.c (.../tags/gcc_4_8_2_release)

10520

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59014.c (.../branches/gcc-4_8-branch)

10521

@@ -0,0 +1,25 @@

10522

+/* PR tree-optimization/59014 */

10523

+

10524

+int a = 2, b, c, d;

10525

+

10526

+int

10527

+foo ()

10528

+{

10529

+ for (;; c++)

10530

+ if ((b > 0) | (a & 1))

10531

+ ;

10532

+ else

10533

+ {

10534

+ d = a;

10535

+ return 0;

10536

+ }

10537

+}

10538

+

10539

+int

10540

+main ()

10541

+{

10542

+ foo ();

10543

+ if (d != 2)

10544

+ __builtin_abort ();

10545

+ return 0;

10546

+}

10547

Index: gcc/testsuite/gcc.c-torture/execute/pr59388.c

10548

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

10549

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59388.c (.../tags/gcc_4_8_2_release)

10550

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59388.c (.../branches/gcc-4_8-branch)

10551

@@ -0,0 +1,11 @@

10552

+/* PR tree-optimization/59388 */

10553

+

10554

+int a;

10555

+struct S { unsigned int f:1; } b;

10556

+

10557

+int

10558

+main ()

10559

+{

10560

+ a = (0 < b.f) | b.f;

10561

+ return a;

10562

+}

10563

Index: gcc/testsuite/gcc.c-torture/compile/pr58970-1.c

10564

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

10565

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58970-1.c (.../tags/gcc_4_8_2_release)

10566

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58970-1.c (.../branches/gcc-4_8-branch)

10567

@@ -0,0 +1,11 @@

10568

+/* PR middle-end/58970 */

10569

+

10570

+struct T { int b : 1; };

10571

+struct S { struct T t[1]; };

10572

+

10573

+void

10574

+foo (int x, struct S *s)

10575

+{

10576

+ if (x == -1)

10577

+ s->t[x].b = 0;

10578

+}

10579

Index: gcc/testsuite/gcc.c-torture/compile/pr58997.c

10580

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

10581

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58997.c (.../tags/gcc_4_8_2_release)

10582

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58997.c (.../branches/gcc-4_8-branch)

10583

@@ -0,0 +1,19 @@

10584

+/* PR rtl-optimization/58997 */

10585

+

10586

+int a, b, c, e;

10587

+short d;

10588

+char h;

10589

+

10590

+void

10591

+foo ()

10592

+{

10593

+ while (b)

10594

+ {

10595

+ d = a ? c : 1 % a;

10596

+ c = d;

10597

+ h = d;

10598

+ if (!h)

10599

+ while (e)

10600

+ ;

10601

+ }

10602

+}

10603

Index: gcc/testsuite/gcc.c-torture/compile/pr58970-2.c

10604

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

10605

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58970-2.c (.../tags/gcc_4_8_2_release)

10606

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58970-2.c (.../branches/gcc-4_8-branch)

10607

@@ -0,0 +1,11 @@

10608

+/* PR middle-end/58970 */

10609

+

10610

+struct T { char a : 8; char b : 1; };

10611

+struct S { char x; struct T t[1]; };

10612

+

10613

+void

10614

+foo (int x, struct S *s)

10615

+{

10616

+ if (x == -1)

10617

+ s->t[x].b = 0;

10618

+}

10619

Index: gcc/testsuite/gcc.c-torture/compile/pr59362.c

10620

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

10621

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr59362.c (.../tags/gcc_4_8_2_release)

10622

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr59362.c (.../branches/gcc-4_8-branch)

10623

@@ -0,0 +1,21 @@

10624

+/* PR tree-optimization/59362 */

10625

+

10626

+char *

10627

+foo (char *r, int s)

10628

+{

10629

+ r = __builtin___stpcpy_chk (r, "abc", __builtin_object_size (r, 1));

10630

+ if (s)

10631

+ r = __builtin___stpcpy_chk (r, "d", __builtin_object_size (r, 1));

10632

+ return r;

10633

+}

10634

+

10635

+char *a;

10636

+long int b;

10637

+

10638

+void

10639

+bar (void)

10640

+{

10641

+ b = __builtin_object_size (0, 0);

10642

+ a = __builtin___stpcpy_chk (0, "", b);

10643

+ b = __builtin_object_size (a, 0);

10644

+}

10645

Index: gcc/testsuite/gcc.dg/pr58668.c

10646

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

10647

--- a/src/gcc/testsuite/gcc.dg/pr58668.c (.../tags/gcc_4_8_2_release)

10648

+++ b/src/gcc/testsuite/gcc.dg/pr58668.c (.../branches/gcc-4_8-branch)

10649

@@ -0,0 +1,25 @@

10650

+/* PR rtl-optimization/58668 */

10651

+/* { dg-do compile } */

10652

+/* { dg-options "-O2" } */

10653

+/* { dg-additional-options "-mthumb" { target { { arm*-*-* } && arm_thumb2_ok } } } */

10654

+

10655

+void *fn1 (void *);

10656

+void *fn2 (void *, const char *);

10657

+void fn3 (void *);

10658

+void fn4 (void *, int);

10659

+

10660

+void *

10661

+test (void *x)

10662

+{

10663

+ void *a, *b;

10664

+ if (!(a = fn1 (x)))

10665

+ return (void *) 0;

10666

+ if (!(b = fn2 (a, "w")))

10667

+ {

10668

+ fn3 (a);

10669

+ return (void *) 0;

10670

+ }

10671

+ fn3 (a);

10672

+ fn4 (b, 1);

10673

+ return b;

10674

+}

10675

Index: gcc/testsuite/gcc.dg/pr57518.c

10676

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

10677

--- a/src/gcc/testsuite/gcc.dg/pr57518.c (.../tags/gcc_4_8_2_release)

10678

+++ b/src/gcc/testsuite/gcc.dg/pr57518.c (.../branches/gcc-4_8-branch)

10679

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

10680

-/* PR rtl-optimization/57130 */

10681

+/* PR rtl-optimization/57518 */

10682

10683

/* { dg-do compile } */

10684

/* { dg-options "-O2 -fdump-rtl-ira" } */

10685

-/* { dg-final { scan-rtl-dump-not "REG_EQUIV.*mem.*\"ip\"" "ira" } } */

10686

+/* { dg-final { scan-rtl-dump-not "REG_EQUIV\[^\n\]*mem\[^\n\]*\"ip\".*subreg" "ira" } } */

10687

10688

char ip[10];

10689

int total;

10690

Index: gcc/testsuite/gcc.dg/builtin-object-size-14.c

10691

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

10692

--- a/src/gcc/testsuite/gcc.dg/builtin-object-size-14.c (.../tags/gcc_4_8_2_release)

10693

+++ b/src/gcc/testsuite/gcc.dg/builtin-object-size-14.c (.../branches/gcc-4_8-branch)

10694

@@ -0,0 +1,28 @@

10695

+/* { dg-do run } */

10696

+/* { dg-options "-O2" } */

10697

+

10698

+extern void abort (void);

10699

+extern char *strncpy(char *, const char *, __SIZE_TYPE__);

10700

+

10701

+union u {

10702

+ struct {

10703

+ char vi[8];

10704

+ char pi[16];

10705

+ };

10706

+ char all[8+16+4];

10707

+};

10708

+

10709

+void __attribute__((noinline,noclone))

10710

+f(union u *u)

10711

+{

10712

+ char vi[8+1];

10713

+ __builtin_strncpy(vi, u->vi, sizeof(u->vi));

10714

+ if (__builtin_object_size (u->all, 1) != -1)

10715

+ abort ();

10716

+}

10717

+int main()

10718

+{

10719

+ union u u;

10720

+ f (&u);

10721

+ return 0;

10722

+}

10723

Index: gcc/testsuite/gcc.dg/20050922-1.c

10724

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

10725

--- a/src/gcc/testsuite/gcc.dg/20050922-1.c (.../tags/gcc_4_8_2_release)

10726

+++ b/src/gcc/testsuite/gcc.dg/20050922-1.c (.../branches/gcc-4_8-branch)

10727

@@ -4,7 +4,7 @@

10728

/* { dg-do run } */

10729

/* { dg-options "-O1 -std=c99" } */

10730

10731

-#include <stdlib.h>

10732

+extern void abort (void);

10733

10734

#if __INT_MAX__ == 2147483647

10735

typedef unsigned int uint32_t;

10736

Index: gcc/testsuite/gcc.dg/atomic-store-6.c

10737

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

10738

--- a/src/gcc/testsuite/gcc.dg/atomic-store-6.c (.../tags/gcc_4_8_2_release)

10739

+++ b/src/gcc/testsuite/gcc.dg/atomic-store-6.c (.../branches/gcc-4_8-branch)

10740

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

10741

+/* { dg-do run } */

10742

+/* { dg-require-effective-target sync_int_128_runtime } */

10743

+/* { dg-options "-mcx16" { target { i?86-*-* x86_64-*-* } } } */

10744

+

10745

+__int128_t i;

10746

+

10747

+int main()

10748

+{

10749

+ __atomic_store_16(&i, -1, 0);

10750

+ if (i != -1)

10751

+ __builtin_abort();

10752

+ return 0;

10753

+}

10754

Index: gcc/testsuite/gcc.dg/strlenopt-4gf.c

10755

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

10756

--- a/src/gcc/testsuite/gcc.dg/strlenopt-4gf.c (.../tags/gcc_4_8_2_release)

10757

+++ b/src/gcc/testsuite/gcc.dg/strlenopt-4gf.c (.../branches/gcc-4_8-branch)

10758

@@ -7,13 +7,13 @@

10759

#include "strlenopt-4.c"

10760

10761

/* { dg-final { scan-tree-dump-times "strlen \\(" 1 "strlen" } } */

10762

-/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 4 "strlen" } } */

10763

-/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 1 "strlen" } } */

10764

+/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 0 "strlen" } } */

10765

+/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 0 "strlen" } } */

10766

/* { dg-final { scan-tree-dump-times "__strcat_chk \\(" 0 "strlen" } } */

10767

/* { dg-final { scan-tree-dump-times "strchr \\(" 0 "strlen" } } */

10768

-/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 5 "strlen" } } */

10769

-/* { dg-final { scan-tree-dump-times "memcpy \\(" 0 "strlen" } } */

10770

-/* { dg-final { scan-tree-dump-times "strcpy \\(" 0 "strlen" } } */

10771

+/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 0 "strlen" } } */

10772

+/* { dg-final { scan-tree-dump-times "memcpy \\(" 4 "strlen" } } */

10773

+/* { dg-final { scan-tree-dump-times "strcpy \\(" 1 "strlen" } } */

10774

/* { dg-final { scan-tree-dump-times "strcat \\(" 0 "strlen" } } */

10775

-/* { dg-final { scan-tree-dump-times "stpcpy \\(" 0 "strlen" } } */

10776

+/* { dg-final { scan-tree-dump-times "stpcpy \\(" 5 "strlen" } } */

10777

/* { dg-final { cleanup-tree-dump "strlen" } } */

10778

Index: gcc/testsuite/gcc.dg/pr59351.c

10779

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

10780

--- a/src/gcc/testsuite/gcc.dg/pr59351.c (.../tags/gcc_4_8_2_release)

10781

+++ b/src/gcc/testsuite/gcc.dg/pr59351.c (.../branches/gcc-4_8-branch)

10782

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

10783

+/* { dg-do compile } */

10784

+/* { dg-options "-std=c99 -Wpedantic" } */

10785

+

10786

+unsigned int

10787

+foo (void)

10788

+{

10789

+ return sizeof ((int[]) {}); /* { dg-warning "ISO C forbids empty initializer braces" } */

10790

+}

10791

Index: gcc/testsuite/gcc.dg/builtin-object-size-8.c

10792

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

10793

--- a/src/gcc/testsuite/gcc.dg/builtin-object-size-8.c (.../tags/gcc_4_8_2_release)

10794

+++ b/src/gcc/testsuite/gcc.dg/builtin-object-size-8.c (.../branches/gcc-4_8-branch)

10795

@@ -1,4 +1,4 @@

10796

-/* { dg-do run { xfail *-*-* } } */

10797

+/* { dg-do run } */

10798

/* { dg-options "-O2" } */

10799

10800

typedef __SIZE_TYPE__ size_t;

10801

Index: gcc/testsuite/gcc.dg/20050922-2.c

10802

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

10803

--- a/src/gcc/testsuite/gcc.dg/20050922-2.c (.../tags/gcc_4_8_2_release)

10804

+++ b/src/gcc/testsuite/gcc.dg/20050922-2.c (.../branches/gcc-4_8-branch)

10805

@@ -4,7 +4,8 @@

10806

/* { dg-do run } */

10807

/* { dg-options "-O1 -std=c99" } */

10808

10809

-#include <stdlib.h>

10810

+extern void abort (void);

10811

+extern void exit (int);

10812

10813

#if __INT_MAX__ == 2147483647

10814

typedef unsigned int uint32_t;

10815

Index: gcc/testsuite/gcc.dg/pr59011.c

10816

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

10817

--- a/src/gcc/testsuite/gcc.dg/pr59011.c (.../tags/gcc_4_8_2_release)

10818

+++ b/src/gcc/testsuite/gcc.dg/pr59011.c (.../branches/gcc-4_8-branch)

10819

@@ -0,0 +1,22 @@

10820

+/* PR middle-end/59011 */

10821

+/* { dg-do compile } */

10822

+/* { dg-options "-std=gnu99" } */

10823

+

10824

+void

10825

+foo (int m)

10826

+{

10827

+ int a[m];

10828

+ void

10829

+ bar (void)

10830

+ {

10831

+ {

10832

+ int

10833

+ baz (void)

10834

+ {

10835

+ return a[0];

10836

+ }

10837

+ }

10838

+ a[0] = 42;

10839

+ }

10840

+ bar ();

10841

+}

10842

Index: gcc/testsuite/gcc.dg/pr58805.c

10843

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

10844

--- a/src/gcc/testsuite/gcc.dg/pr58805.c (.../tags/gcc_4_8_2_release)

10845

+++ b/src/gcc/testsuite/gcc.dg/pr58805.c (.../branches/gcc-4_8-branch)

10846

@@ -0,0 +1,24 @@

10847

+/* { dg-do compile } */

10848

+/* { dg-options "-O2 -ftree-tail-merge -fdump-tree-pre" } */

10849

+

10850

+/* Type that matches the 'p' constraint. */

10851

+#define TYPE void *

10852

+

10853

+static inline

10854

+void bar (TYPE *r)

10855

+{

10856

+ TYPE t;

10857

+ __asm__ ("" : "=&p" (t), "=p" (*r));

10858

+}

10859

+

10860

+void

10861

+foo (int n, TYPE *x, TYPE *y)

10862

+{

10863

+ if (n == 0)

10864

+ bar (x);

10865

+ else

10866

+ bar (y);

10867

+}

10868

+

10869

+/* { dg-final { scan-tree-dump-times "__asm__" 2 "pre"} } */

10870

+/* { dg-final { cleanup-tree-dump "pre" } } */

10871

Index: gcc/testsuite/gcc.dg/strlenopt-14gf.c

10872

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

10873

--- a/src/gcc/testsuite/gcc.dg/strlenopt-14gf.c (.../tags/gcc_4_8_2_release)

10874

+++ b/src/gcc/testsuite/gcc.dg/strlenopt-14gf.c (.../branches/gcc-4_8-branch)

10875

@@ -11,14 +11,14 @@

10876

memcpy. */

10877

/* { dg-final { scan-tree-dump-times "strlen \\(" 4 "strlen" } } */

10878

/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 0 "strlen" } } */

10879

-/* { dg-final { scan-tree-dump-times "__mempcpy_chk \\(" 2 "strlen" } } */

10880

+/* { dg-final { scan-tree-dump-times "__mempcpy_chk \\(" 0 "strlen" } } */

10881

/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 0 "strlen" } } */

10882

/* { dg-final { scan-tree-dump-times "__strcat_chk \\(" 0 "strlen" } } */

10883

/* { dg-final { scan-tree-dump-times "strchr \\(" 0 "strlen" } } */

10884

-/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 3 "strlen" } } */

10885

-/* { dg-final { scan-tree-dump-times "memcpy \\(" 0 "strlen" } } */

10886

-/* { dg-final { scan-tree-dump-times "mempcpy \\(" 0 "strlen" } } */

10887

+/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 0 "strlen" } } */

10888

+/* { dg-final { scan-tree-dump-times "memcpy \\(" 1 "strlen" } } */

10889

+/* { dg-final { scan-tree-dump-times "mempcpy \\(" 2 "strlen" } } */

10890

/* { dg-final { scan-tree-dump-times "strcpy \\(" 0 "strlen" } } */

10891

/* { dg-final { scan-tree-dump-times "strcat \\(" 0 "strlen" } } */

10892

-/* { dg-final { scan-tree-dump-times "stpcpy \\(" 0 "strlen" } } */

10893

+/* { dg-final { scan-tree-dump-times "stpcpy \\(" 2 "strlen" } } */

10894

/* { dg-final { cleanup-tree-dump "strlen" } } */

10895

Index: gcc/testsuite/gcc.dg/torture/pr59047.c

10896

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

10897

--- a/src/gcc/testsuite/gcc.dg/torture/pr59047.c (.../tags/gcc_4_8_2_release)

10898

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59047.c (.../branches/gcc-4_8-branch)

10899

@@ -0,0 +1,39 @@

10900

+/* { dg-do run } */

10901

+

10902

+extern void abort (void);

10903

+

10904

+struct

10905

+{

10906

+ int f0;

10907

+ int f1:1;

10908

+ int f2:2;

10909

+} a = {0, 0, 1};

10910

+

10911

+int b, c, *d, e, f;

10912

+

10913

+int

10914

+fn1 ()

10915

+{

10916

+ for (; b < 1; ++b)

10917

+ {

10918

+ for (e = 0; e < 1; e = 1)

10919

+ {

10920

+ int **g = &d;

10921

+ *g = &c;

10922

+ }

10923

+ *d = 0;

10924

+ f = a.f1;

10925

+ if (f)

10926

+ return 0;

10927

+ }

10928

+ return 0;

10929

+}

10930

+

10931

+int

10932

+main ()

10933

+{

10934

+ fn1 ();

10935

+ if (b != 1)

10936

+ abort ();

10937

+ return 0;

10938

+}

10939

Index: gcc/testsuite/gcc.dg/torture/pr58956.c

10940

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

10941

--- a/src/gcc/testsuite/gcc.dg/torture/pr58956.c (.../tags/gcc_4_8_2_release)

10942

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58956.c (.../branches/gcc-4_8-branch)

10943

@@ -0,0 +1,30 @@

10944

+/* { dg-do run } */

10945

+

10946

+extern void abort (void);

10947

+

10948

+struct S

10949

+{

10950

+ int f0;

10951

+} a = {1}, b, g, *c = &b, **f = &c;

10952

+

10953

+int *d, **e = &d, h;

10954

+

10955

+struct S

10956

+foo ()

10957

+{

10958

+ *e = &h;

10959

+ if (!d)

10960

+ __builtin_unreachable ();

10961

+ *f = &g;

10962

+ return a;

10963

+}

10964

+

10965

+int

10966

+main ()

10967

+{

10968

+ struct S *i = c;

10969

+ *i = foo ();

10970

+ if (b.f0 != 1)

10971

+ abort ();

10972

+ return 0;

10973

+}

10974

Index: gcc/testsuite/gcc.dg/torture/pr57517.c

10975

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

10976

--- a/src/gcc/testsuite/gcc.dg/torture/pr57517.c (.../tags/gcc_4_8_2_release)

10977

+++ b/src/gcc/testsuite/gcc.dg/torture/pr57517.c (.../branches/gcc-4_8-branch)

10978

@@ -0,0 +1,16 @@

10979

+/* { dg-do compile } */

10980

+

10981

+int x[1024], y[1024], z[1024], w[1024];

10982

+void foo (void)

10983

+{

10984

+ int i;

10985

+ for (i = 1; i < 1024; ++i)

10986

+ {

10987

+ int a = x[i];

10988

+ int b = y[i];

10989

+ int c = x[i-1];

10990

+ int d = y[i-1];

10991

+ if (w[i])

10992

+ z[i] = (a + b) + (c + d);

10993

+ }

10994

+}

10995

Index: gcc/testsuite/gcc.dg/torture/pr59164.c

10996

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

10997

--- a/src/gcc/testsuite/gcc.dg/torture/pr59164.c (.../tags/gcc_4_8_2_release)

10998

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59164.c (.../branches/gcc-4_8-branch)

10999

@@ -0,0 +1,21 @@

11000

+/* { dg-do compile } */

11001

+

11002

+int a, d, e;

11003

+long b[10];

11004

+int c[10][8];

11005

+

11006

+int fn1(p1)

11007

+{

11008

+ return 1 >> p1;

11009

+}

11010

+

11011

+void fn2(void)

11012

+{

11013

+ int f;

11014

+ for (a=1; a <= 4; a++)

11015

+ {

11016

+ f = fn1(0 < c[a][0]);

11017

+ if (f || d)

11018

+ e = b[a] = 1;

11019

+ }

11020

+}

11021

Index: gcc/testsuite/gcc.dg/torture/pr58779.c

11022

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

11023

--- a/src/gcc/testsuite/gcc.dg/torture/pr58779.c (.../tags/gcc_4_8_2_release)

11024

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58779.c (.../branches/gcc-4_8-branch)

11025

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

11026

+/* { dg-do run } */

11027

+

11028

+int a, c;

11029

+

11030

+int main ()

11031

+{

11032

+ int e = -1;

11033

+ short d = (c <= 0) ^ e;

11034

+ if ((unsigned int) a - (a || d) <= (unsigned int) a)

11035

+ __builtin_abort ();

11036

+ return 0;

11037

+}

11038

Index: gcc/testsuite/gcc.dg/torture/pr59139.c

11039

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

11040

--- a/src/gcc/testsuite/gcc.dg/torture/pr59139.c (.../tags/gcc_4_8_2_release)

11041

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59139.c (.../branches/gcc-4_8-branch)

11042

@@ -0,0 +1,20 @@

11043

+/* { dg-do compile } */

11044

+

11045

+int a, b, c, d, e;

11046

+int fn1(p1, p2) { return p2 == 0 ? p1 : 1 % p2; }

11047

+

11048

+void fn2()

11049

+{

11050

+ c = 0;

11051

+ for (;; c = (unsigned short)c)

11052

+ {

11053

+ b = 2;

11054

+ for (; b; b = a)

11055

+ {

11056

+ e = fn1(2, c && 1);

11057

+ d = c == 0 ? e : c;

11058

+ if (d)

11059

+ return;

11060

+ }

11061

+ }

11062

+}

11063

Index: gcc/testsuite/gcc.dg/torture/pr58079.c

11064

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

11065

--- a/src/gcc/testsuite/gcc.dg/torture/pr58079.c (.../tags/gcc_4_8_2_release)

11066

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58079.c (.../branches/gcc-4_8-branch)

11067

@@ -0,0 +1,107 @@

11068

+/* { dg-options "-mlong-calls" { target mips*-*-* } } */

11069

+

11070

+typedef unsigned char u8;

11071

+typedef unsigned short u16;

11072

+typedef unsigned int __kernel_size_t;

11073

+typedef __kernel_size_t size_t;

11074

+struct list_head {

11075

+ struct list_head *next;

11076

+};

11077

+

11078

+struct dmx_ts_feed {

11079

+ int is_filtering;

11080

+};

11081

+struct dmx_section_feed {

11082

+ u16 secbufp;

11083

+ u16 seclen;

11084

+ u16 tsfeedp;

11085

+};

11086

+

11087

+typedef int (*dmx_ts_cb) (

11088

+ const u8 * buffer1,

11089

+ size_t buffer1_length,

11090

+ const u8 * buffer2,

11091

+ size_t buffer2_length

11092

+);

11093

+

11094

+struct dvb_demux_feed {

11095

+ union {

11096

+ struct dmx_ts_feed ts;

11097

+ struct dmx_section_feed sec;

11098

+ } feed;

11099

+ union {

11100

+ dmx_ts_cb ts;

11101

+ } cb;

11102

+ int type;

11103

+ u16 pid;

11104

+ int ts_type;

11105

+ struct list_head list_head;

11106

+};

11107

+

11108

+struct dvb_demux {

11109

+ int (*stop_feed)(struct dvb_demux_feed *feed);

11110

+ struct list_head feed_list;

11111

+};

11112

+

11113

+

11114

+static

11115

+inline

11116

+__attribute__((always_inline))

11117

+u8

11118

+payload(const u8 *tsp)

11119

+{

11120

+ if (tsp[3] & 0x20) {

11121

+ return 184 - 1 - tsp[4];

11122

+ }

11123

+ return 184;

11124

+}

11125

+

11126

+static

11127

+inline

11128

+__attribute__((always_inline))

11129

+int

11130

+dvb_dmx_swfilter_payload(struct dvb_demux_feed *feed, const u8 *buf)

11131

+{

11132

+ int count = payload(buf);

11133

+ int p;

11134

+ if (count == 0)

11135

+ return -1;

11136

+ return feed->cb.ts(&buf[p], count, ((void *)0), 0);

11137

+}

11138

+

11139

+static

11140

+inline

11141

+__attribute__((always_inline))

11142

+void

11143

+dvb_dmx_swfilter_packet_type(struct dvb_demux_feed *feed, const u8 *buf)

11144

+{

11145

+ switch (feed->type) {

11146

+ case 0:

11147

+ if (feed->ts_type & 1) {

11148

+ dvb_dmx_swfilter_payload(feed, buf);

11149

+ }

11150

+ if (dvb_dmx_swfilter_section_packet(feed, buf) < 0)

11151

+ feed->feed.sec.seclen = feed->feed.sec.secbufp = 0;

11152

+ }

11153

+}

11154

+

11155

+static

11156

+void

11157

+dvb_dmx_swfilter_packet(struct dvb_demux *demux, const u8 *buf)

11158

+{

11159

+ struct dvb_demux_feed *feed;

11160

+ int dvr_done = 0;

11161

+

11162

+ 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) );})) {

11163

+ if (((((feed)->type == 0) && ((feed)->feed.ts.is_filtering) && (((feed)->ts_type & (1 | 8)) == 1))) && (dvr_done++))

11164

+ dvb_dmx_swfilter_packet_type(feed, buf);

11165

+ else if (feed->pid == 0x2000)

11166

+ feed->cb.ts(buf, 188, ((void *)0), 0);

11167

+ }

11168

+}

11169

+void dvb_dmx_swfilter_packets(struct dvb_demux *demux, const u8 *buf, size_t count)

11170

+{

11171

+ while (count--) {

11172

+ dvb_dmx_swfilter_packet(demux, buf);

11173

+ }

11174

+}

11175

Index: gcc/testsuite/gcc.dg/torture/pr58830.c

11176

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

11177

--- a/src/gcc/testsuite/gcc.dg/torture/pr58830.c (.../tags/gcc_4_8_2_release)

11178

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58830.c (.../branches/gcc-4_8-branch)

11179

@@ -0,0 +1,42 @@

11180

+/* { dg-do run } */

11181

+/* { dg-additional-options "-ftree-pre -ftree-partial-pre" } */

11182

+

11183

+extern void abort (void);

11184

+

11185

+int b, c, d, f, g, h, i, j[6], *l = &b, *m, n, *o, r;

11186

+char k;

11187

+

11188

+static int

11189

+foo ()

11190

+{

11191

+ char *p = &k;

11192

+

11193

+ for (; d; d++)

11194

+ if (i)

11195

+ h = 0;

11196

+ else

11197

+ h = c || (r = 0);

11198

+

11199

+ for (f = 0; f < 2; f++)

11200

+ {

11201

+ unsigned int q;

11202

+ *l = 0;

11203

+ if (n)

11204

+ *m = g;

11205

+ if (g)

11206

+ o = 0;

11207

+ for (q = -8; q >= 5; q++)

11208

+ (*p)--;

11209

+ }

11210

+

11211

+ return 0;

11212

+}

11213

+

11214

+int

11215

+main ()

11216

+{

11217

+ foo ();

11218

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

11219

+ abort ();

11220

+ return 0;

11221

+}

11222

Index: gcc/testsuite/gcc.dg/torture/pr59715.c

11223

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

11224

--- a/src/gcc/testsuite/gcc.dg/torture/pr59715.c (.../tags/gcc_4_8_2_release)

11225

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59715.c (.../branches/gcc-4_8-branch)

11226

@@ -0,0 +1,21 @@

11227

+/* { dg-do run } */

11228

+

11229

+extern void abort (void);

11230

+

11231

+int a = 2, b;

11232

+

11233

+int

11234

+main ()

11235

+{

11236

+ int c;

11237

+ if (!b)

11238

+ {

11239

+ b = a;

11240

+ c = a == 0 ? 1 : 1 % a;

11241

+ if (c)

11242

+ b = 0;

11243

+ }

11244

+ if (b != 0)

11245

+ abort ();

11246

+ return 0;

11247

+}

11248

Index: gcc/testsuite/gcc.dg/torture/pr58143-1.c

11249

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

11250

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-1.c (.../tags/gcc_4_8_2_release)

11251

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-1.c (.../branches/gcc-4_8-branch)

11252

@@ -0,0 +1,51 @@

11253

+/* { dg-do run } */

11254

+/* { dg-additional-options "-fstrict-overflow" } */

11255

+

11256

+extern void abort (void);

11257

+

11258

+int a, b, c, d, e, f, g, h = 1, i;

11259

+

11260

+int foo (int p)

11261

+{

11262

+ return p < 0 && a < - __INT_MAX__ - 1 - p ? 0 : 1;

11263

+}

11264

+

11265

+int *bar ()

11266

+{

11267

+ int j;

11268

+ i = h ? 0 : 1 % h;

11269

+ for (j = 0; j < 1; j++)

11270

+ for (d = 0; d; d++)

11271

+ for (e = 1; e;)

11272

+ return 0;

11273

+ return 0;

11274

+}

11275

+

11276

+int baz ()

11277

+{

11278

+ for (; b >= 0; b--)

11279

+ for (c = 1; c >= 0; c--)

11280

+ {

11281

+ int *k = &c;

11282

+ for (;;)

11283

+ {

11284

+ for (f = 0; f < 1; f++)

11285

+ {

11286

+ g = foo (*k);

11287

+ bar ();

11288

+ }

11289

+ if (*k)

11290

+ break;

11291

+ return 0;

11292

+ }

11293

+ }

11294

+ return 0;

11295

+}

11296

+

11297

+int main ()

11298

+{

11299

+ baz ();

11300

+ if (b != 0)

11301

+ abort ();

11302

+ return 0;

11303

+}

11304

Index: gcc/testsuite/gcc.dg/torture/pr58143-2.c

11305

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

11306

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-2.c (.../tags/gcc_4_8_2_release)

11307

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-2.c (.../branches/gcc-4_8-branch)

11308

@@ -0,0 +1,34 @@

11309

+/* { dg-do run } */

11310

+/* { dg-additional-options "-fstrict-overflow" } */

11311

+

11312

+int a, b, d, e, f, *g, h, i;

11313

+volatile int c;

11314

+

11315

+char foo (unsigned char p)

11316

+{

11317

+ return p + 1;

11318

+}

11319

+

11320

+int bar ()

11321

+{

11322

+ for (h = 0; h < 3; h = foo (h))

11323

+ {

11324

+ c;

11325

+ for (f = 0; f < 1; f++)

11326

+ {

11327

+ i = a && 0 < -__INT_MAX__ - h ? 0 : 1;

11328

+ if (e)

11329

+ for (; d;)

11330

+ b = 0;

11331

+ else

11332

+ g = 0;

11333

+ }

11334

+ }

11335

+ return 0;

11336

+}

11337

+

11338

+int main ()

11339

+{

11340

+ bar ();

11341

+ return 0;

11342

+}

11343

Index: gcc/testsuite/gcc.dg/torture/pr58941.c

11344

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

11345

--- a/src/gcc/testsuite/gcc.dg/torture/pr58941.c (.../tags/gcc_4_8_2_release)

11346

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58941.c (.../branches/gcc-4_8-branch)

11347

@@ -0,0 +1,33 @@

11348

+/* { dg-do run } */

11349

+

11350

+extern void abort (void);

11351

+

11352

+typedef struct {

11353

+ int msgLength;

11354

+ unsigned char data[1000];

11355

+} SMsg;

11356

+

11357

+typedef struct {

11358

+ int dummy;

11359

+ int d[0];

11360

+} SData;

11361

+

11362

+int condition = 3;

11363

+

11364

+int main()

11365

+{

11366

+ SMsg msg;

11367

+ SData *pData = (SData*)(msg.data);

11368

+ unsigned int i = 0;

11369

+ for (i = 0; i < 1; i++)

11370

+ {

11371

+ pData->d[i] = 0;

11372

+ if(condition & 1)

11373

+ pData->d[i] |= 0x55;

11374

+ if(condition & 2)

11375

+ pData->d[i] |= 0xaa;

11376

+ }

11377

+ if (pData->d[0] != 0xff)

11378

+ abort ();

11379

+ return 0;

11380

+}

11381

Index: gcc/testsuite/gcc.dg/torture/pr57488.c

11382

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

11383

--- a/src/gcc/testsuite/gcc.dg/torture/pr57488.c (.../tags/gcc_4_8_2_release)

11384

+++ b/src/gcc/testsuite/gcc.dg/torture/pr57488.c (.../branches/gcc-4_8-branch)

11385

@@ -0,0 +1,58 @@

11386

+/* { dg-do run } */

11387

+

11388

+extern void abort (void);

11389

+

11390

+int i, j, *pj = &j, **ppj = &pj;

11391

+int x, *px = &x;

11392

+

11393

+short s, *ps = &s, k;

11394

+

11395

+unsigned short u, *pu = &u, **ppu = &pu;

11396

+

11397

+char c, *pc = &c;

11398

+

11399

+unsigned char v = 48;

11400

+

11401

+static int

11402

+bar (int p)

11403

+{

11404

+ p = k;

11405

+ *px = **ppu = i;

11406

+ *ppj = &p;

11407

+ if (**ppj)

11408

+ *pj = p;

11409

+ return p;

11410

+}

11411

+

11412

+void __attribute__((noinline))

11413

+foo ()

11414

+{

11415

+ for (; i <= 3; i++)

11416

+ for (; j; j--);

11417

+

11418

+ u ^= bar (*pj);

11419

+

11420

+ for (k = 1; k >= 0; k--)

11421

+ {

11422

+ int l;

11423

+ bar (0);

11424

+ for (l = 1; l < 5; l++)

11425

+ {

11426

+ int m;

11427

+ for (m = 6; m; m--)

11428

+ {

11429

+ v--;

11430

+ *ps = *pc;

11431

+ }

11432

+ }

11433

+ }

11434

+}

11435

+

11436

+int

11437

+main ()

11438

+{

11439

+ foo ();

11440

+ if (v != 0)

11441

+ abort ();

11442

+ return 0;

11443

+}

11444

Index: gcc/testsuite/gcc.dg/torture/pr58143-3.c

11445

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

11446

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-3.c (.../tags/gcc_4_8_2_release)

11447

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-3.c (.../branches/gcc-4_8-branch)

11448

@@ -0,0 +1,18 @@

11449

+/* { dg-do run } */

11450

+/* { dg-additional-options "-fstrict-overflow" } */

11451

+

11452

+int a, b, c, d, e;

11453

+

11454

+int

11455

+main ()

11456

+{

11457

+ for (b = 4; b > -30; b--)

11458

+ for (; c;)

11459

+ for (;;)

11460

+ {

11461

+ e = a > __INT_MAX__ - b;

11462

+ if (d)

11463

+ break;

11464

+ }

11465

+ return 0;

11466

+}

11467

Index: gcc/testsuite/gcc.dg/torture/pr59288.c

11468

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

11469

--- a/src/gcc/testsuite/gcc.dg/torture/pr59288.c (.../tags/gcc_4_8_2_release)

11470

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59288.c (.../branches/gcc-4_8-branch)

11471

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

11472

+/* { dg-do compile } */

11473

+

11474

+void

11475

+baz (int *d)

11476

+{

11477

+ long int i, j, k;

11478

+ for (i = 0, j = 0, k = 0; i < 512; i = (int) i + 1, j = (int) j + 1, k = (int) k + 3)

11479

+ d[i] = j ^ (i * 3) ^ (2 * k + 2);

11480

+}

11481

Index: gcc/testsuite/gcc.dg/torture/pr59330.c

11482

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

11483

--- a/src/gcc/testsuite/gcc.dg/torture/pr59330.c (.../tags/gcc_4_8_2_release)

11484

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59330.c (.../branches/gcc-4_8-branch)

11485

@@ -0,0 +1,17 @@

11486

+/* { dg-do run } */

11487

+

11488

+void free(void *ptr)

11489

+{

11490

+}

11491

+

11492

+void *foo(void)

11493

+{

11494

+ return 0;

11495

+}

11496

+

11497

+int main(void)

11498

+{

11499

+ void *p = foo();

11500

+ free(p);

11501

+ return 0;

11502

+}

11503

Index: gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c

11504

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

11505

--- a/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c (.../tags/gcc_4_8_2_release)

11506

+++ b/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c (.../branches/gcc-4_8-branch)

11507

@@ -0,0 +1,14 @@

11508

+/* { dg-do run } */

11509

+/* { dg-options "-O3" } */

11510

+

11511

+int a, c, e[5][2];

11512

+unsigned int d;

11513

+

11514

+int

11515

+main ()

11516

+{

11517

+ for (d = 0; d < 2; d++)

11518

+ if (a ? 0 : e[c + 3][d] & e[c + 4][d])

11519

+ break;

11520

+ return 0;

11521

+}

11522

Index: gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c

11523

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

11524

--- a/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c (.../tags/gcc_4_8_2_release)

11525

+++ b/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c (.../branches/gcc-4_8-branch)

11526

@@ -0,0 +1,18 @@

11527

+/* { dg-do run } */

11528

+/* { dg-options "-O3 -fdump-tree-pcom-details" } */

11529

+

11530

+int b, f, d[5][2];

11531

+unsigned int c;

11532

+

11533

+int

11534

+main ()

11535

+{

11536

+ for (c = 0; c < 2; c++)

11537

+ if (d[b + 3][c] & d[b + 4][c])

11538

+ if (f)

11539

+ break;

11540

+ return 0;

11541

+}

11542

+

11543

+/* { dg-final { scan-tree-dump "Executing predictive commoning" "pcom" } } */

11544

+/* { dg-final { cleanup-tree-dump "pcom" } } */

11545

Index: gcc/testsuite/gcc.dg/ipa/pr59610.c

11546

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

11547

--- a/src/gcc/testsuite/gcc.dg/ipa/pr59610.c (.../tags/gcc_4_8_2_release)

11548

+++ b/src/gcc/testsuite/gcc.dg/ipa/pr59610.c (.../branches/gcc-4_8-branch)

11549

@@ -0,0 +1,11 @@

11550

+/* { dg-do compile } */

11551

+/* { dg-options "-O2" } */

11552

+

11553

+struct A { int a; };

11554

+extern void *y;

11555

+

11556

+__attribute__((optimize (0))) void

11557

+foo (void *p, struct A x)

11558

+{

11559

+ foo (y, x);

11560

+}

11561

Index: gcc/testsuite/gcc.dg/strlenopt-1f.c

11562

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

11563

--- a/src/gcc/testsuite/gcc.dg/strlenopt-1f.c (.../tags/gcc_4_8_2_release)

11564

+++ b/src/gcc/testsuite/gcc.dg/strlenopt-1f.c (.../branches/gcc-4_8-branch)

11565

@@ -6,13 +6,13 @@

11566

#include "strlenopt-1.c"

11567

11568

/* { dg-final { scan-tree-dump-times "strlen \\(" 2 "strlen" } } */

11569

-/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 3 "strlen" } } */

11570

-/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 1 "strlen" } } */

11571

+/* { dg-final { scan-tree-dump-times "__memcpy_chk \\(" 0 "strlen" } } */

11572

+/* { dg-final { scan-tree-dump-times "__strcpy_chk \\(" 0 "strlen" } } */

11573

/* { dg-final { scan-tree-dump-times "__strcat_chk \\(" 0 "strlen" } } */

11574

/* { dg-final { scan-tree-dump-times "strchr \\(" 0 "strlen" } } */

11575

/* { dg-final { scan-tree-dump-times "__stpcpy_chk \\(" 0 "strlen" } } */

11576

-/* { dg-final { scan-tree-dump-times "memcpy \\(" 0 "strlen" } } */

11577

-/* { dg-final { scan-tree-dump-times "strcpy \\(" 0 "strlen" } } */

11578

+/* { dg-final { scan-tree-dump-times "memcpy \\(" 3 "strlen" } } */

11579

+/* { dg-final { scan-tree-dump-times "strcpy \\(" 1 "strlen" } } */

11580

/* { dg-final { scan-tree-dump-times "strcat \\(" 0 "strlen" } } */

11581

/* { dg-final { scan-tree-dump-times "stpcpy \\(" 0 "strlen" } } */

11582

/* { dg-final { cleanup-tree-dump "strlen" } } */

11583

Index: gcc/testsuite/ChangeLog

11584

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

11585

--- a/src/gcc/testsuite/ChangeLog (.../tags/gcc_4_8_2_release)

11586

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

11587

@@ -1,3 +1,596 @@

11588

+2014-01-10 Richard Biener <rguenther@suse.de>

11589

+

11590

+ PR tree-optimization/59715

11591

+ * gcc.dg/torture/pr59715.c: New testcase.

11592

+

11593

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

11594

+

11595

+ * gcc.target/mips/bswap-1.c, gcc.target/mips/bswap-2.c,

11596

+ gcc.target/mips/bswap-3.c, gcc.target/mips/bswap-4.c,

11597

+ gcc.target/mips/bswap-5.c, gcc.target/mips/bswap-6.c: New tests.

11598

+

11599

+2014-01-09 Richard Sandiford <rdsandiford@googlemail.com>

11600

+

11601

+ PR rtl-optimization/59137

11602

+ * gcc.target/mips/pr59137.c: New test.

11603

+

11604

+2014-01-09 Richard Biener <rguenther@suse.de>

11605

+

11606

+ Backport from mainline

11607

+ 2013-11-18 Richard Biener <rguenther@suse.de>

11608

+

11609

+ PR tree-optimization/59125

11610

+ PR tree-optimization/54570

11611

+ * gcc.dg/builtin-object-size-8.c: Un-xfail.

11612

+ * gcc.dg/builtin-object-size-14.c: New testcase.

11613

+ * gcc.dg/strlenopt-14gf.c: Adjust.

11614

+ * gcc.dg/strlenopt-1f.c: Likewise.

11615

+ * gcc.dg/strlenopt-4gf.c: Likewise.

11616

+

11617

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

11618

+

11619

+ PR tree-optimization/59362

11620

+ * gcc.c-torture/compile/pr59362.c: New test.

11621

+

11622

+2014-01-09 Richard Earnshaw <rearnsha@arm.com>

11623

+

11624

+ PR rtl-optimization/54300

11625

+ * gcc.target/arm/pr54300.C: New test.

11626

+

11627

+2014-01-08 Martin Jambor <mjambor@suse.cz>

11628

+

11629

+ PR ipa/59610

11630

+ * gcc.dg/ipa/pr59610.c: New test.

11631

+

11632

+2014-01-07 Jakub Jelinek <jakub@redhat.com>

11633

+

11634

+ PR rtl-optimization/58668

11635

+ * gcc.dg/pr58668.c: New test.

11636

+

11637

+ Backported from mainline

11638

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

11639

+

11640

+ PR middle-end/58956

11641

+ PR middle-end/59470

11642

+ * gcc.target/i386/pr59470.c: New test.

11643

+

11644

+2014-01-04 Janus Weil <janus@gcc.gnu.org>

11645

+

11646

+ Backport from mainline

11647

+ 2014-01-02 Janus Weil <janus@gcc.gnu.org>

11648

+

11649

+ PR fortran/59654

11650

+ * gfortran.dg/dynamic_dispatch_12.f90: New.

11651

+

11652

+2014-01-03 Joseph Myers <joseph@codesourcery.com>

11653

+

11654

+ * gcc.target/powerpc/rs6000-ldouble-3.c: New test.

11655

+

11656

+2014-01-03 Jakub Jelinek <jakub@redhat.com>

11657

+

11658

+ PR target/59625

11659

+ * gcc.target/i386/pr59625.c: New test.

11660

+

11661

+2014-01-01 Jakub Jelinek <jakub@redhat.com>

11662

+

11663

+ PR rtl-optimization/59647

11664

+ * g++.dg/opt/pr59647.C: New test.

11665

+

11666

+2013-12-31 Janus Weil <janus@gcc.gnu.org>

11667

+

11668

+ Backport from mainline

11669

+ 2013-12-30 Janus Weil <janus@gcc.gnu.org>

11670

+

11671

+ PR fortran/58998

11672

+ * gfortran.dg/generic_28.f90: New.

11673

+

11674

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

11675

+

11676

+ PR c++/59255

11677

+ * g++.dg/tree-prof/pr59255.C: New test.

11678

+

11679

+2013-12-19 James Greenhalgh <james.greenhalgh@arm.com>

11680

+

11681

+ Backport from Mainline

11682

+ 2013-05-01 James Greenhalgh <james.greenhalgh@arm.com>

11683

+

11684

+ * gcc.target/aarch64/scalar_intrinsics.c (force_simd): New.

11685

+ (test_vceqd_s64): Force arguments to SIMD registers.

11686

+ (test_vceqzd_s64): Likewise.

11687

+ (test_vcged_s64): Likewise.

11688

+ (test_vcled_s64): Likewise.

11689

+ (test_vcgezd_s64): Likewise.

11690

+ (test_vcged_u64): Likewise.

11691

+ (test_vcgtd_s64): Likewise.

11692

+ (test_vcltd_s64): Likewise.

11693

+ (test_vcgtzd_s64): Likewise.

11694

+ (test_vcgtd_u64): Likewise.

11695

+ (test_vclezd_s64): Likewise.

11696

+ (test_vcltzd_s64): Likewise.

11697

+ (test_vtst_s64): Likewise.

11698

+ (test_vtst_u64): Likewise.

11699

+

11700

+2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

11701

+ Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

11702

+

11703

+ Backport from mainline

11704

+ 2013-12-19 Dominik Vogt <vogt@linux.vnet.ibm.com>

11705

+ * gcc/testsuite/gcc.target/s390/hotpatch-1.c: New test

11706

+ * gcc/testsuite/gcc.target/s390/hotpatch-2.c: New test

11707

+ * gcc/testsuite/gcc.target/s390/hotpatch-3.c: New test

11708

+ * gcc/testsuite/gcc.target/s390/hotpatch-4.c: New test

11709

+ * gcc/testsuite/gcc.target/s390/hotpatch-5.c: New test

11710

+ * gcc/testsuite/gcc.target/s390/hotpatch-6.c: New test

11711

+ * gcc/testsuite/gcc.target/s390/hotpatch-7.c: New test

11712

+ * gcc/testsuite/gcc.target/s390/hotpatch-8.c: New test

11713

+ * gcc/testsuite/gcc.target/s390/hotpatch-9.c: New test

11714

+ * gcc/testsuite/gcc.target/s390/hotpatch-10.c: New test

11715

+ * gcc/testsuite/gcc.target/s390/hotpatch-11.c: New test

11716

+ * gcc/testsuite/gcc.target/s390/hotpatch-12.c: New test

11717

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-1.c: New test

11718

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-2.c: New test

11719

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-3.c: New test

11720

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-4.c: New test

11721

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-5.c: New test

11722

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-6.c: New test

11723

+ * gcc/testsuite/gcc.target/s390/hotpatch-compile-7.c: New test

11724

+

11725

+2013-12-18 Janus Weil <janus@gcc.gnu.org>

11726

+

11727

+ Backport from mainline

11728

+ 2013-12-15 Janus Weil <janus@gcc.gnu.org>

11729

+

11730

+ PR fortran/59493

11731

+ * gfortran.dg/unlimited_polymorphic_15.f90: New.

11732

+

11733

+2013-12-15 Uros Bizjak <ubizjak@gmail.com>

11734

+

11735

+ PR testsuite/58630

11736

+ * gcc.target/i386/pr43662.c (dg-options):

11737

+ Add -maccumulate-outgoing-args.

11738

+ * gcc.target/i386/pr43869.c (dg-options): Ditto.

11739

+ * gcc.target/i386/pr57003.c (dg-options): Ditto.

11740

+ * gcc.target/i386/avx-vzeroupper-16.c (dg-options):

11741

+ Remove -mtune=generic and add -maccumulate-outgoing-args instead.

11742

+ * gcc.target/i386/avx-vzeroupper-17.c (dg-options): Ditto.

11743

+ * gcc.target/i386/avx-vzeroupper-18.c (dg-options): Ditto.

11744

+ * gcc.target/x86_64/abi/callabi/func-1.c (dg-options):

11745

+ Add -maccumulate-outgoing-args.

11746

+ * gcc.target/x86_64/abi/callabi/func-2a.c (dg-options): Ditto.

11747

+ * gcc.target/x86_64/abi/callabi/func-2b.c (dg-options): Ditto.

11748

+ * gcc.target/x86_64/abi/callabi/func-indirect.c (dg-options): Ditto.

11749

+ * gcc.target/x86_64/abi/callabi/func-indirect-2a.c (dg-options): Ditto.

11750

+ * gcc.target/x86_64/abi/callabi/func-indirect-2b.c (dg-options): Ditto.

11751

+ * gcc.target/x86_64/abi/callabi/leaf-1.c (dg-options): Ditto.

11752

+ * gcc.target/x86_64/abi/callabi/leaf-2.c (dg-options): Ditto.

11753

+ * gcc.target/x86_64/abi/callabi/pr38891.c (dg-options): Ditto.

11754

+ * gcc.target/x86_64/abi/callabi/vaarg-1.c (dg-options): Ditto.

11755

+ * gcc.target/x86_64/abi/callabi/vaarg-2.c (dg-options): Ditto.

11756

+ * gcc.target/x86_64/abi/callabi/vaarg-3.c (dg-options): Ditto.

11757

+ * gcc.target/x86_64/abi/callabi/vaarg-4a.c (dg-options): Ditto.

11758

+ * gcc.target/x86_64/abi/callabi/vaarg-4b.c (dg-options): Ditto.

11759

+ * gcc.target/x86_64/abi/callabi/vaarg-5a.c (dg-options): Ditto.

11760

+ * gcc.target/x86_64/abi/callabi/vaarg-5b.c (dg-options): Ditto.

11761

+

11762

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

11763

+

11764

+ PR middle-end/59470

11765

+ * g++.dg/opt/pr59470.C: New test.

11766

+

11767

+ PR libgomp/59467

11768

+ * gfortran.dg/gomp/pr59467.f90: New test.

11769

+ * c-c++-common/gomp/pr59467.c: New test.

11770

+

11771

+2013-12-12 Uros Bizjak <ubizjak@gmail.com>

11772

+

11773

+ Backport from mainline

11774

+ 2013-12-12 Ryan Mansfield <rmansfield@qnx.com>

11775

+

11776

+ PR testsuite/59442

11777

+ * gcc.target/i386/sse2-movapd-1.c: Fix alignment attributes.

11778

+ * gcc.target/i386/sse2-movapd-2.c: Likewise.

11779

+ * gcc.target/i386/avx-vmovapd-256-1.c: Likewise.

11780

+ * gcc.target/i386/avx-vmovapd-256-2.c: Likewise.

11781

+

11782

+2013-12-08 Uros Bizjak <ubizjak@gmail.com>

11783

+

11784

+ Backport from mainline

11785

+ 2013-12-06 Uros Bizjak <ubizjak@gmail.com>

11786

+

11787

+ PR target/59405

11788

+ * gcc.target/i386/pr59405.c: New test.

11789

+

11790

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

11791

+

11792

+ PR tree-optimization/59388

11793

+ * gcc.c-torture/execute/pr59388.c: New test.

11794

+

11795

+2013-12-06 Richard Biener <rguenther@suse.de>

11796

+

11797

+ Backport from mainline

11798

+ 2013-11-28 Richard Biener <rguenther@suse.de>

11799

+

11800

+ PR tree-optimization/59330

11801

+ * gcc.dg/torture/pr59330.c: New testcase.

11802

+

11803

+2013-12-06 Richard Biener <rguenther@suse.de>

11804

+

11805

+ Backport from mainline

11806

+ 2013-11-27 Richard Biener <rguenther@suse.de>

11807

+

11808

+ PR tree-optimization/59288

11809

+ * gcc.dg/torture/pr59288.c: New testcase.

11810

+

11811

+ 2013-11-19 Richard Biener <rguenther@suse.de>

11812

+

11813

+ PR tree-optimization/59164

11814

+ * gcc.dg/torture/pr59164.c: New testcase.

11815

+

11816

+ 2013-09-05 Richard Biener <rguenther@suse.de>

11817

+

11818

+ PR tree-optimization/58137

11819

+ * gcc.target/i386/pr58137.c: New testcase.

11820

+

11821

+2013-12-06 Oleg Endo <olegendo@gcc.gnu.org>

11822

+

11823

+ PR target/51244

11824

+ PR target/59343

11825

+ * gcc.target/sh/pr51244-19.c: Adjust test case.

11826

+

11827

+2013-12-05 Richard Biener <rguenther@suse.de>

11828

+

11829

+ Backport from mainline

11830

+ 2013-11-19 Richard Biener <rguenther@suse.de>

11831

+

11832

+ PR middle-end/58956

11833

+ * gcc.dg/torture/pr58956.c: New testcase.

11834

+

11835

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

11836

+

11837

+ PR c++/59268

11838

+ * g++.dg/cpp0x/constexpr-template6.C: New test.

11839

+

11840

+ PR rtl-optimization/58726

11841

+ * gcc.c-torture/execute/pr58726.c: New test.

11842

+

11843

+ PR target/59163

11844

+ * g++.dg/torture/pr59163.C: New test.

11845

+

11846

+2013-12-03 Marek Polacek <polacek@redhat.com>

11847

+

11848

+ Backport from mainline

11849

+ 2013-12-03 Marek Polacek <polacek@redhat.com>

11850

+

11851

+ PR c/59351

11852

+ * gcc.dg/pr59351.c: New test.

11853

+

11854

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

11855

+

11856

+ PR middle-end/59011

11857

+ * gcc.dg/pr59011.c: New test.

11858

+

11859

+ PR target/58864

11860

+ * g++.dg/opt/pr58864.C: New test.

11861

+

11862

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

11863

+

11864

+ PR tree-optimization/59358

11865

+ * gcc.c-torture/execute/pr59358.c: New test.

11866

+

11867

+2013-12-02 Richard Biener <rguenther@suse.de>

11868

+

11869

+ PR tree-optimization/59139

11870

+ * gcc.dg/torture/pr59139.c: New testcase.

11871

+

11872

+2013-11-27 Tom de Vries <tom@codesourcery.com>

11873

+ Marc Glisse <marc.glisse@inria.fr>

11874

+

11875

+ PR c++/59032

11876

+ * c-c++-common/pr59032.c: New testcase.

11877

+

11878

+2013-11-27 Tom de Vries <tom@codesourcery.com>

11879

+ Marc Glisse <marc.glisse@inria.fr>

11880

+

11881

+ PR middle-end/59037

11882

+ * c-c++-common/pr59037.c: New testcase.

11883

+

11884

+2013-11-30 Paul Thomas <pault@gcc.gnu.org>

11885

+

11886

+ Backport from mainline

11887

+ 2013-11-04 Paul Thomas <pault@gcc.gnu.org>

11888

+

11889

+ PR fortran/57445

11890

+ * gfortran.dg/optional_class_1.f90 : New test

11891

+

11892

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

11893

+

11894

+ PR c/59280

11895

+ * c-c++-common/pr59280.c: New test.

11896

+

11897

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

11898

+

11899

+ PR c++/59297

11900

+ * g++.dg/gomp/pr59297.C: New test.

11901

+

11902

+2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

11903

+

11904

+ Backport from mainline

11905

+ 2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

11906

+

11907

+ * gcc.target/arm/vrinta-ce.c: New testcase.

11908

+

11909

+2013-11-28 Uros Bizjak <ubizjak@gmail.com>

11910

+

11911

+ Backport from mainline

11912

+ 2013-11-23 Uros Bizjak <ubizjak@gmail.com>

11913

+

11914

+ PR target/56788

11915

+ * config/i386/i386.c (bdesc_multi_arg) <IX86_BUILTIN_VFRCZSS>:

11916

+ Declare as MULTI_ARG_1_SF instruction.

11917

+ <IX86_BUILTIN_VFRCZSD>: Decleare as MULTI_ARG_1_DF instruction.

11918

+ * config/i386/sse.md (*xop_vmfrcz<mode>2): Rename

11919

+ from *xop_vmfrcz_<mode>.

11920

+ * config/i386/xopintrin.h (_mm_frcz_ss): Use __builtin_ia32_movss

11921

+ to merge scalar result with __A.

11922

+ (_mm_frcz_sd): Use __builtin_ia32_movsd to merge scalar

11923

+ result with __A.

11924

+

11925

+2013-11-28 Terry Guo <terry.guo@arm.com>

11926

+

11927

+ Backport mainline r205391

11928

+ 2013-11-26 Terry Guo <terry.guo@arm.com>

11929

+

11930

+ * gcc.target/arm/thumb1-pic-high-reg.c: New case.

11931

+ * gcc.target/arm/thumb1-pic-single-base.c: New case.

11932

+

11933

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

11934

+

11935

+ Backported from mainline

11936

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

11937

+

11938

+ PR tree-optimization/59014

11939

+ * gcc.c-torture/execute/pr59014-2.c: New test.

11940

+

11941

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

11942

+

11943

+ PR tree-optimization/59014

11944

+ * gcc.c-torture/execute/pr59014.c: New test.

11945

+

11946

+2013-11-27 Eric Botcazou <ebotcazou@adacore.com>

11947

+

11948

+ * gcc.c-torture/execute/20131127-1.c: New test.

11949

+

11950

+2013-11-25 Vidya Praveen <vidyapraveen@arm.com>

11951

+

11952

+ Backport from mainline

11953

+ 2013-10-21 Vidya Praveen <vidyapraveen@arm.com>

11954

+

11955

+ * gcc.dg/20050922-1.c: Remove stdlib.h and declare abort().

11956

+ * gcc.dg/20050922-1.c: Remove stdlib.h and declare abort() and exit().

11957

+

11958

+2013-11-20 Dominik Vogt <vogt@linux.vnet.ibm.com>

11959

+

11960

+ Backport from mainline

11961

+ * gcc.target/s390/htm-1.c: Rename to ...

11962

+ * gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c: ... this

11963

+ one.

11964

+ * gcc.target/s390/htm-xl-intrin-1.c: Rename to ...

11965

+ * gcc.target/s390/htm-builtins-compile-3.c: ... this one.

11966

+ * gcc.target/s390/htm-builtins-compile-2.c: New testcase.

11967

+ * gcc.target/s390/htm-builtins-1.c: New testcase.

11968

+ * gcc.target/s390/htm-builtins-2.c: New testcase.

11969

+ * gcc.target/s390/s390.exp: Add check for htm machine.

11970

+

11971

+2013-11-19 Richard Biener <rguenther@suse.de>

11972

+

11973

+ PR tree-optimization/57517

11974

+ * gfortran.fortran-torture/compile/pr57517.f90: New testcase.

11975

+ * gcc.dg/torture/pr57517.c: Likewise.

11976

+

11977

+2013-11-19 Richard Biener <rguenther@suse.de>

11978

+

11979

+ Backport from mainline

11980

+ 2013-11-05 Richard Biener <rguenther@suse.de>

11981

+

11982

+ PR middle-end/58941

11983

+ * gcc.dg/torture/pr58941.c: New testcase.

11984

+

11985

+2013-11-18 Richard Biener <rguenther@suse.de>

11986

+

11987

+ Backport from mainline

11988

+ 2013-10-21 Richard Biener <rguenther@suse.de>

11989

+

11990

+ PR tree-optimization/58794

11991

+ * c-c++-common/torture/pr58794-1.c: New testcase.

11992

+ * c-c++-common/torture/pr58794-2.c: Likewise.

11993

+

11994

+ 2013-10-21 Richard Biener <rguenther@suse.de>

11995

+

11996

+ PR middle-end/58742

11997

+ * c-c++-common/fold-divmul-1.c: New testcase.

11998

+

11999

+ 2013-11-06 Richard Biener <rguenther@suse.de>

12000

+

12001

+ PR tree-optimization/58653

12002

+ * gcc.dg/tree-ssa/predcom-6.c: New testcase.

12003

+ * gcc.dg/tree-ssa/predcom-7.c: Likewise.

12004

+

12005

+ PR tree-optimization/59047

12006

+ * gcc.dg/torture/pr59047.c: New testcase.

12007

+

12008

+ 2013-10-15 Richard Biener <rguenther@suse.de>

12009

+

12010

+ PR tree-optimization/58143

12011

+ * gcc.dg/torture/pr58143-1.c: New testcase.

12012

+ * gcc.dg/torture/pr58143-2.c: Likewise.

12013

+ * gcc.dg/torture/pr58143-3.c: Likewise.

12014

+

12015

+2013-11-17 Janus Weil <janus@gcc.gnu.org>

12016

+

12017

+ Backport from mainline

12018

+ 2013-11-07 Janus Weil <janus@gcc.gnu.org>

12019

+

12020

+ PR fortran/58471

12021

+ * gfortran.dg/constructor_9.f90: New.

12022

+

12023

+2013-11-16 Janus Weil <janus@gcc.gnu.org>

12024

+

12025

+ Backport from mainline

12026

+ 2013-09-20 Janus Weil <janus@gcc.gnu.org>

12027

+

12028

+ PR fortran/58099

12029

+ * gfortran.dg/proc_ptr_43.f90: New.

12030

+

12031

+2013-11-16 Paul Thomas <pault@gcc.gnu.org>

12032

+

12033

+ PR fortran/58771

12034

+ * gfortran.dg/derived_external_function_1.f90 : New test

12035

+

12036

+2013-11-14 Uros Bizjak <ubizjak@gmail.com>

12037

+

12038

+ Backport from mainline

12039

+ 2013-11-06 Uros Bizjak <ubizjak@gmail.com>

12040

+

12041

+ PR target/59021

12042

+ * gcc.target/i386/pr59021.c: New test.

12043

+

12044

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

12045

+

12046

+ PR target/59101

12047

+ * gcc.c-torture/execute/pr59101.c: New test.

12048

+

12049

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

12050

+

12051

+ Backported from mainline

12052

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

12053

+

12054

+ PR middle-end/58970

12055

+ * gcc.c-torture/compile/pr58970-1.c: New test.

12056

+ * gcc.c-torture/compile/pr58970-2.c: New test.

12057

+

12058

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

12059

+

12060

+ PR rtl-optimization/58997

12061

+ * gcc.c-torture/compile/pr58997.c: New test.

12062

+

12063

+2013-11-10 Wei Mi <wmi@google.com>

12064

+

12065

+ * gcc.dg/pr57518.c: Backport regex fix from r200720.

12066

+

12067

+2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

12068

+

12069

+ Backport from mainline

12070

+ 2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

12071

+

12072

+ PR target/59034

12073

+ * gcc.target/i386/pr59034-1.c: New test.

12074

+ * gcc.target/i386/pr59034-2.c: Likewise.

12075

+

12076

+2013-11-06 Wei Mi <wmi@google.com>

12077

+

12078

+ PR regression/58985

12079

+ * gcc.dg/pr57518.c: Add subreg in regexp pattern.

12080

+

12081

+2013-11-05 Steven G. Kargl <kargl@gcc.gnu.org>

12082

+

12083

+ PR fortran/58989

12084

+ * gfortran.dg/reshape_6.f90: New test.

12085

+

12086

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

12087

+

12088

+ PR tree-optimization/58984

12089

+ * gcc.c-torture/execute/pr58984.c: New test.

12090

+

12091

+2013-11-04 Marek Polacek <polacek@redhat.com>

12092

+

12093

+ Backport from mainline

12094

+ 2013-11-04 Marek Polacek <polacek@redhat.com>

12095

+

12096

+ PR c++/58979

12097

+ * g++.dg/diagnostic/pr58979.C: New test.

12098

+

12099

+2013-11-03 H.J. Lu <hongjiu.lu@intel.com>

12100

+

12101

+ Backport from mainline

12102

+ 2013-10-12 H.J. Lu <hongjiu.lu@intel.com>

12103

+

12104

+ PR target/58690

12105

+ * gcc.target/i386/pr58690.c: New test

12106

+

12107

+2013-11-02 Janus Weil <janus@gcc.gnu.org>

12108

+

12109

+ Backport from mainline

12110

+ 2013-09-23 Janus Weil <janus@gcc.gnu.org>

12111

+

12112

+ PR fortran/58355

12113

+ * gfortran.dg/extends_15.f90: New.

12114

+

12115

+2013-10-29 Uros Bizjak <ubizjak@gmail.com>

12116

+

12117

+ Backport from mainline

12118

+ 2013-08-08 Richard Sandiford <rdsandiford@googlemail.com>

12119

+

12120

+ PR rtl-optimization/58079

12121

+ * gcc.dg/torture/pr58079.c: New test.

12122

+

12123

+2013-10-28 Tom de Vries <tom@codesourcery.com>

12124

+

12125

+ * gcc.target/arm/require-pic-register-loc.c: New test.

12126

+

12127

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

12128

+

12129

+ Backport from mainline

12130

+ 2013-10-22 Uros Bizjak <ubizjak@gmail.com>

12131

+

12132

+ PR target/58779

12133

+ * gcc.target/i386/pr30315.c: Remove MINUSCC, DECCC, MINUSCCONLY

12134

+ and MINUSCCZEXT defines. Update scan-assembler dg directive.

12135

+ * gcc.dg/torture/pr58779.c: New test.

12136

+

12137

+2013-10-25 Richard Henderson <rth@redhat.com>

12138

+

12139

+ PR rtl/58542

12140

+ * gcc.dg/atomic-store-6.c: New.

12141

+

12142

+2013-10-25 Tom de Vries <tom@codesourcery.com>

12143

+

12144

+ PR c++/58282

12145

+ * g++.dg/tm/noexcept-6.C: New test.

12146

+

12147

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

12148

+

12149

+ * gcc.c-torture/execute/pr58831.c: New test.

12150

+

12151

+2013-10-23 Tom de Vries <tom@codesourcery.com>

12152

+

12153

+ PR tree-optimization/58805

12154

+ * gcc.dg/pr58805.c: New test.

12155

+

12156

+2013-10-23 Richard Biener <rguenther@suse.de>

12157

+

12158

+ * gcc.dg/torture/pr58830.c: New testcase.

12159

+

12160

+ Backport from mainline

12161

+ 2013-06-24 Richard Biener <rguenther@suse.de>

12162

+

12163

+ PR tree-optimization/57488

12164

+ * gcc.dg/torture/pr57488.c: New testcase.

12165

+

12166

+2013-10-19 Oleg Endo <olegendo@gcc.gnu.org>

12167

+

12168

+ * gcc.target/sh/pr54089-3.c: Fix test for load of constant 31.

12169

+

12170

+2013-10-17 Paolo Carlini <paolo.carlini@oracle.com>

12171

+

12172

+ PR c++/58596

12173

+ * g++.dg/cpp0x/lambda/lambda-nsdmi5.C: New

12174

+

12175

+2013-10-16 Paolo Carlini <paolo.carlini@oracle.com>

12176

+

12177

+ PR c++/58633

12178

+ * g++.dg/cpp0x/decltype57.C: New.

12179

+ * g++.dg/cpp0x/enum18.C: Revert r174385 changes.

12180

+

12181

2013-10-16 Release Manager

12182

12183

* GCC 4.8.2 released.

12184

@@ -39,9 +632,9 @@

12185

Backport from mainline

12186

2013-06-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

12187

12188

- * gcc.target/s390/htm-1.c: New file.

12189

- * gcc.target/s390/htm-nofloat-1.c: New file.

12190

- * gcc.target/s390/htm-xl-intrin-1.c: New file.

12191

+ * gcc.target/s390/htm-1.c: New file.

12192

+ * gcc.target/s390/htm-nofloat-1.c: New file.

12193

+ * gcc.target/s390/htm-xl-intrin-1.c: New file.

12194

12195

2013-10-04 Tobias Burnus <burnus@net-b.de>

12196

12197

@@ -307,8 +900,8 @@

12198

Backport from mainline

12199

2013-08-12 Perez Read <netfirewall@gmail.com>

12200

12201

- PR target/58132

12202

- * gcc.target/i386/movabs-1.c: New test.

12203

+ PR target/58132

12204

+ * gcc.target/i386/movabs-1.c: New test.

12205

12206

2013-08-11 Janus Weil <janus@gcc.gnu.org>

12207

12208

@@ -494,7 +1087,7 @@

12209

2013-06-19 Wei Mi <wmi@google.com>

12210

12211

PR rtl-optimization/57518

12212

- * testsuite/gcc.dg/pr57518.c: New test.

12213

+ * gcc.dg/pr57518.c: New test.

12214

12215

2013-06-11 Tobias Burnus <burnus@net-b.de>

12216

12217

@@ -623,8 +1216,8 @@

12218

12219

2013-05-09 Martin Jambor <mjambor@suse.cz>

12220

12221

- PR middle-end/56988

12222

- * gcc.dg/ipa/pr56988.c: New test.

12223

+ PR middle-end/56988

12224

+ * gcc.dg/ipa/pr56988.c: New test.

12225

12226

2013-05-08 Marc Glisse <marc.glisse@inria.fr>

12227

12228

@@ -701,7 +1294,7 @@

12229

2013-04-25 Marek Polacek <polacek@redhat.com>

12230

12231

PR tree-optimization/57066

12232

- * gcc.dg/torture/builtin-logb-1.c: Adjust testcase.

12233

+ * gcc.dg/torture/builtin-logb-1.c: Adjust testcase.

12234

12235

2013-05-02 Jakub Jelinek <jakub@redhat.com>

12236

12237

@@ -727,32 +1320,32 @@

12238

Backport from mainline

12239

2013-04-24 Vladimir Makarov <vmakarov@redhat.com>

12240

12241

- PR rtl-optimizations/57046

12242

- * gcc.target/i386/pr57046.c: New test.

12243

+ PR rtl-optimizations/57046

12244

+ * gcc.target/i386/pr57046.c: New test.

12245

12246

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

12247

12248

Backport from mainline

12249

2013-04-22 Vladimir Makarov <vmakarov@redhat.com>

12250

12251

- PR target/57018

12252

- * gcc.target/i386/pr57018.c: New test.

12253

+ PR target/57018

12254

+ * gcc.target/i386/pr57018.c: New test.

12255

12256

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

12257

12258

Backport from mainline

12259

2013-04-18 Jakub Jelinek <jakub@redhat.com>

12260

12261

- PR rtl-optimization/56999

12262

- * g++.dg/opt/pr56999.C: New test.

12263

+ PR rtl-optimization/56999

12264

+ * g++.dg/opt/pr56999.C: New test.

12265

12266

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

12267

12268

Backport from mainline

12269

2013-04-19 Vladimir Makarov <vmakarov@redhat.com>

12270

12271

- PR rtl-optimization/56847

12272

- * gcc.dg/pr56847.c: New test.

12273

+ PR rtl-optimization/56847

12274

+ * gcc.dg/pr56847.c: New test.

12275

12276

2013-05-02 Ian Bolton <ian.bolton@arm.com>

12277

12278

@@ -1102,7 +1695,7 @@

12279

2013-03-29 Tobias Burnus <burnus@net-b.de>

12280

12281

PR fortran/56737

12282

- * testsuite/gfortran.dg/fmt_cache_3.f90: New.

12283

+ * gfortran.dg/fmt_cache_3.f90: New.

12284

12285

2013-04-02 Richard Biener <rguenther@suse.de>

12286

12287

@@ -1636,7 +2229,7 @@

12288

2013-02-20 Jan Hubicka <jh@suse.cz>

12289

12290

PR tree-optimization/56265

12291

- * testsuite/g++.dg/ipa/devirt-11.C: New testcase.

12292

+ * g++.dg/ipa/devirt-11.C: New testcase.

12293

12294

2013-02-20 Richard Biener <rguenther@suse.de>

12295

12296

@@ -1823,11 +2416,9 @@

12297

12298

Avoid instrumenting duplicated memory access in the same basic block

12299

* c-c++-common/asan/no-redundant-instrumentation-1.c: New test.

12300

- * testsuite/c-c++-common/asan/no-redundant-instrumentation-2.c:

12301

- Likewise.

12302

- * testsuite/c-c++-common/asan/no-redundant-instrumentation-3.c:

12303

- Likewise.

12304

- * testsuite/c-c++-common/asan/inc.c: Likewise.

12305

+ * c-c++-common/asan/no-redundant-instrumentation-2.c: Likewise.

12306

+ * c-c++-common/asan/no-redundant-instrumentation-3.c: Likewise.

12307

+ * c-c++-common/asan/inc.c: Likewise.

12308

12309

2013-02-12 Vladimir Makarov <vmakarov@redhat.com>

12310

12311

Index: gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90

12312

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

12313

--- a/src/gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90 (.../tags/gcc_4_8_2_release)

12314

+++ b/src/gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90 (.../branches/gcc-4_8-branch)

12315

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

12316

+SUBROUTINE cal_helicity (uh, ph, phb, wavg, ims, ime, its, ite)

12317

+ INTEGER, INTENT( IN ) :: ims, ime, its, ite

12318

+ REAL, DIMENSION( ims:ime), INTENT( IN ) :: ph, phb, wavg

12319

+ REAL, DIMENSION( ims:ime), INTENT( INOUT ) :: uh

12320

+ INTEGER :: i

12321

+ REAL :: zu

12322

+ DO i = its, ite

12323

+ zu = (ph(i ) + phb(i)) + (ph(i-1) + phb(i-1))

12324

+ IF (wavg(i) .GT. 0) THEN

12325

+ uh(i) = uh(i) + zu

12326

+ ENDIF

12327

+ END DO

12328

+END SUBROUTINE cal_helicity

12329

Index: gcc/testsuite/g++.dg/opt/pr59647.C

12330

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

12331

--- a/src/gcc/testsuite/g++.dg/opt/pr59647.C (.../tags/gcc_4_8_2_release)

12332

+++ b/src/gcc/testsuite/g++.dg/opt/pr59647.C (.../branches/gcc-4_8-branch)

12333

@@ -0,0 +1,32 @@

12334

+// PR rtl-optimization/59647

12335

+// { dg-do compile }

12336

+// { dg-options "-O2 -fno-tree-vrp" }

12337

+// { dg-additional-options "-msse2 -mfpmath=sse" { target { { i?86-*-* x86_64-*-* } && ia32 } } }

12338

+

12339

+void f1 (int);

12340

+void f2 ();

12341

+double f3 (int);

12342

+

12343

+struct A

12344

+{

12345

+ int f4 () const

12346

+ {

12347

+ if (a == 0)

12348

+ return 1;

12349

+ return 0;

12350

+ }

12351

+ unsigned f5 ()

12352

+ {

12353

+ if (!f4 ())

12354

+ f2 ();

12355

+ return a;

12356

+ }

12357

+ int a;

12358

+};

12359

+

12360

+void

12361

+f6 (A *x)

12362

+{

12363

+ unsigned b = x->f5 ();

12364

+ f1 (b - 1 - f3 (x->f5 () - 1U));

12365

+}

12366

Index: gcc/testsuite/g++.dg/opt/pr59470.C

12367

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

12368

--- a/src/gcc/testsuite/g++.dg/opt/pr59470.C (.../tags/gcc_4_8_2_release)

12369

+++ b/src/gcc/testsuite/g++.dg/opt/pr59470.C (.../branches/gcc-4_8-branch)

12370

@@ -0,0 +1,188 @@

12371

+// PR middle-end/59470

12372

+// { dg-do run }

12373

+// { dg-options "-O2 -fstack-protector" }

12374

+// { dg-additional-options "-fPIC" { target fpic } }

12375

+// { dg-require-effective-target fstack_protector }

12376

+

12377

+struct A

12378

+{

12379

+ int a1;

12380

+ A () throw () : a1 (0) {}

12381

+};

12382

+

12383

+struct B

12384

+{

12385

+ unsigned int b1 () throw ();

12386

+};

12387

+

12388

+__attribute__((noinline, noclone)) unsigned int

12389

+B::b1 () throw ()

12390

+{

12391

+ asm volatile ("" : : : "memory");

12392

+ return 0;

12393

+}

12394

+

12395

+struct C

12396

+{

12397

+ const A **c1;

12398

+ void c2 (const A *, unsigned int);

12399

+};

12400

+

12401

+__attribute__((noinline, noclone)) void

12402

+C::c2 (const A *, unsigned int)

12403

+{

12404

+ asm volatile ("" : : : "memory");

12405

+}

12406

+

12407

+struct D

12408

+{

12409

+ C *d1;

12410

+};

12411

+

12412

+struct E

12413

+{

12414

+ int e1;

12415

+ int e2;

12416

+ D e3;

12417

+};

12418

+

12419

+struct F

12420

+{

12421

+ virtual int f1 (const char * s, int n);

12422

+};

12423

+

12424

+struct G

12425

+{

12426

+ F *g1;

12427

+ bool g2;

12428

+ G & g3 (const char * ws, int len)

12429

+ {

12430

+ if (__builtin_expect (!g2, true)

12431

+ && __builtin_expect (this->g1->f1 (ws, len) != len, false))

12432

+ g2 = true;

12433

+ return *this;

12434

+ }

12435

+};

12436

+

12437

+struct H : public A

12438

+{

12439

+ const char *h1;

12440

+ unsigned int h2;

12441

+ bool h3;

12442

+ const char *h4;

12443

+ char h5;

12444

+ char h6;

12445

+ char h7[31];

12446

+ bool h8;

12447

+ H () : h1 (0), h2 (0), h4 (0), h5 (0), h6 (0), h8 (false) {}

12448

+ void h9 (const D &) __attribute__((noinline, noclone));

12449

+};

12450

+

12451

+void

12452

+H::h9 (const D &)

12453

+{

12454

+ h3 = true;

12455

+ __builtin_memset (h7, 0, sizeof (h7));

12456

+ asm volatile ("" : : : "memory");

12457

+};

12458

+

12459

+B b;

12460

+

12461

+inline const H *

12462

+foo (const D &x)

12463

+{

12464

+ const unsigned int i = b.b1 ();

12465

+ const A **j = x.d1->c1;

12466

+ if (!j[i])

12467

+ {

12468

+ H *k = 0;

12469

+ try

12470

+ {

12471

+ k = new H;

12472

+ k->h9 (x);

12473

+ }

12474

+ catch (...)

12475

+ {

12476

+ }

12477

+ x.d1->c2 (k, i);

12478

+ }

12479

+ return static_cast <const H *>(j[i]);

12480

+}

12481

+

12482

+__attribute__((noinline, noclone)) int

12483

+bar (char *x, unsigned long v, const char *y, int z, bool w)

12484

+{

12485

+ asm volatile ("" : : "r" (x), "r" (v), "r" (y) : "memory");

12486

+ asm volatile ("" : : "r" (z), "r" (w) : "memory");

12487

+ return 8;

12488

+}

12489

+

12490

+__attribute__((noinline, noclone)) void

12491

+baz (void *z, const char *g, unsigned int h, char s, E &e, char *n, char *c, int &l)

12492

+{

12493

+ asm volatile ("" : : "r" (z), "r" (g), "r" (h) : "memory");

12494

+ asm volatile ("" : : "r" (s), "r" (&e), "r" (n) : "memory");

12495

+ asm volatile ("" : : "r" (c), "r" (&l) : "memory");

12496

+ if (n == c)

12497

+ __builtin_abort ();

12498

+ int i = 0;

12499

+ asm ("" : "+r" (i));

12500

+ if (i == 0)

12501

+ __builtin_exit (0);

12502

+}

12503

+

12504

+__attribute__((noinline, noclone)) G

12505

+test (void *z, G s, E &x, char, long v)

12506

+{

12507

+ const D &d = x.e3;

12508

+ const H *h = foo (d);

12509

+ const char *q = h->h7;

12510

+ const int f = x.e2;

12511

+ const int i = 5 * sizeof (long);

12512

+ char *c = static_cast <char *>(__builtin_alloca (i));

12513

+ const int b = f & 74;

12514

+ const bool e = (b != 64 && b != 8);

12515

+ const unsigned long u = ((v > 0 || !e) ? (unsigned long) v : -(unsigned long) v);

12516

+ int l = bar (c + i, u, q, f, e);

12517

+ c += i - l;

12518

+ if (h->h3)

12519

+ {

12520

+ char *c2 = static_cast <char *>(__builtin_alloca ((l + 1) * 2));

12521

+ baz (z, h->h1, h->h2, h->h6, x, c2 + 2, c, l);

12522

+ c = c2 + 2;

12523

+ }

12524

+ if (__builtin_expect (e, true))

12525

+ {

12526

+ }

12527

+ else if ((f & 4096) && v)

12528

+ {

12529

+ {

12530

+ const bool m = f & 176;

12531

+ *--c = q[m];

12532

+ *--c = q[1];

12533

+ }

12534

+ }

12535

+ const int w = x.e1;

12536

+ if (w > l)

12537

+ {

12538

+ char * c3 = static_cast <char *>(__builtin_alloca (w));

12539

+ c = c3;

12540

+ }

12541

+ return s.g3 (c, l);

12542

+}

12543

+

12544

+int

12545

+main ()

12546

+{

12547

+ H h;

12548

+ const A *j[1];

12549

+ C c;

12550

+ G g;

12551

+ E e;

12552

+ h.h9 (e.e3);

12553

+ j[0] = &h;

12554

+ c.c1 = j;

12555

+ e.e3.d1 = &c;

12556

+ test (0, g, e, 0, 0);

12557

+ __builtin_abort ();

12558

+}

12559

Index: gcc/testsuite/g++.dg/opt/pr58864.C

12560

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

12561

--- a/src/gcc/testsuite/g++.dg/opt/pr58864.C (.../tags/gcc_4_8_2_release)

12562

+++ b/src/gcc/testsuite/g++.dg/opt/pr58864.C (.../branches/gcc-4_8-branch)

12563

@@ -0,0 +1,21 @@

12564

+// PR target/58864

12565

+// { dg-do compile }

12566

+// { dg-options "-Os" }

12567

+// { dg-additional-options "-march=i686" { target { { i?86-*-* x86_64-*-* } && ia32 } } }

12568

+

12569

+struct A { A (); ~A (); };

12570

+struct B { B (); };

12571

+

12572

+float d, e;

12573

+

12574

+void

12575

+foo ()

12576

+{

12577

+ A a;

12578

+ float c = d;

12579

+ while (1)

12580

+ {

12581

+ B b;

12582

+ e = c ? -c : 0;

12583

+ }

12584

+}

12585

Index: gcc/testsuite/g++.dg/tree-prof/pr59255.C

12586

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

12587

--- a/src/gcc/testsuite/g++.dg/tree-prof/pr59255.C (.../tags/gcc_4_8_2_release)

12588

+++ b/src/gcc/testsuite/g++.dg/tree-prof/pr59255.C (.../branches/gcc-4_8-branch)

12589

@@ -0,0 +1,29 @@

12590

+// PR c++/59255

12591

+// { dg-options "-O2 -std=c++11" }

12592

+

12593

+struct S

12594

+{

12595

+ __attribute__((noinline, noclone)) ~S () noexcept (true)

12596

+ {

12597

+ if (fn)

12598

+ fn (1);

12599

+ }

12600

+ void (*fn) (int);

12601

+};

12602

+

12603

+__attribute__((noinline, noclone)) void

12604

+foo (int x)

12605

+{

12606

+ if (x != 1)

12607

+ throw 1;

12608

+}

12609

+

12610

+int

12611

+main ()

12612

+{

12613

+ for (int i = 0; i < 100; i++)

12614

+ {

12615

+ S s;

12616

+ s.fn = foo;

12617

+ }

12618

+}

12619

Index: gcc/testsuite/g++.dg/gomp/pr59297.C

12620

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

12621

--- a/src/gcc/testsuite/g++.dg/gomp/pr59297.C (.../tags/gcc_4_8_2_release)

12622

+++ b/src/gcc/testsuite/g++.dg/gomp/pr59297.C (.../branches/gcc-4_8-branch)

12623

@@ -0,0 +1,25 @@

12624

+// PR c++/59297

12625

+// { dg-do compile }

12626

+// { dg-options "-fopenmp" }

12627

+

12628

+template <typename T>

12629

+struct A

12630

+{

12631

+ ~A ();

12632

+ const T &operator[] (int) const;

12633

+};

12634

+

12635

+struct B

12636

+{

12637

+ int &operator () (A <int>);

12638

+};

12639

+

12640

+void

12641

+foo (B &x, int &z)

12642

+{

12643

+ A<A<int> > y;

12644

+ #pragma omp atomic

12645

+ x (y[0]) += 1;

12646

+ #pragma omp atomic

12647

+ z += x(y[1]);

12648

+}

12649

Index: gcc/testsuite/g++.dg/diagnostic/pr58979.C

12650

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

12651

--- a/src/gcc/testsuite/g++.dg/diagnostic/pr58979.C (.../tags/gcc_4_8_2_release)

12652

+++ b/src/gcc/testsuite/g++.dg/diagnostic/pr58979.C (.../branches/gcc-4_8-branch)

12653

@@ -0,0 +1,4 @@

12654

+// PR c++/58979

12655

+// { dg-do compile }

12656

+

12657

+int i = 0->*0; // { dg-error "invalid type argument of" }

12658

Index: gcc/testsuite/g++.dg/tm/noexcept-6.C

12659

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

12660

--- a/src/gcc/testsuite/g++.dg/tm/noexcept-6.C (.../tags/gcc_4_8_2_release)

12661

+++ b/src/gcc/testsuite/g++.dg/tm/noexcept-6.C (.../branches/gcc-4_8-branch)

12662

@@ -0,0 +1,23 @@

12663

+// { dg-do compile }

12664

+// { dg-options "-fno-exceptions -fgnu-tm -O -std=c++0x -fdump-tree-tmlower" }

12665

+

12666

+struct TrueFalse

12667

+{

12668

+ static constexpr bool v() { return true; }

12669

+};

12670

+

12671

+int global;

12672

+

12673

+template<typename T> int foo()

12674

+{

12675

+ return __transaction_atomic noexcept(T::v()) (global + 1);

12676

+}

12677

+

12678

+int f1()

12679

+{

12680

+ return foo<TrueFalse>();

12681

+}

12682

+

12683

+/* { dg-final { scan-tree-dump-times "eh_must_not_throw" 0 "tmlower" } } */

12684

+/* { dg-final { scan-tree-dump-times "__transaction_atomic" 1 "tmlower" } } */

12685

+/* { dg-final { cleanup-tree-dump "tmlower" } } */

12686

Index: gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C

12687

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

12688

--- a/src/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C (.../tags/gcc_4_8_2_release)

12689

+++ b/src/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C (.../branches/gcc-4_8-branch)

12690

@@ -0,0 +1,7 @@

12691

+// PR c++/58596

12692

+// { dg-do compile { target c++11 } }

12693

+

12694

+struct A

12695

+{

12696

+ int i = [] { return decltype(i)(); }();

12697

+};

12698

Index: gcc/testsuite/g++.dg/cpp0x/enum18.C

12699

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

12700

--- a/src/gcc/testsuite/g++.dg/cpp0x/enum18.C (.../tags/gcc_4_8_2_release)

12701

+++ b/src/gcc/testsuite/g++.dg/cpp0x/enum18.C (.../branches/gcc-4_8-branch)

12702

@@ -4,5 +4,5 @@

12703

int main(void) {

12704

enum e {};

12705

e ev;

12706

- ev.e::~e_u(); // { dg-error "e_u. has not been declared" }

12707

+ ev.e::~e_u(); // { dg-error "" }

12708

}

12709

Index: gcc/testsuite/g++.dg/cpp0x/access02.C

12710

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

12711

--- a/src/gcc/testsuite/g++.dg/cpp0x/access02.C (.../tags/gcc_4_8_2_release)

12712

+++ b/src/gcc/testsuite/g++.dg/cpp0x/access02.C (.../branches/gcc-4_8-branch)

12713

@@ -0,0 +1,39 @@

12714

+// PR c++/58954

12715

+// { dg-require-effective-target c++11 }

12716

+

12717

+template<class T>

12718

+T&& declval();

12719

+

12720

+template<class T>

12721

+struct foo_argument

12722

+{

12723

+ template<class Ret, class C, class Arg>

12724

+ static Arg test(Ret (C::*)(Arg));

12725

+

12726

+ typedef decltype(test(&T::template foo<>)) type;

12727

+};

12728

+

12729

+template<class T, class>

12730

+struct dependent { typedef T type; };

12731

+

12732

+template<class T>

12733

+struct base

12734

+{

12735

+ template<class Ignore = void>

12736

+ auto foo(int i) -> decltype(declval<

12737

+ typename dependent<T&, Ignore>::type

12738

+ >().foo_impl(i));

12739

+};

12740

+

12741

+struct derived : base<derived>

12742

+{

12743

+ friend struct base<derived>;

12744

+private:

12745

+ int foo_impl(int i);

12746

+};

12747

+

12748

+int main()

12749

+{

12750

+ foo_argument<derived>::type var = 0;

12751

+ return var;

12752

+}

12753

Index: gcc/testsuite/g++.dg/cpp0x/constexpr-template6.C

12754

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

12755

--- a/src/gcc/testsuite/g++.dg/cpp0x/constexpr-template6.C (.../tags/gcc_4_8_2_release)

12756

+++ b/src/gcc/testsuite/g++.dg/cpp0x/constexpr-template6.C (.../branches/gcc-4_8-branch)

12757

@@ -0,0 +1,20 @@

12758

+// PR c++/59268

12759

+// { dg-do compile }

12760

+// { dg-options "-std=c++11" }

12761

+

12762

+template <typename>

12763

+struct A

12764

+{

12765

+ constexpr A (int) {}

12766

+ virtual void foo ()

12767

+ {

12768

+ constexpr A<void> a (0);

12769

+ }

12770

+};

12771

+

12772

+void

12773

+bar ()

12774

+{

12775

+ A<int> a (3);

12776

+ a.foo ();

12777

+}

12778

Index: gcc/testsuite/g++.dg/cpp0x/nsdmi9.C

12779

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

12780

--- a/src/gcc/testsuite/g++.dg/cpp0x/nsdmi9.C (.../tags/gcc_4_8_2_release)

12781

+++ b/src/gcc/testsuite/g++.dg/cpp0x/nsdmi9.C (.../branches/gcc-4_8-branch)

12782

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

12783

+// PR c++/58162

12784

+// { dg-require-effective-target c++11 }

12785

+

12786

+struct A {

12787

+ A();

12788

+ A(A&&);

12789

+};

12790

+

12791

+struct B {

12792

+ A const a = A();

12793

+};

12794

+

12795

+B b;

12796

Index: gcc/testsuite/g++.dg/cpp0x/decltype57.C

12797

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

12798

--- a/src/gcc/testsuite/g++.dg/cpp0x/decltype57.C (.../tags/gcc_4_8_2_release)

12799

+++ b/src/gcc/testsuite/g++.dg/cpp0x/decltype57.C (.../branches/gcc-4_8-branch)

12800

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

12801

+// PR c++/58633

12802

+// { dg-do compile { target c++11 } }

12803

+

12804

+void foo(int i)

12805

+{

12806

+ typedef int I;

12807

+ decltype(i.I::~I())* p;

12808

+}

12809

Index: gcc/testsuite/g++.dg/inherit/virtual11.C

12810

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

12811

--- a/src/gcc/testsuite/g++.dg/inherit/virtual11.C (.../tags/gcc_4_8_2_release)

12812

+++ b/src/gcc/testsuite/g++.dg/inherit/virtual11.C (.../branches/gcc-4_8-branch)

12813

@@ -0,0 +1,17 @@

12814

+// PR c++/59031

12815

+// { dg-do compile }

12816

+// { dg-options "-fdump-tree-gimple " }

12817

+class B {

12818

+ public:

12819

+ virtual int add (int a, int b) {return a+ b;}

12820

+};

12821

+

12822

+class D : public B {

12823

+};

12824

+

12825

+int foo (int a, int b) {

12826

+ D d;

12827

+ return d.add(a, b);

12828

+}

12829

+// { dg-final { scan-tree-dump-not "OBJ_TYPE_REF" "gimple" } }

12830

+// { dg-final { cleanup-tree-dump "gimple" } }

12831

Index: gcc/testsuite/g++.dg/torture/pr59163.C

12832

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

12833

--- a/src/gcc/testsuite/g++.dg/torture/pr59163.C (.../tags/gcc_4_8_2_release)

12834

+++ b/src/gcc/testsuite/g++.dg/torture/pr59163.C (.../branches/gcc-4_8-branch)

12835

@@ -0,0 +1,30 @@

12836

+// PR target/59163

12837

+// { dg-do run }

12838

+

12839

+struct A { float a[4]; };

12840

+struct B { int b; A a; };

12841

+

12842

+__attribute__((noinline, noclone)) void

12843

+bar (A &a)

12844

+{

12845

+ if (a.a[0] != 36.0f || a.a[1] != 42.0f || a.a[2] != 48.0f || a.a[3] != 54.0f)

12846

+ __builtin_abort ();

12847

+}

12848

+

12849

+__attribute__((noinline, noclone)) void

12850

+foo (A &a)

12851

+{

12852

+ int i;

12853

+ A c = a;

12854

+ for (i = 0; i < 4; i++)

12855

+ c.a[i] *= 6.0f;

12856

+ a = c;

12857

+ bar (a);

12858

+}

12859

+

12860

+int

12861

+main ()

12862

+{

12863

+ B b = { 5, { 6, 7, 8, 9 } };

12864

+ foo (b.a);

12865

+}

12866

Index: gcc/testsuite/g++.dg/template/partial14.C

12867

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

12868

--- a/src/gcc/testsuite/g++.dg/template/partial14.C (.../tags/gcc_4_8_2_release)

12869

+++ b/src/gcc/testsuite/g++.dg/template/partial14.C (.../branches/gcc-4_8-branch)

12870

@@ -0,0 +1,16 @@

12871

+// PR c++/59044

12872

+

12873

+template <class T>

12874

+class C {

12875

+private:

12876

+ template <T a, T b>

12877

+ struct Implementation {};

12878

+public:

12879

+ typedef typename Implementation<0, 0>::Typedef Type;

12880

+};

12881

+

12882

+template <class T>

12883

+template <T b>

12884

+struct C<T>::Implementation<0, b> { typedef void Typedef; };

12885

+

12886

+template class C<unsigned>;

12887

Index: gcc/testsuite/c-c++-common/pr59037.c

12888

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

12889

--- a/src/gcc/testsuite/c-c++-common/pr59037.c (.../tags/gcc_4_8_2_release)

12890

+++ b/src/gcc/testsuite/c-c++-common/pr59037.c (.../branches/gcc-4_8-branch)

12891

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

12892

+/* { dg-do compile } */

12893

+/* { dg-options "-O3" } */

12894

+

12895

+typedef int v4si __attribute__ ((vector_size (16)));

12896

+

12897

+int

12898

+main (int argc, char** argv)

12899

+{

12900

+ v4si x = {0,1,2,3};

12901

+ x = (v4si) {(x)[3], (x)[2], (x)[1], (x)[0]};

12902

+ return x[4];

12903

+}

12904

Index: gcc/testsuite/c-c++-common/pr59280.c

12905

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

12906

--- a/src/gcc/testsuite/c-c++-common/pr59280.c (.../tags/gcc_4_8_2_release)

12907

+++ b/src/gcc/testsuite/c-c++-common/pr59280.c (.../branches/gcc-4_8-branch)

12908

@@ -0,0 +1,4 @@

12909

+/* PR c/59280 */

12910

+/* { dg-do compile } */

12911

+

12912

+void bar (char *) __attribute__((constructor(foo))); /* { dg-error "constructor priorities must be integers|was not declared|constructor priorities are not supported" } */

12913

Index: gcc/testsuite/c-c++-common/fold-divmul-1.c

12914

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

12915

--- a/src/gcc/testsuite/c-c++-common/fold-divmul-1.c (.../tags/gcc_4_8_2_release)

12916

+++ b/src/gcc/testsuite/c-c++-common/fold-divmul-1.c (.../branches/gcc-4_8-branch)

12917

@@ -0,0 +1,11 @@

12918

+/* { dg-do compile } */

12919

+/* { dg-options "-fdump-tree-original" } */

12920

+

12921

+int *

12922

+fx (int *b, int *e)

12923

+{

12924

+ return b + (e - b);

12925

+}

12926

+

12927

+/* { dg-final { scan-tree-dump-not "/\\\[ex\\\]" "original" } } */

12928

+/* { dg-final { cleanup-tree-dump "original" } } */

12929

Index: gcc/testsuite/c-c++-common/torture/pr58794-1.c

12930

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

12931

--- a/src/gcc/testsuite/c-c++-common/torture/pr58794-1.c (.../tags/gcc_4_8_2_release)

12932

+++ b/src/gcc/testsuite/c-c++-common/torture/pr58794-1.c (.../branches/gcc-4_8-branch)

12933

@@ -0,0 +1,29 @@

12934

+/* { dg-do compile } */

12935

+

12936

+struct S0

12937

+{

12938

+ int f;

12939

+};

12940

+

12941

+struct S1

12942

+{

12943

+ struct S0 f1;

12944

+ volatile int f2;

12945

+};

12946

+

12947

+struct S2

12948

+{

12949

+ struct S1 g;

12950

+} a, b;

12951

+

12952

+static int *c[1][2] = {{0, (int *)&a.g.f2}};

12953

+static int d;

12954

+

12955

+int

12956

+main ()

12957

+{

12958

+ for (d = 0; d < 1; d++)

12959

+ for (b.g.f1.f = 0; b.g.f1.f < 1; b.g.f1.f++)

12960

+ *c[b.g.f1.f][d + 1] = 0;

12961

+ return 0;

12962

+}

12963

Index: gcc/testsuite/c-c++-common/torture/pr58794-2.c

12964

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

12965

--- a/src/gcc/testsuite/c-c++-common/torture/pr58794-2.c (.../tags/gcc_4_8_2_release)

12966

+++ b/src/gcc/testsuite/c-c++-common/torture/pr58794-2.c (.../branches/gcc-4_8-branch)

12967

@@ -0,0 +1,21 @@

12968

+/* { dg-do compile } */

12969

+

12970

+struct S

12971

+{

12972

+ volatile int f;

12973

+} a;

12974

+

12975

+unsigned int b;

12976

+

12977

+static int *c[1][2] = {{0, (int *)&a.f}};

12978

+static unsigned int d;

12979

+

12980

+int

12981

+main ()

12982

+{

12983

+ for (; d < 1; d++)

12984

+ for (; b < 1; b++)

12985

+ *c[b][d + 1] = 0;

12986

+

12987

+ return 0;

12988

+}

12989

Index: gcc/testsuite/c-c++-common/gomp/pr59467.c

12990

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

12991

--- a/src/gcc/testsuite/c-c++-common/gomp/pr59467.c (.../tags/gcc_4_8_2_release)

12992

+++ b/src/gcc/testsuite/c-c++-common/gomp/pr59467.c (.../branches/gcc-4_8-branch)

12993

@@ -0,0 +1,68 @@

12994

+/* PR libgomp/59467 */

12995

+

12996

+int v;

12997

+

12998

+void

12999

+foo (void)

13000

+{

13001

+ int x = 0, y = 0;

13002

+ #pragma omp parallel

13003

+ {

13004

+ int z;

13005

+ #pragma omp single copyprivate (x) /* { dg-error "is not threadprivate or private in outer context" } */

13006

+ {

13007

+ #pragma omp atomic write

13008

+ x = 6;

13009

+ }

13010

+ #pragma omp atomic read

13011

+ z = x;

13012

+ #pragma omp atomic

13013

+ y += z;

13014

+ }

13015

+ #pragma omp parallel

13016

+ {

13017

+ int z;

13018

+ #pragma omp single copyprivate (v) /* { dg-error "is not threadprivate or private in outer context" } */

13019

+ {

13020

+ #pragma omp atomic write

13021

+ v = 6;

13022

+ }

13023

+ #pragma omp atomic read

13024

+ z = v;

13025

+ #pragma omp atomic

13026

+ y += z;

13027

+ }

13028

+ #pragma omp parallel private (x)

13029

+ {

13030

+ int z;

13031

+ #pragma omp single copyprivate (x)

13032

+ {

13033

+ #pragma omp atomic write

13034

+ x = 6;

13035

+ }

13036

+ #pragma omp atomic read

13037

+ z = x;

13038

+ #pragma omp atomic

13039

+ y += z;

13040

+ }

13041

+ x = 0;

13042

+ #pragma omp parallel reduction (+:x)

13043

+ {

13044

+ #pragma omp single copyprivate (x)

13045

+ {

13046

+ #pragma omp atomic write

13047

+ x = 6;

13048

+ }

13049

+ #pragma omp atomic

13050

+ y += x;

13051

+ }

13052

+ #pragma omp single copyprivate (x)

13053

+ {

13054

+ x = 7;

13055

+ }

13056

+ #pragma omp single copyprivate (v) /* { dg-error "is not threadprivate or private in outer context" } */

13057

+ {

13058

+ #pragma omp atomic write

13059

+ v = 6;

13060

+ }

13061

+}

13062

Index: gcc/testsuite/c-c++-common/pr59032.c

13063

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

13064

--- a/src/gcc/testsuite/c-c++-common/pr59032.c (.../tags/gcc_4_8_2_release)

13065

+++ b/src/gcc/testsuite/c-c++-common/pr59032.c (.../branches/gcc-4_8-branch)

13066

@@ -0,0 +1,30 @@

13067

+/* { dg-do compile } */

13068

+/* { dg-options "-O2" } */

13069

+

13070

+void

13071

+foo()

13072

+{

13073

+ float v __attribute__((vector_size(8)));

13074

+ v++;

13075

+}

13076

+

13077

+void

13078

+foo2 ()

13079

+{

13080

+ float v __attribute__((vector_size(8)));

13081

+ ++v;

13082

+}

13083

+

13084

+void

13085

+foo3 ()

13086

+{

13087

+ float v __attribute__((vector_size(8)));

13088

+ v--;

13089

+}

13090

+

13091

+void

13092

+foo4 ()

13093

+{

13094

+ float v __attribute__((vector_size(8)));

13095

+ --v;

13096

+}

13097

Index: gcc/cp/typeck.c

13098

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

13099

--- a/src/gcc/cp/typeck.c (.../tags/gcc_4_8_2_release)

13100

+++ b/src/gcc/cp/typeck.c (.../branches/gcc-4_8-branch)

13101

@@ -5588,7 +5588,9 @@

13102

inc = cxx_sizeof_nowarn (TREE_TYPE (argtype));

13103

}

13104

else

13105

- inc = integer_one_node;

13106

+ inc = (TREE_CODE (argtype) == VECTOR_TYPE

13107

+ ? build_one_cst (argtype)

13108

+ : integer_one_node);

13109

13110

inc = cp_convert (argtype, inc, complain);

13111

13112

@@ -7611,7 +7613,7 @@

13113

/* Handle null pointer to member function conversions. */

13114

if (null_ptr_cst_p (pfn))

13115

{

13116

- pfn = build_c_cast (input_location, type, pfn);

13117

+ pfn = cp_build_c_cast (type, pfn, complain);

13118

return build_ptrmemfunc1 (to_type,

13119

integer_zero_node,

13120

pfn);

13121

Index: gcc/cp/except.c

13122

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

13123

--- a/src/gcc/cp/except.c (.../tags/gcc_4_8_2_release)

13124

+++ b/src/gcc/cp/except.c (.../branches/gcc-4_8-branch)

13125

@@ -380,6 +380,9 @@

13126

{

13127

tree type = body ? TREE_TYPE (body) : void_type_node;

13128

13129

+ if (!flag_exceptions)

13130

+ return body;

13131

+

13132

if (cond && !value_dependent_expression_p (cond))

13133

{

13134

cond = cxx_constant_value (cond);

13135

Index: gcc/cp/ChangeLog

13136

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

13137

--- a/src/gcc/cp/ChangeLog (.../tags/gcc_4_8_2_release)

13138

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

13139

@@ -1,3 +1,83 @@

13140

+2013-12-12 Jason Merrill <jason@redhat.com>

13141

+

13142

+ PR c++/58954

13143

+ * pt.c (resolve_overloaded_unification): Discard access checks.

13144

+

13145

+2013-12-05 Jason Merrill <jason@redhat.com>

13146

+

13147

+ PR c++/59044

13148

+ PR c++/59052

13149

+ * pt.c (most_specialized_class): Use the partially instantiated

13150

+ template for deduction. Drop the TMPL parameter.

13151

+

13152

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

13153

+

13154

+ PR c++/59268

13155

+ * pt.c (tsubst_copy_and_build): Handle POINTER_PLUS_EXPR.

13156

+

13157

+2013-11-27 Tom de Vries <tom@codesourcery.com>

13158

+ Marc Glisse <marc.glisse@inria.fr>

13159

+

13160

+ PR c++/59032

13161

+ * typeck.c (cp_build_unary_op): Allow vector increment and decrement.

13162

+

13163

+2013-11-27 Tom de Vries <tom@codesourcery.com>

13164

+ Marc Glisse <marc.glisse@inria.fr>

13165

+

13166

+ PR middle-end/59037

13167

+ * semantics.c (cxx_fold_indirect_ref): Don't create out-of-bounds

13168

+ BIT_FIELD_REF.

13169

+

13170

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

13171

+

13172

+ PR c++/59297

13173

+ * semantics.c (finish_omp_atomic): Call finish_expr_stmt

13174

+ rather than add_stmt.

13175

+

13176

+2013-11-23 Easwaran Raman <eraman@google.com>

13177

+

13178

+ PR c++/59031

13179

+ * call.c (build_new_method_call_1): Comnpare function context

13180

+ with BASELINK_BINFO type rather than instance type before

13181

+ marking the call with LOOKUP_NONVIRTUAL.

13182

+

13183

+2013-10-31 Jason Merrill <jason@redhat.com>

13184

+

13185

+ PR c++/58162

13186

+ * parser.c (cp_parser_late_parse_one_default_arg): Set

13187

+ TARGET_EXPR_DIRECT_INIT_P.

13188

+

13189

+2013-11-11 Paolo Carlini <paolo.carlini@oracle.com>

13190

+

13191

+ * cvt.c (cp_convert_to_pointer): Call build_ptrmemfunc before

13192

+ maybe_warn_zero_as_null_pointer_constant to avoid duplicate

13193

+ -Wzero-as-null-pointer-constant diagnostics.

13194

+

13195

+ * typeck.c (build_ptrmemfunc): Use cp_build_c_cast.

13196

+

13197

+2013-10-25 Tom de Vries <tom@codesourcery.com>

13198

+

13199

+ PR c++/58282

13200

+ * except.c (build_must_not_throw_expr): Handle

13201

+ flag_exceptions.

13202

+

13203

+2013-10-17 Paolo Carlini <paolo.carlini@oracle.com>

13204

+

13205

+ PR c++/58596

13206

+ * semantics.c (lambda_expr_this_capture): Handle NSDMIs in the

13207

+ cp_unevaluated_operand case.

13208

+

13209

+2013-10-16 Paolo Carlini <paolo.carlini@oracle.com>

13210

+

13211

+ PR c++/58633

13212

+ * parser.c (cp_parser_pseudo_destructor_name): Revert r174385 changes.

13213

+

13214

+2013-10-16 Jason Merrill <jason@redhat.com>

13215

+

13216

+ PR c++/57850

13217

+ * decl2.c (dump_tu): Split out from...

13218

+ (cp_write_global_declarations): ...here. Call it in PCH mode.

13219

+

13220

2013-10-16 Release Manager

13221

13222

* GCC 4.8.2 released.

13223

Index: gcc/cp/pt.c

13224

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

13225

--- a/src/gcc/cp/pt.c (.../tags/gcc_4_8_2_release)

13226

+++ b/src/gcc/cp/pt.c (.../branches/gcc-4_8-branch)

13227

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

13228

static tree tsubst_template_args (tree, tree, tsubst_flags_t, tree);

13229

static tree tsubst_template_parms (tree, tree, tsubst_flags_t);

13230

static void regenerate_decl_from_template (tree, tree);

13231

-static tree most_specialized_class (tree, tree, tsubst_flags_t);

13232

+static tree most_specialized_class (tree, tsubst_flags_t);

13233

static tree tsubst_aggr_type (tree, tree, tsubst_flags_t, tree, int);

13234

static tree tsubst_arg_types (tree, tree, tree, tsubst_flags_t, tree);

13235

static tree tsubst_function_type (tree, tree, tsubst_flags_t, tree);

13236

@@ -4261,7 +4261,7 @@

13237

if (COMPLETE_TYPE_P (inst_type)

13238

&& CLASSTYPE_IMPLICIT_INSTANTIATION (inst_type))

13239

{

13240

- tree spec = most_specialized_class (inst_type, maintmpl, tf_none);

13241

+ tree spec = most_specialized_class (inst_type, tf_none);

13242

if (spec && TREE_TYPE (spec) == type)

13243

permerror (input_location,

13244

"partial specialization of %qT after instantiation "

13245

@@ -8572,7 +8572,7 @@

13246

13247

/* Determine what specialization of the original template to

13248

instantiate. */

13249

- t = most_specialized_class (type, templ, tf_warning_or_error);

13250

+ t = most_specialized_class (type, tf_warning_or_error);

13251

if (t == error_mark_node)

13252

{

13253

TYPE_BEING_DEFINED (type) = 1;

13254

@@ -13710,6 +13710,10 @@

13255

RETURN (r);

13256

}

13257

13258

+ case POINTER_PLUS_EXPR:

13259

+ return fold_build_pointer_plus (RECUR (TREE_OPERAND (t, 0)),

13260

+ RECUR (TREE_OPERAND (t, 1)));

13261

+

13262

case SCOPE_REF:

13263

RETURN (tsubst_qualified_id (t, args, complain, in_decl, /*done=*/true,

13264

/*address_p=*/false));

13265

@@ -15749,7 +15753,7 @@

13266

if (subargs != error_mark_node

13267

&& !any_dependent_template_arguments_p (subargs))

13268

{

13269

- elem = tsubst (TREE_TYPE (fn), subargs, tf_none, NULL_TREE);

13270

+ elem = TREE_TYPE (instantiate_template (fn, subargs, tf_none));

13271

if (try_one_overload (tparms, targs, tempargs, parm,

13272

elem, strict, sub_strict, addr_p, explain_p)

13273

&& (!goodfn || !same_type_p (goodfn, elem)))

13274

@@ -17553,7 +17557,7 @@

13275

return -1;

13276

}

13277

13278

-/* Determine which of two partial specializations of MAIN_TMPL is more

13279

+/* Determine which of two partial specializations of TMPL is more

13280

specialized.

13281

13282

PAT1 is a TREE_LIST whose TREE_TYPE is the _TYPE node corresponding

13283

@@ -17569,7 +17573,7 @@

13284

two templates is more specialized. */

13285

13286

static int

13287

-more_specialized_class (tree main_tmpl, tree pat1, tree pat2)

13288

+more_specialized_class (tree tmpl, tree pat1, tree pat2)

13289

{

13290

tree targs;

13291

tree tmpl1, tmpl2;

13292

@@ -17584,7 +17588,7 @@

13293

types in the arguments, and we need our dependency check functions

13294

to behave correctly. */

13295

++processing_template_decl;

13296

- targs = get_class_bindings (main_tmpl, TREE_VALUE (pat1),

13297

+ targs = get_class_bindings (tmpl, TREE_VALUE (pat1),

13298

CLASSTYPE_TI_ARGS (tmpl1),

13299

CLASSTYPE_TI_ARGS (tmpl2));

13300

if (targs)

13301

@@ -17593,7 +17597,7 @@

13302

any_deductions = true;

13303

}

13304

13305

- targs = get_class_bindings (main_tmpl, TREE_VALUE (pat2),

13306

+ targs = get_class_bindings (tmpl, TREE_VALUE (pat2),

13307

CLASSTYPE_TI_ARGS (tmpl2),

13308

CLASSTYPE_TI_ARGS (tmpl1));

13309

if (targs)

13310

@@ -17673,7 +17677,7 @@

13311

}

13312

13313

/* Return the innermost template arguments that, when applied to a partial

13314

- specialization of MAIN_TMPL whose innermost template parameters are

13315

+ specialization of TMPL whose innermost template parameters are

13316

TPARMS, and whose specialization arguments are SPEC_ARGS, yield the

13317

ARGS.

13318

13319

@@ -17688,7 +17692,7 @@

13320

is bound to `double'. */

13321

13322

static tree

13323

-get_class_bindings (tree main_tmpl, tree tparms, tree spec_args, tree args)

13324

+get_class_bindings (tree tmpl, tree tparms, tree spec_args, tree args)

13325

{

13326

int i, ntparms = TREE_VEC_LENGTH (tparms);

13327

tree deduced_args;

13328

@@ -17728,8 +17732,8 @@

13329

`T' is `A' but unify () does not check whether `typename T::X'

13330

is `int'. */

13331

spec_args = tsubst (spec_args, deduced_args, tf_none, NULL_TREE);

13332

- spec_args = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (main_tmpl),

13333

- spec_args, main_tmpl,

13334

+ spec_args = coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),

13335

+ spec_args, tmpl,

13336

tf_none, false, false);

13337

if (spec_args == error_mark_node

13338

/* We only need to check the innermost arguments; the other

13339

@@ -17877,30 +17881,30 @@

13340

}

13341

13342

/* Return the most specialized of the class template partial

13343

- specializations of TMPL which can produce TYPE, a specialization of

13344

- TMPL. The value returned is actually a TREE_LIST; the TREE_TYPE is

13345

+ specializations which can produce TYPE, a specialization of some class

13346

+ template. The value returned is actually a TREE_LIST; the TREE_TYPE is

13347

a _TYPE node corresponding to the partial specialization, while the

13348

TREE_PURPOSE is the set of template arguments that must be

13349

substituted into the TREE_TYPE in order to generate TYPE.

13350

13351

If the choice of partial specialization is ambiguous, a diagnostic

13352

is issued, and the error_mark_node is returned. If there are no

13353

- partial specializations of TMPL matching TYPE, then NULL_TREE is

13354

- returned. */

13355

+ partial specializations matching TYPE, then NULL_TREE is

13356

+ returned, indicating that the primary template should be used. */

13357

13358

static tree

13359

-most_specialized_class (tree type, tree tmpl, tsubst_flags_t complain)

13360

+most_specialized_class (tree type, tsubst_flags_t complain)

13361

{

13362

tree list = NULL_TREE;

13363

tree t;

13364

tree champ;

13365

int fate;

13366

bool ambiguous_p;

13367

- tree args;

13368

tree outer_args = NULL_TREE;

13369

13370

- tmpl = most_general_template (tmpl);

13371

- args = CLASSTYPE_TI_ARGS (type);

13372

+ tree tmpl = CLASSTYPE_TI_TEMPLATE (type);

13373

+ tree main_tmpl = most_general_template (tmpl);

13374

+ tree args = CLASSTYPE_TI_ARGS (type);

13375

13376

/* For determining which partial specialization to use, only the

13377

innermost args are interesting. */

13378

@@ -17910,7 +17914,7 @@

13379

args = INNERMOST_TEMPLATE_ARGS (args);

13380

}

13381

13382

- for (t = DECL_TEMPLATE_SPECIALIZATIONS (tmpl); t; t = TREE_CHAIN (t))

13383

+ for (t = DECL_TEMPLATE_SPECIALIZATIONS (main_tmpl); t; t = TREE_CHAIN (t))

13384

{

13385

tree partial_spec_args;

13386

tree spec_args;

13387

@@ -17944,8 +17948,7 @@

13388

13389

partial_spec_args =

13390

coerce_template_parms (DECL_INNERMOST_TEMPLATE_PARMS (tmpl),

13391

- add_to_template_args (outer_args,

13392

- partial_spec_args),

13393

+ partial_spec_args,

13394

tmpl, tf_none,

13395

/*require_all_args=*/true,

13396

/*use_default_args=*/true);

13397

Index: gcc/cp/semantics.c

13398

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

13399

--- a/src/gcc/cp/semantics.c (.../tags/gcc_4_8_2_release)

13400

+++ b/src/gcc/cp/semantics.c (.../branches/gcc-4_8-branch)

13401

@@ -5059,7 +5059,7 @@

13402

}

13403

stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);

13404

}

13405

- add_stmt (stmt);

13406

+ finish_expr_stmt (stmt);

13407

}

13408

13409

void

13410

@@ -7543,7 +7543,7 @@

13411

unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;

13412

tree index = bitsize_int (indexi);

13413

13414

- if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))

13415

+ if (offset / part_widthi < TYPE_VECTOR_SUBPARTS (op00type))

13416

return fold_build3_loc (loc,

13417

BIT_FIELD_REF, type, op00,

13418

part_width, index);

13419

@@ -9481,7 +9481,14 @@

13420

/* In unevaluated context this isn't an odr-use, so just return the

13421

nearest 'this'. */

13422

if (cp_unevaluated_operand)

13423

- return lookup_name (this_identifier);

13424

+ {

13425

+ /* In an NSDMI the fake 'this' pointer that we're using for

13426

+ parsing is in scope_chain. */

13427

+ if (LAMBDA_EXPR_EXTRA_SCOPE (lambda)

13428

+ && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (lambda)) == FIELD_DECL)

13429

+ return scope_chain->x_current_class_ptr;

13430

+ return lookup_name (this_identifier);

13431

+ }

13432

13433

/* Try to default capture 'this' if we can. */

13434

if (!this_capture

13435

Index: gcc/cp/decl2.c

13436

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

13437

--- a/src/gcc/cp/decl2.c (.../tags/gcc_4_8_2_release)

13438

+++ b/src/gcc/cp/decl2.c (.../branches/gcc-4_8-branch)

13439

@@ -3960,6 +3960,22 @@

13440

expand_or_defer_fn (finish_function (0));

13441

}

13442

13443

+/* The entire file is now complete. If requested, dump everything

13444

+ to a file. */

13445

+

13446

+static void

13447

+dump_tu (void)

13448

+{

13449

+ int flags;

13450

+ FILE *stream = dump_begin (TDI_tu, &flags);

13451

+

13452

+ if (stream)

13453

+ {

13454

+ dump_node (global_namespace, flags & ~TDF_SLIM, stream);

13455

+ dump_end (TDI_tu, stream);

13456

+ }

13457

+}

13458

+

13459

/* This routine is called at the end of compilation.

13460

Its job is to create all the code needed to initialize and

13461

destroy the global aggregates. We do the destruction

13462

@@ -3990,6 +4006,7 @@

13463

if (pch_file)

13464

{

13465

c_common_write_pch ();

13466

+ dump_tu ();

13467

return;

13468

}

13469

13470

@@ -4359,17 +4376,8 @@

13471

13472

/* The entire file is now complete. If requested, dump everything

13473

to a file. */

13474

- {

13475

- int flags;

13476

- FILE *stream = dump_begin (TDI_tu, &flags);

13477

+ dump_tu ();

13478

13479

- if (stream)

13480

- {

13481

- dump_node (global_namespace, flags & ~TDF_SLIM, stream);

13482

- dump_end (TDI_tu, stream);

13483

- }

13484

- }

13485

-

13486

if (flag_detailed_statistics)

13487

{

13488

dump_tree_statistics ();

13489

Index: gcc/cp/parser.c

13490

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

13491

--- a/src/gcc/cp/parser.c (.../tags/gcc_4_8_2_release)

13492

+++ b/src/gcc/cp/parser.c (.../branches/gcc-4_8-branch)

13493

@@ -6421,10 +6421,6 @@

13494

/* Look for the `~'. */

13495

cp_parser_require (parser, CPP_COMPL, RT_COMPL);

13496

13497

- /* Once we see the ~, this has to be a pseudo-destructor. */

13498

- if (!processing_template_decl && !cp_parser_error_occurred (parser))

13499

- cp_parser_commit_to_tentative_parse (parser);

13500

-

13501

/* Look for the type-name again. We are not responsible for

13502

checking that it matches the first type-name. */

13503

*type = cp_parser_nonclass_name (parser);

13504

@@ -22576,6 +22572,9 @@

13505

&& CONSTRUCTOR_IS_DIRECT_INIT (parsed_arg))

13506

flags = LOOKUP_NORMAL;

13507

parsed_arg = digest_init_flags (TREE_TYPE (decl), parsed_arg, flags);

13508

+ if (TREE_CODE (parsed_arg) == TARGET_EXPR)

13509

+ /* This represents the whole initialization. */

13510

+ TARGET_EXPR_DIRECT_INIT_P (parsed_arg) = true;

13511

}

13512

}

13513

13514

Index: gcc/cp/call.c

13515

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

13516

--- a/src/gcc/cp/call.c (.../tags/gcc_4_8_2_release)

13517

+++ b/src/gcc/cp/call.c (.../branches/gcc-4_8-branch)

13518

@@ -7414,7 +7414,7 @@

13519

struct z_candidate *candidates = 0, *cand;

13520

tree explicit_targs = NULL_TREE;

13521

tree basetype = NULL_TREE;

13522

- tree access_binfo;

13523

+ tree access_binfo, binfo;

13524

tree optype;

13525

tree first_mem_arg = NULL_TREE;

13526

tree instance_ptr;

13527

@@ -7454,6 +7454,7 @@

13528

if (!conversion_path)

13529

conversion_path = BASELINK_BINFO (fns);

13530

access_binfo = BASELINK_ACCESS_BINFO (fns);

13531

+ binfo = BASELINK_BINFO (fns);

13532

optype = BASELINK_OPTYPE (fns);

13533

fns = BASELINK_FUNCTIONS (fns);

13534

if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)

13535

@@ -7697,13 +7698,13 @@

13536

{

13537

/* Optimize away vtable lookup if we know that this

13538

function can't be overridden. We need to check if

13539

- the context and the instance type are the same,

13540

+ the context and the type where we found fn are the same,

13541

actually FN might be defined in a different class

13542

type because of a using-declaration. In this case, we

13543

do not want to perform a non-virtual call. */

13544

if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)

13545

&& same_type_ignoring_top_level_qualifiers_p

13546

- (DECL_CONTEXT (fn), TREE_TYPE (instance))

13547

+ (DECL_CONTEXT (fn), BINFO_TYPE (binfo))

13548

&& resolves_to_fixed_type_p (instance, 0))

13549

flags |= LOOKUP_NONVIRTUAL;

13550

if (explicit_targs)

13551

Index: gcc/cp/cvt.c

13552

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

13553

--- a/src/gcc/cp/cvt.c (.../tags/gcc_4_8_2_release)

13554

+++ b/src/gcc/cp/cvt.c (.../branches/gcc-4_8-branch)

13555

@@ -203,13 +203,13 @@

13556

13557

if (null_ptr_cst_p (expr))

13558

{

13559

- if (complain & tf_warning)

13560

- maybe_warn_zero_as_null_pointer_constant (expr, loc);

13561

-

13562

if (TYPE_PTRMEMFUNC_P (type))

13563

return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, 0,

13564

/*c_cast_p=*/false, complain);

13565

13566

+ if (complain & tf_warning)

13567

+ maybe_warn_zero_as_null_pointer_constant (expr, loc);

13568

+

13569

/* A NULL pointer-to-data-member is represented by -1, not by

13570

zero. */

13571

tree val = (TYPE_PTRDATAMEM_P (type)

13572

Index: gcc/cp/cp-tree.h

13573

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

13574

--- a/src/gcc/cp/cp-tree.h (.../tags/gcc_4_8_2_release)

13575

+++ b/src/gcc/cp/cp-tree.h (.../branches/gcc-4_8-branch)

13576

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

13577

/* Returns true iff NODE is a BASELINK. */

13578

#define BASELINK_P(NODE) \

13579

(TREE_CODE (NODE) == BASELINK)

13580

-/* The BINFO indicating the base from which the BASELINK_FUNCTIONS came. */

13581

+/* The BINFO indicating the base in which lookup found the

13582

+ BASELINK_FUNCTIONS. */

13583

#define BASELINK_BINFO(NODE) \

13584

(((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)

13585

/* The functions referred to by the BASELINK; either a FUNCTION_DECL,

13586

Index: gcc/mode-switching.c

13587

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

13588

--- a/src/gcc/mode-switching.c (.../tags/gcc_4_8_2_release)

13589

+++ b/src/gcc/mode-switching.c (.../branches/gcc-4_8-branch)

13590

@@ -568,12 +568,15 @@

13591

13592

info[bb->index].computing = last_mode;

13593

/* Check for blocks without ANY mode requirements.

13594

- N.B. because of MODE_AFTER, last_mode might still be different

13595

- from no_mode. */

13596

+ N.B. because of MODE_AFTER, last_mode might still

13597

+ be different from no_mode, in which case we need to

13598

+ mark the block as nontransparent. */

13599

if (!any_set_required)

13600

{

13601

ptr = new_seginfo (no_mode, BB_END (bb), bb->index, live_now);

13602

add_seginfo (info + bb->index, ptr);

13603

+ if (last_mode != no_mode)

13604

+ bitmap_clear_bit (transp[bb->index], j);

13605

}

13606

}

13607

#if defined (MODE_ENTRY) && defined (MODE_EXIT)

13608

Index: gcc/ipa-pure-const.c

13609

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

13610

--- a/src/gcc/ipa-pure-const.c (.../tags/gcc_4_8_2_release)

13611

+++ b/src/gcc/ipa-pure-const.c (.../branches/gcc-4_8-branch)

13612

@@ -588,7 +588,7 @@

13613

/* Wrapper around check_decl for loads in local more. */

13614

13615

static bool

13616

-check_load (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13617

+check_load (gimple, tree op, tree, void *data)

13618

{

13619

if (DECL_P (op))

13620

check_decl ((funct_state)data, op, false, false);

13621

@@ -600,7 +600,7 @@

13622

/* Wrapper around check_decl for stores in local more. */

13623

13624

static bool

13625

-check_store (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13626

+check_store (gimple, tree op, tree, void *data)

13627

{

13628

if (DECL_P (op))

13629

check_decl ((funct_state)data, op, true, false);

13630

@@ -612,7 +612,7 @@

13631

/* Wrapper around check_decl for loads in ipa mode. */

13632

13633

static bool

13634

-check_ipa_load (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13635

+check_ipa_load (gimple, tree op, tree, void *data)

13636

{

13637

if (DECL_P (op))

13638

check_decl ((funct_state)data, op, false, true);

13639

@@ -624,7 +624,7 @@

13640

/* Wrapper around check_decl for stores in ipa mode. */

13641

13642

static bool

13643

-check_ipa_store (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

13644

+check_ipa_store (gimple, tree op, tree, void *data)

13645

{

13646

if (DECL_P (op))

13647

check_decl ((funct_state)data, op, true, true);

13648

Index: gcc/cse.c

13649

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

13650

--- a/src/gcc/cse.c (.../tags/gcc_4_8_2_release)

13651

+++ b/src/gcc/cse.c (.../branches/gcc-4_8-branch)

13652

@@ -6082,6 +6082,18 @@

13653

return x;

13654

}

13655

13656

+ case UNSIGNED_FLOAT:

13657

+ {

13658

+ rtx new_rtx = cse_process_notes (XEXP (x, 0), object, changed);

13659

+ /* We don't substitute negative VOIDmode constants into these rtx,

13660

+ since they would impede folding. */

13661

+ if (GET_MODE (new_rtx) != VOIDmode

13662

+ || (CONST_INT_P (new_rtx) && INTVAL (new_rtx) >= 0)

13663

+ || (CONST_DOUBLE_P (new_rtx) && CONST_DOUBLE_HIGH (new_rtx) >= 0))

13664

+ validate_change (object, &XEXP (x, 0), new_rtx, 0);

13665

+ return x;

13666

+ }

13667

+

13668

case REG:

13669

i = REG_QTY (REGNO (x));

13670

13671

Index: gcc/tree-ssa-sink.c

13672

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

13673

--- a/src/gcc/tree-ssa-sink.c (.../tags/gcc_4_8_2_release)

13674

+++ b/src/gcc/tree-ssa-sink.c (.../branches/gcc-4_8-branch)

13675

@@ -559,7 +559,7 @@

13676

execute_sink_code (void)

13677

{

13678

loop_optimizer_init (LOOPS_NORMAL);

13679

-

13680

+ split_critical_edges ();

13681

connect_infinite_loops_to_exit ();

13682

memset (&sink_stats, 0, sizeof (sink_stats));

13683

calculate_dominance_info (CDI_DOMINATORS);

13684

Index: gcc/config.in

13685

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

13686

--- a/src/gcc/config.in (.../tags/gcc_4_8_2_release)

13687

+++ b/src/gcc/config.in (.../branches/gcc-4_8-branch)

13688

@@ -375,6 +375,12 @@

13689

#endif

13690

13691

13692

+/* Define if your assembler supports LEON instructions. */

13693

+#ifndef USED_FOR_TARGET

13694

+#undef HAVE_AS_LEON

13695

+#endif

13696

+

13697

+

13698

/* Define if the assembler won't complain about a line such as # 0 "" 2. */

13699

#ifndef USED_FOR_TARGET

13700

#undef HAVE_AS_LINE_ZERO

13701

Index: gcc/ifcvt.c

13702

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

13703

--- a/src/gcc/ifcvt.c (.../tags/gcc_4_8_2_release)

13704

+++ b/src/gcc/ifcvt.c (.../branches/gcc-4_8-branch)

13705

@@ -115,7 +115,11 @@

13706

13707

while (1)

13708

{

13709

- if (CALL_P (insn) || NONJUMP_INSN_P (insn))

13710

+ if ((CALL_P (insn) || NONJUMP_INSN_P (insn))

13711

+ /* Don't count USE/CLOBBER insns, flow_find_cross_jump etc.

13712

+ don't count them either and we need consistency. */

13713

+ && GET_CODE (PATTERN (insn)) != USE

13714

+ && GET_CODE (PATTERN (insn)) != CLOBBER)

13715

count++;

13716

13717

if (insn == BB_END (bb))

13718

@@ -505,7 +509,10 @@

13719

n_insns -= 2 * n_matching;

13720

}

13721

13722

- if (then_start && else_start)

13723

+ if (then_start

13724

+ && else_start

13725

+ && then_n_insns > n_matching

13726

+ && else_n_insns > n_matching)

13727

{

13728

int longest_match = MIN (then_n_insns - n_matching,

13729

else_n_insns - n_matching);

13730

Index: gcc/expr.c

13731

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

13732

--- a/src/gcc/expr.c (.../tags/gcc_4_8_2_release)

13733

+++ b/src/gcc/expr.c (.../branches/gcc-4_8-branch)

13734

@@ -1994,12 +1994,14 @@

13735

HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));

13736

enum machine_mode mode = GET_MODE (tmps[i]);

13737

unsigned int bytelen = GET_MODE_SIZE (mode);

13738

- unsigned int adj_bytelen = bytelen;

13739

+ unsigned int adj_bytelen;

13740

rtx dest = dst;

13741

13742

/* Handle trailing fragments that run over the size of the struct. */

13743

if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)

13744

adj_bytelen = ssize - bytepos;

13745

+ else

13746

+ adj_bytelen = bytelen;

13747

13748

if (GET_CODE (dst) == CONCAT)

13749

{

13750

@@ -2040,6 +2042,7 @@

13751

}

13752

}

13753

13754

+ /* Handle trailing fragments that run over the size of the struct. */

13755

if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)

13756

{

13757

/* store_bit_field always takes its value from the lsb.

13758

@@ -2057,16 +2060,22 @@

13759

tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],

13760

shift, tmps[i], 0);

13761

}

13762

- bytelen = adj_bytelen;

13763

+

13764

+ /* Make sure not to write past the end of the struct. */

13765

+ store_bit_field (dest,

13766

+ adj_bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,

13767

+ bytepos * BITS_PER_UNIT, ssize * BITS_PER_UNIT - 1,

13768

+ VOIDmode, tmps[i]);

13769

}

13770

13771

/* Optimize the access just a bit. */

13772

- if (MEM_P (dest)

13773

- && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))

13774

- || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))

13775

- && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0

13776

- && bytelen == GET_MODE_SIZE (mode))

13777

+ else if (MEM_P (dest)

13778

+ && (!SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))

13779

+ || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))

13780

+ && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0

13781

+ && bytelen == GET_MODE_SIZE (mode))

13782

emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);

13783

+

13784

else

13785

store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,

13786

0, 0, mode, tmps[i]);

13787

@@ -4551,19 +4560,19 @@

13788

- tree_low_cst (DECL_FIELD_BIT_OFFSET (repr), 1));

13789

13790

/* If the adjustment is larger than bitpos, we would have a negative bit

13791

- position for the lower bound and this may wreak havoc later. This can

13792

- occur only if we have a non-null offset, so adjust offset and bitpos

13793

- to make the lower bound non-negative. */

13794

+ position for the lower bound and this may wreak havoc later. Adjust

13795

+ offset and bitpos to make the lower bound non-negative in that case. */

13796

if (bitoffset > *bitpos)

13797

{

13798

HOST_WIDE_INT adjust = bitoffset - *bitpos;

13799

-

13800

gcc_assert ((adjust % BITS_PER_UNIT) == 0);

13801

- gcc_assert (*offset != NULL_TREE);

13802

13803

*bitpos += adjust;

13804

- *offset

13805

- = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));

13806

+ if (*offset == NULL_TREE)

13807

+ *offset = size_int (-adjust / BITS_PER_UNIT);

13808

+ else

13809

+ *offset

13810

+ = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));

13811

*bitstart = 0;

13812

}

13813

else

13814

@@ -4668,8 +4677,7 @@

13815

expand_insn (icode, 2, ops);

13816

}

13817

else

13818

- store_bit_field (mem, GET_MODE_BITSIZE (mode),

13819

- 0, 0, 0, mode, reg);

13820

+ store_bit_field (mem, GET_MODE_BITSIZE (mode), 0, 0, 0, mode, reg);

13821

return;

13822

}

13823

13824

@@ -4698,6 +4706,15 @@

13825

tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,

13826

&unsignedp, &volatilep, true);

13827

13828

+ /* Make sure bitpos is not negative, it can wreak havoc later. */

13829

+ if (bitpos < 0)

13830

+ {

13831

+ gcc_assert (offset == NULL_TREE);

13832

+ offset = size_int (bitpos >> (BITS_PER_UNIT == 8

13833

+ ? 3 : exact_log2 (BITS_PER_UNIT)));

13834

+ bitpos &= BITS_PER_UNIT - 1;

13835

+ }

13836

+

13837

if (TREE_CODE (to) == COMPONENT_REF

13838

&& DECL_BIT_FIELD_TYPE (TREE_OPERAND (to, 1)))

13839

get_bit_range (&bitregion_start, &bitregion_end, to, &bitpos, &offset);

13840

Index: gcc/go/go-gcc.cc

13841

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

13842

--- a/src/gcc/go/go-gcc.cc (.../tags/gcc_4_8_2_release)

13843

+++ b/src/gcc/go/go-gcc.cc (.../branches/gcc-4_8-branch)

13844

@@ -232,6 +232,9 @@

13845

Bexpression*

13846

convert_expression(Btype* type, Bexpression* expr, Location);

13847

13848

+ Bexpression*

13849

+ function_code_expression(Bfunction*, Location);

13850

+

13851

// Statements.

13852

13853

Bstatement*

13854

@@ -334,6 +337,17 @@

13855

Bexpression*

13856

label_address(Blabel*, Location);

13857

13858

+ // Functions.

13859

+

13860

+ Bfunction*

13861

+ error_function()

13862

+ { return this->make_function(error_mark_node); }

13863

+

13864

+ Bfunction*

13865

+ function(Btype* fntype, const std::string& name, const std::string& asm_name,

13866

+ bool is_visible, bool is_declaration, bool is_inlinable,

13867

+ bool disable_split_stack, bool in_unique_section, Location);

13868

+

13869

private:

13870

// Make a Bexpression from a tree.

13871

Bexpression*

13872

@@ -350,6 +364,10 @@

13873

make_type(tree t)

13874

{ return new Btype(t); }

13875

13876

+ Bfunction*

13877

+ make_function(tree t)

13878

+ { return new Bfunction(t); }

13879

+

13880

Btype*

13881

fill_in_struct(Btype*, const std::vector<Btyped_identifier>&);

13882

13883

@@ -966,6 +984,19 @@

13884

return tree_to_expr(ret);

13885

}

13886

13887

+// Get the address of a function.

13888

+

13889

+Bexpression*

13890

+Gcc_backend::function_code_expression(Bfunction* bfunc, Location location)

13891

+{

13892

+ tree func = bfunc->get_tree();

13893

+ if (func == error_mark_node)

13894

+ return this->error_expression();

13895

+

13896

+ tree ret = build_fold_addr_expr_loc(location.gcc_location(), func);

13897

+ return this->make_expression(ret);

13898

+}

13899

+

13900

// An expression as a statement.

13901

13902

Bstatement*

13903

@@ -1724,6 +1755,56 @@

13904

return this->make_expression(ret);

13905

}

13906

13907

+// Declare or define a new function.

13908

+

13909

+Bfunction*

13910

+Gcc_backend::function(Btype* fntype, const std::string& name,

13911

+ const std::string& asm_name, bool is_visible,

13912

+ bool is_declaration, bool is_inlinable,

13913

+ bool disable_split_stack, bool in_unique_section,

13914

+ Location location)

13915

+{

13916

+ tree functype = fntype->get_tree();

13917

+ if (functype != error_mark_node)

13918

+ {

13919

+ gcc_assert(FUNCTION_POINTER_TYPE_P(functype));

13920

+ functype = TREE_TYPE(functype);

13921

+ }

13922

+ tree id = get_identifier_from_string(name);

13923

+ if (functype == error_mark_node || id == error_mark_node)

13924

+ return this->error_function();

13925

+

13926

+ tree decl = build_decl(location.gcc_location(), FUNCTION_DECL, id, functype);

13927

+ if (!asm_name.empty())

13928

+ SET_DECL_ASSEMBLER_NAME(decl, get_identifier_from_string(asm_name));

13929

+ if (is_visible)

13930

+ TREE_PUBLIC(decl) = 1;

13931

+ if (is_declaration)

13932

+ DECL_EXTERNAL(decl) = 1;

13933

+ else

13934

+ {

13935

+ tree restype = TREE_TYPE(functype);

13936

+ tree resdecl =

13937

+ build_decl(location.gcc_location(), RESULT_DECL, NULL_TREE, restype);

13938

+ DECL_ARTIFICIAL(resdecl) = 1;

13939

+ DECL_IGNORED_P(resdecl) = 1;

13940

+ DECL_CONTEXT(resdecl) = decl;

13941

+ DECL_RESULT(decl) = resdecl;

13942

+ }

13943

+ if (!is_inlinable)

13944

+ DECL_UNINLINABLE(decl) = 1;

13945

+ if (disable_split_stack)

13946

+ {

13947

+ tree attr = get_identifier("__no_split_stack__");

13948

+ DECL_ATTRIBUTES(decl) = tree_cons(attr, NULL_TREE, NULL_TREE);

13949

+ }

13950

+ if (in_unique_section)

13951

+ resolve_unique_section(decl, 0, 1);

13952

+

13953

+ go_preserve_from_gc(decl);

13954

+ return new Bfunction(decl);

13955

+}

13956

+

13957

// The single backend.

13958

13959

static Gcc_backend gcc_backend;

13960

@@ -1799,3 +1880,9 @@

13961

{

13962

return bv->get_tree();

13963

}

13964

+

13965

+tree

13966

+function_to_tree(Bfunction* bf)

13967

+{

13968

+ return bf->get_tree();

13969

+}

13970

Index: gcc/go/ChangeLog

13971

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

13972

--- a/src/gcc/go/ChangeLog (.../tags/gcc_4_8_2_release)

13973

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

13974

@@ -1,3 +1,22 @@

13975

+2013-12-11 Ian Lance Taylor <iant@google.com>

13976

+

13977

+ * go-lang.c (go_langhook_post_options): Disable sibling calls by

13978

+ default.

13979

+

13980

+2013-10-16 Ian Lance Taylor <iant@google.com>

13981

+

13982

+ Bring in from mainline:

13983

+

13984

+ 2013-10-11 Chris Manghane <cmang@google.com>

13985

+ * go-gcc.cc (Gcc_backend::function_code_expression): New

13986

+ function.

13987

+

13988

+ 2013-10-10 Chris Manghane <cmang@google.com>

13989

+ * go-gcc.cc (Backend::error_function): New function.

13990

+ (Backend::function): New function.

13991

+ (Backend::make_function): New function.

13992

+ (function_to_tree): New function.

13993

+

13994

2013-10-16 Release Manager

13995

13996

* GCC 4.8.2 released.

13997

Index: gcc/go/go-lang.c

13998

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

13999

--- a/src/gcc/go/go-lang.c (.../tags/gcc_4_8_2_release)

14000

+++ b/src/gcc/go/go-lang.c (.../branches/gcc-4_8-branch)

14001

@@ -269,6 +269,10 @@

14002

if (flag_excess_precision_cmdline == EXCESS_PRECISION_DEFAULT)

14003

flag_excess_precision_cmdline = EXCESS_PRECISION_STANDARD;

14004

14005

+ /* Tail call optimizations can confuse uses of runtime.Callers. */

14006

+ if (!global_options_set.x_flag_optimize_sibling_calls)

14007

+ global_options.x_flag_optimize_sibling_calls = 0;

14008

+

14009

/* Returning false means that the backend should be used. */

14010

return false;

14011

}

14012

Index: gcc/go/gofrontend/gogo.cc

14013

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

14014

--- a/src/gcc/go/gofrontend/gogo.cc (.../tags/gcc_4_8_2_release)

14015

+++ b/src/gcc/go/gofrontend/gogo.cc (.../branches/gcc-4_8-branch)

14016

@@ -2822,7 +2822,10 @@

14017

if (orig_fntype->is_varargs())

14018

new_fntype->set_is_varargs();

14019

14020

- std::string name = orig_no->name() + "$recover";

14021

+ std::string name = orig_no->name();

14022

+ if (orig_fntype->is_method())

14023

+ name += "$" + orig_fntype->receiver()->type()->mangled_name(gogo);

14024

+ name += "$recover";

14025

Named_object *new_no = gogo->start_function(name, new_fntype, false,

14026

location);

14027

Function *new_func = new_no->func_value();

14028

@@ -2916,7 +2919,25 @@

14029

&& !orig_rec_no->var_value()->is_receiver());

14030

orig_rec_no->var_value()->set_is_receiver();

14031

14032

- const std::string& new_receiver_name(orig_fntype->receiver()->name());

14033

+ std::string new_receiver_name(orig_fntype->receiver()->name());

14034

+ if (new_receiver_name.empty())

14035

+ {

14036

+ // Find the receiver. It was named "r.NNN" in

14037

+ // Gogo::start_function.

14038

+ for (Bindings::const_definitions_iterator p =

14039

+ new_bindings->begin_definitions();

14040

+ p != new_bindings->end_definitions();

14041

+ ++p)

14042

+ {

14043

+ const std::string& pname((*p)->name());

14044

+ if (pname[0] == 'r' && pname[1] == '.')

14045

+ {

14046

+ new_receiver_name = pname;

14047

+ break;

14048

+ }

14049

+ }

14050

+ go_assert(!new_receiver_name.empty());

14051

+ }

14052

Named_object* new_rec_no = new_bindings->lookup_local(new_receiver_name);

14053

if (new_rec_no == NULL)

14054

go_assert(saw_errors());

14055

@@ -3320,7 +3341,8 @@

14056

closure_var_(NULL), block_(block), location_(location), labels_(),

14057

local_type_count_(0), descriptor_(NULL), fndecl_(NULL), defer_stack_(NULL),

14058

is_sink_(false), results_are_named_(false), nointerface_(false),

14059

- calls_recover_(false), is_recover_thunk_(false), has_recover_thunk_(false),

14060

+ is_unnamed_type_stub_method_(false), calls_recover_(false),

14061

+ is_recover_thunk_(false), has_recover_thunk_(false),

14062

in_unique_section_(false)

14063

{

14064

}

14065

@@ -3819,6 +3841,81 @@

14066

*presults = results;

14067

}

14068

14069

+// Get the backend representation.

14070

+

14071

+Bfunction*

14072

+Function::get_or_make_decl(Gogo* gogo, Named_object* no)

14073

+{

14074

+ if (this->fndecl_ == NULL)

14075

+ {

14076

+ std::string asm_name;

14077

+ bool is_visible = false;

14078

+ if (no->package() != NULL)

14079

+ ;

14080

+ else if (this->enclosing_ != NULL || Gogo::is_thunk(no))

14081

+ ;

14082

+ else if (Gogo::unpack_hidden_name(no->name()) == "init"

14083

+ && !this->type_->is_method())

14084

+ ;

14085

+ else if (Gogo::unpack_hidden_name(no->name()) == "main"

14086

+ && gogo->is_main_package())

14087

+ is_visible = true;

14088

+ // Methods have to be public even if they are hidden because

14089

+ // they can be pulled into type descriptors when using

14090

+ // anonymous fields.

14091

+ else if (!Gogo::is_hidden_name(no->name())

14092

+ || this->type_->is_method())

14093

+ {

14094

+ if (!this->is_unnamed_type_stub_method_)

14095

+ is_visible = true;

14096

+ std::string pkgpath = gogo->pkgpath_symbol();

14097

+ if (this->type_->is_method()

14098

+ && Gogo::is_hidden_name(no->name())

14099

+ && Gogo::hidden_name_pkgpath(no->name()) != gogo->pkgpath())

14100

+ {

14101

+ // This is a method we created for an unexported

14102

+ // method of an imported embedded type. We need to

14103

+ // use the pkgpath of the imported package to avoid

14104

+ // a possible name collision. See bug478 for a test

14105

+ // case.

14106

+ pkgpath = Gogo::hidden_name_pkgpath(no->name());

14107

+ pkgpath = Gogo::pkgpath_for_symbol(pkgpath);

14108

+ }

14109

+

14110

+ asm_name = pkgpath;

14111

+ asm_name.append(1, '.');

14112

+ asm_name.append(Gogo::unpack_hidden_name(no->name()));

14113

+ if (this->type_->is_method())

14114

+ {

14115

+ asm_name.append(1, '.');

14116

+ Type* rtype = this->type_->receiver()->type();

14117

+ asm_name.append(rtype->mangled_name(gogo));

14118

+ }

14119

+ }

14120

+

14121

+ // If a function calls the predeclared recover function, we

14122

+ // can't inline it, because recover behaves differently in a

14123

+ // function passed directly to defer. If this is a recover

14124

+ // thunk that we built to test whether a function can be

14125

+ // recovered, we can't inline it, because that will mess up

14126

+ // our return address comparison.

14127

+ bool is_inlinable = !(this->calls_recover_ || this->is_recover_thunk_);

14128

+

14129

+ // If this is a thunk created to call a function which calls

14130

+ // the predeclared recover function, we need to disable

14131

+ // stack splitting for the thunk.

14132

+ bool disable_split_stack = this->is_recover_thunk_;

14133

+

14134

+ Btype* functype = this->type_->get_backend_fntype(gogo);

14135

+ this->fndecl_ =

14136

+ gogo->backend()->function(functype, no->get_id(gogo), asm_name,

14137

+ is_visible, false, is_inlinable,

14138

+ disable_split_stack,

14139

+ this->in_unique_section_, this->location());

14140

+ }

14141

+ return this->fndecl_;

14142

+}

14143

+

14144

// Class Block.

14145

14146

Block::Block(Block* enclosing, Location location)

14147

@@ -5110,6 +5207,75 @@

14148

go_unreachable();

14149

}

14150

14151

+

14152

+// Return the external identifier for this object.

14153

+

14154

+std::string

14155

+Named_object::get_id(Gogo* gogo)

14156

+{

14157

+ go_assert(!this->is_variable() && !this->is_result_variable());

14158

+ std::string decl_name;

14159

+ if (this->is_function_declaration()

14160

+ && !this->func_declaration_value()->asm_name().empty())

14161

+ decl_name = this->func_declaration_value()->asm_name();

14162

+ else if (this->is_type()

14163

+ && Linemap::is_predeclared_location(this->type_value()->location()))

14164

+ {

14165

+ // We don't need the package name for builtin types.

14166

+ decl_name = Gogo::unpack_hidden_name(this->name_);

14167

+ }

14168

+ else

14169

+ {

14170

+ std::string package_name;

14171

+ if (this->package_ == NULL)

14172

+ package_name = gogo->package_name();

14173

+ else

14174

+ package_name = this->package_->package_name();

14175

+

14176

+ // Note that this will be misleading if this is an unexported

14177

+ // method generated for an embedded imported type. In that case

14178

+ // the unexported method should have the package name of the

14179

+ // package from which it is imported, but we are going to give

14180

+ // it our package name. Fixing this would require knowing the

14181

+ // package name, but we only know the package path. It might be

14182

+ // better to use package paths here anyhow. This doesn't affect

14183

+ // the assembler code, because we always set that name in

14184

+ // Function::get_or_make_decl anyhow. FIXME.

14185

+

14186

+ decl_name = package_name + '.' + Gogo::unpack_hidden_name(this->name_);

14187

+

14188

+ Function_type* fntype;

14189

+ if (this->is_function())

14190

+ fntype = this->func_value()->type();

14191

+ else if (this->is_function_declaration())

14192

+ fntype = this->func_declaration_value()->type();

14193

+ else

14194

+ fntype = NULL;

14195

+ if (fntype != NULL && fntype->is_method())

14196

+ {

14197

+ decl_name.push_back('.');

14198

+ decl_name.append(fntype->receiver()->type()->mangled_name(gogo));

14199

+ }

14200

+ }

14201

+ if (this->is_type())

14202

+ {

14203

+ unsigned int index;

14204

+ const Named_object* in_function = this->type_value()->in_function(&index);

14205

+ if (in_function != NULL)

14206

+ {

14207

+ decl_name += '$' + Gogo::unpack_hidden_name(in_function->name());

14208

+ if (index > 0)

14209

+ {

14210

+ char buf[30];

14211

+ snprintf(buf, sizeof buf, "%u", index);

14212

+ decl_name += '$';

14213

+ decl_name += buf;

14214

+ }

14215

+ }

14216

+ }

14217

+ return decl_name;

14218

+}

14219

+

14220

// Class Bindings.

14221

14222

Bindings::Bindings(Bindings* enclosing)

14223

Index: gcc/go/gofrontend/runtime.def

14224

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

14225

--- a/src/gcc/go/gofrontend/runtime.def (.../tags/gcc_4_8_2_release)

14226

+++ b/src/gcc/go/gofrontend/runtime.def (.../branches/gcc-4_8-branch)

14227

@@ -68,6 +68,12 @@

14228

P1(STRING), R1(SLICE))

14229

14230

14231

+// Complex division.

14232

+DEF_GO_RUNTIME(COMPLEX64_DIV, "__go_complex64_div",

14233

+ P2(COMPLEX64, COMPLEX64), R1(COMPLEX64))

14234

+DEF_GO_RUNTIME(COMPLEX128_DIV, "__go_complex128_div",

14235

+ P2(COMPLEX128, COMPLEX128), R1(COMPLEX128))

14236

+

14237

// Make a slice.

14238

DEF_GO_RUNTIME(MAKESLICE1, "__go_make_slice1", P2(TYPE, UINTPTR), R1(SLICE))

14239

DEF_GO_RUNTIME(MAKESLICE2, "__go_make_slice2", P3(TYPE, UINTPTR, UINTPTR),

14240

Index: gcc/go/gofrontend/gogo.h

14241

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

14242

--- a/src/gcc/go/gofrontend/gogo.h (.../tags/gcc_4_8_2_release)

14243

+++ b/src/gcc/go/gofrontend/gogo.h (.../branches/gcc-4_8-branch)

14244

@@ -48,6 +48,7 @@

14245

class Bblock;

14246

class Bvariable;

14247

class Blabel;

14248

+class Bfunction;

14249

14250

// This file declares the basic classes used to hold the internal

14251

// representation of Go which is built by the parser.

14252

@@ -952,6 +953,15 @@

14253

this->nointerface_ = true;

14254

}

14255

14256

+ // Record that this function is a stub method created for an unnamed

14257

+ // type.

14258

+ void

14259

+ set_is_unnamed_type_stub_method()

14260

+ {

14261

+ go_assert(this->is_method());

14262

+ this->is_unnamed_type_stub_method_ = true;

14263

+ }

14264

+

14265

// Add a new field to the closure variable.

14266

void

14267

add_closure_field(Named_object* var, Location loc)

14268

@@ -1089,17 +1099,13 @@

14269

this->descriptor_ = descriptor;

14270

}

14271

14272

- // Return the function's decl given an identifier.

14273

- tree

14274

- get_or_make_decl(Gogo*, Named_object*, tree id);

14275

+ // Return the backend representation.

14276

+ Bfunction*

14277

+ get_or_make_decl(Gogo*, Named_object*);

14278

14279

// Return the function's decl after it has been built.

14280

tree

14281

- get_decl() const

14282

- {

14283

- go_assert(this->fndecl_ != NULL);

14284

- return this->fndecl_;

14285

- }

14286

+ get_decl() const;

14287

14288

// Set the function decl to hold a tree of the function code.

14289

void

14290

@@ -1170,7 +1176,7 @@

14291

// The function descriptor, if any.

14292

Expression* descriptor_;

14293

// The function decl.

14294

- tree fndecl_;

14295

+ Bfunction* fndecl_;

14296

// The defer stack variable. A pointer to this variable is used to

14297

// distinguish the defer stack for one function from another. This

14298

// is NULL unless we actually need a defer stack.

14299

@@ -1181,6 +1187,9 @@

14300

bool results_are_named_ : 1;

14301

// True if this method should not be included in the type descriptor.

14302

bool nointerface_ : 1;

14303

+ // True if this function is a stub method created for an unnamed

14304

+ // type.

14305

+ bool is_unnamed_type_stub_method_ : 1;

14306

// True if this function calls the predeclared recover function.

14307

bool calls_recover_ : 1;

14308

// True if this a thunk built for a function which calls recover.

14309

@@ -1265,9 +1274,9 @@

14310

has_descriptor() const

14311

{ return this->descriptor_ != NULL; }

14312

14313

- // Return a decl for the function given an identifier.

14314

- tree

14315

- get_or_make_decl(Gogo*, Named_object*, tree id);

14316

+ // Return a backend representation.

14317

+ Bfunction*

14318

+ get_or_make_decl(Gogo*, Named_object*);

14319

14320

// If there is a descriptor, build it into the backend

14321

// representation.

14322

@@ -1290,7 +1299,7 @@

14323

// The function descriptor, if any.

14324

Expression* descriptor_;

14325

// The function decl if needed.

14326

- tree fndecl_;

14327

+ Bfunction* fndecl_;

14328

};

14329

14330

// A variable.

14331

@@ -2181,8 +2190,8 @@

14332

Bvariable*

14333

get_backend_variable(Gogo*, Named_object* function);

14334

14335

- // Return a tree for the external identifier for this object.

14336

- tree

14337

+ // Return the external identifier for this object.

14338

+ std::string

14339

get_id(Gogo*);

14340

14341

// Return a tree representing this object.

14342

Index: gcc/go/gofrontend/types.h

14343

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

14344

--- a/src/gcc/go/gofrontend/types.h (.../tags/gcc_4_8_2_release)

14345

+++ b/src/gcc/go/gofrontend/types.h (.../branches/gcc-4_8-branch)

14346

@@ -1138,6 +1138,13 @@

14347

Function_type* equal_fntype, Named_object** hash_fn,

14348

Named_object** equal_fn);

14349

14350

+ void

14351

+ write_named_hash(Gogo*, Named_type*, Function_type* hash_fntype,

14352

+ Function_type* equal_fntype);

14353

+

14354

+ void

14355

+ write_named_equal(Gogo*, Named_type*);

14356

+

14357

// Build a composite literal for the uncommon type information.

14358

Expression*

14359

uncommon_type_constructor(Gogo*, Type* uncommon_type,

14360

@@ -1717,7 +1724,8 @@

14361

Typed_identifier_list* results, Location location)

14362

: Type(TYPE_FUNCTION),

14363

receiver_(receiver), parameters_(parameters), results_(results),

14364

- location_(location), is_varargs_(false), is_builtin_(false)

14365

+ location_(location), is_varargs_(false), is_builtin_(false),

14366

+ fnbtype_(NULL)

14367

{ }

14368

14369

// Get the receiver.

14370

@@ -1789,6 +1797,12 @@

14371

Function_type*

14372

copy_with_receiver(Type*) const;

14373

14374

+ // Return a copy of this type with the receiver treated as the first

14375

+ // parameter. If WANT_POINTER_RECEIVER is true, the receiver is

14376

+ // forced to be a pointer.

14377

+ Function_type*

14378

+ copy_with_receiver_as_param(bool want_pointer_receiver) const;

14379

+

14380

// Return a copy of this type ignoring any receiver and using dummy

14381

// names for all parameters. This is used for thunks for method

14382

// values.

14383

@@ -1798,6 +1812,11 @@

14384

static Type*

14385

make_function_type_descriptor_type();

14386

14387

+ // Return the backend representation of this function type. This is used

14388

+ // as the real type of a backend function declaration or defintion.

14389

+ Btype*

14390

+ get_backend_fntype(Gogo*);

14391

+

14392

protected:

14393

int

14394

do_traverse(Traverse*);

14395

@@ -1851,6 +1870,9 @@

14396

// Whether this is a special builtin function which can not simply

14397

// be called. This is used for len, cap, etc.

14398

bool is_builtin_;

14399

+ // The backend representation of this type for backend function

14400

+ // declarations and definitions.

14401

+ Btype* fnbtype_;

14402

};

14403

14404

// The type of a pointer.

14405

@@ -1915,7 +1937,7 @@

14406

{

14407

public:

14408

explicit Struct_field(const Typed_identifier& typed_identifier)

14409

- : typed_identifier_(typed_identifier), tag_(NULL)

14410

+ : typed_identifier_(typed_identifier), tag_(NULL), is_imported_(false)

14411

{ }

14412

14413

// The field name.

14414

@@ -1926,6 +1948,10 @@

14415

bool

14416

is_field_name(const std::string& name) const;

14417

14418

+ // Return whether this struct field is an unexported field named NAME.

14419

+ bool

14420

+ is_unexported_field_name(Gogo*, const std::string& name) const;

14421

+

14422

// Return whether this struct field is an embedded built-in type.

14423

bool

14424

is_embedded_builtin(Gogo*) const;

14425

@@ -1963,6 +1989,11 @@

14426

set_tag(const std::string& tag)

14427

{ this->tag_ = new std::string(tag); }

14428

14429

+ // Record that this field is defined in an imported struct.

14430

+ void

14431

+ set_is_imported()

14432

+ { this->is_imported_ = true; }

14433

+

14434

// Set the type. This is only used in error cases.

14435

void

14436

set_type(Type* type)

14437

@@ -1973,6 +2004,8 @@

14438

Typed_identifier typed_identifier_;

14439

// The field tag. This is NULL if the field has no tag.

14440

std::string* tag_;

14441

+ // Whether this field is defined in an imported struct.

14442

+ bool is_imported_;

14443

};

14444

14445

// A list of struct fields.

14446

Index: gcc/go/gofrontend/parse.cc

14447

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

14448

--- a/src/gcc/go/gofrontend/parse.cc (.../tags/gcc_4_8_2_release)

14449

+++ b/src/gcc/go/gofrontend/parse.cc (.../branches/gcc-4_8-branch)

14450

@@ -744,6 +744,8 @@

14451

return NULL;

14452

14453

Parse::Names names;

14454

+ if (receiver != NULL)

14455

+ names[receiver->name()] = receiver;

14456

if (params != NULL)

14457

this->check_signature_names(params, &names);

14458

if (results != NULL)

14459

Index: gcc/go/gofrontend/import.h

14460

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

14461

--- a/src/gcc/go/gofrontend/import.h (.../tags/gcc_4_8_2_release)

14462

+++ b/src/gcc/go/gofrontend/import.h (.../branches/gcc-4_8-branch)

14463

@@ -149,6 +149,11 @@

14464

location() const

14465

{ return this->location_; }

14466

14467

+ // Return the package we are importing.

14468

+ Package*

14469

+ package() const

14470

+ { return this->package_; }

14471

+

14472

// Return the next character.

14473

int

14474

peek_char()

14475

Index: gcc/go/gofrontend/runtime.cc

14476

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

14477

--- a/src/gcc/go/gofrontend/runtime.cc (.../tags/gcc_4_8_2_release)

14478

+++ b/src/gcc/go/gofrontend/runtime.cc (.../branches/gcc-4_8-branch)

14479

@@ -42,6 +42,8 @@

14480

RFT_RUNE,

14481

// Go type float64, C type double.

14482

RFT_FLOAT64,

14483

+ // Go type complex64, C type __complex float.

14484

+ RFT_COMPLEX64,

14485

// Go type complex128, C type __complex double.

14486

RFT_COMPLEX128,

14487

// Go type string, C type struct __go_string.

14488

@@ -126,6 +128,10 @@

14489

t = Type::lookup_float_type("float64");

14490

break;

14491

14492

+ case RFT_COMPLEX64:

14493

+ t = Type::lookup_complex_type("complex64");

14494

+ break;

14495

+

14496

case RFT_COMPLEX128:

14497

t = Type::lookup_complex_type("complex128");

14498

break;

14499

@@ -216,6 +222,7 @@

14500

case RFT_UINTPTR:

14501

case RFT_RUNE:

14502

case RFT_FLOAT64:

14503

+ case RFT_COMPLEX64:

14504

case RFT_COMPLEX128:

14505

case RFT_STRING:

14506

case RFT_POINTER:

14507

Index: gcc/go/gofrontend/expressions.h

14508

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

14509

--- a/src/gcc/go/gofrontend/expressions.h (.../tags/gcc_4_8_2_release)

14510

+++ b/src/gcc/go/gofrontend/expressions.h (.../branches/gcc-4_8-branch)

14511

@@ -1514,8 +1514,8 @@

14512

closure()

14513

{ return this->closure_; }

14514

14515

- // Return a tree for the code for a function.

14516

- static tree

14517

+ // Return a backend expression for the code of a function.

14518

+ static Bexpression*

14519

get_code_pointer(Gogo*, Named_object* function, Location loc);

14520

14521

protected:

14522

Index: gcc/go/gofrontend/gogo-tree.cc

14523

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

14524

--- a/src/gcc/go/gofrontend/gogo-tree.cc (.../tags/gcc_4_8_2_release)

14525

+++ b/src/gcc/go/gofrontend/gogo-tree.cc (.../branches/gcc-4_8-branch)

14526

@@ -985,74 +985,6 @@

14527

delete[] vec;

14528

}

14529

14530

-// Get a tree for the identifier for a named object.

14531

-

14532

-tree

14533

-Named_object::get_id(Gogo* gogo)

14534

-{

14535

- go_assert(!this->is_variable() && !this->is_result_variable());

14536

- std::string decl_name;

14537

- if (this->is_function_declaration()

14538

- && !this->func_declaration_value()->asm_name().empty())

14539

- decl_name = this->func_declaration_value()->asm_name();

14540

- else if (this->is_type()

14541

- && Linemap::is_predeclared_location(this->type_value()->location()))

14542

- {

14543

- // We don't need the package name for builtin types.

14544

- decl_name = Gogo::unpack_hidden_name(this->name_);

14545

- }

14546

- else

14547

- {

14548

- std::string package_name;

14549

- if (this->package_ == NULL)

14550

- package_name = gogo->package_name();

14551

- else

14552

- package_name = this->package_->package_name();

14553

-

14554

- // Note that this will be misleading if this is an unexported

14555

- // method generated for an embedded imported type. In that case

14556

- // the unexported method should have the package name of the

14557

- // package from which it is imported, but we are going to give

14558

- // it our package name. Fixing this would require knowing the

14559

- // package name, but we only know the package path. It might be

14560

- // better to use package paths here anyhow. This doesn't affect

14561

- // the assembler code, because we always set that name in

14562

- // Function::get_or_make_decl anyhow. FIXME.

14563

-

14564

- decl_name = package_name + '.' + Gogo::unpack_hidden_name(this->name_);

14565

-

14566

- Function_type* fntype;

14567

- if (this->is_function())

14568

- fntype = this->func_value()->type();

14569

- else if (this->is_function_declaration())

14570

- fntype = this->func_declaration_value()->type();

14571

- else

14572

- fntype = NULL;

14573

- if (fntype != NULL && fntype->is_method())

14574

- {

14575

- decl_name.push_back('.');

14576

- decl_name.append(fntype->receiver()->type()->mangled_name(gogo));

14577

- }

14578

- }

14579

- if (this->is_type())

14580

- {

14581

- unsigned int index;

14582

- const Named_object* in_function = this->type_value()->in_function(&index);

14583

- if (in_function != NULL)

14584

- {

14585

- decl_name += '$' + Gogo::unpack_hidden_name(in_function->name());

14586

- if (index > 0)

14587

- {

14588

- char buf[30];

14589

- snprintf(buf, sizeof buf, "%u", index);

14590

- decl_name += '$';

14591

- decl_name += buf;

14592

- }

14593

- }

14594

- }

14595

- return get_identifier_from_string(decl_name);

14596

-}

14597

-

14598

// Get a tree for a named object.

14599

14600

tree

14601

@@ -1067,11 +999,6 @@

14602

return error_mark_node;

14603

}

14604

14605

- tree name;

14606

- if (this->classification_ == NAMED_OBJECT_TYPE)

14607

- name = NULL_TREE;

14608

- else

14609

- name = this->get_id(gogo);

14610

tree decl;

14611

switch (this->classification_)

14612

{

14613

@@ -1099,6 +1026,7 @@

14614

decl = error_mark_node;

14615

else if (INTEGRAL_TYPE_P(TREE_TYPE(expr_tree)))

14616

{

14617

+ tree name = get_identifier_from_string(this->get_id(gogo));

14618

decl = build_decl(named_constant->location().gcc_location(),

14619

CONST_DECL, name, TREE_TYPE(expr_tree));

14620

DECL_INITIAL(decl) = expr_tree;

14621

@@ -1161,7 +1089,7 @@

14622

case NAMED_OBJECT_FUNC:

14623

{

14624

Function* func = this->u_.func_value;

14625

- decl = func->get_or_make_decl(gogo, this, name);

14626

+ decl = function_to_tree(func->get_or_make_decl(gogo, this));

14627

if (decl != error_mark_node)

14628

{

14629

if (func->block() != NULL)

14630

@@ -1286,124 +1214,13 @@

14631

return block_tree;

14632

}

14633

14634

-// Get a tree for a function decl.

14635

+// Get the backend representation.

14636

14637

-tree

14638

-Function::get_or_make_decl(Gogo* gogo, Named_object* no, tree id)

14639

+Bfunction*

14640

+Function_declaration::get_or_make_decl(Gogo* gogo, Named_object* no)

14641

{

14642

- if (this->fndecl_ == NULL_TREE)

14643

+ if (this->fndecl_ == NULL)

14644

{

14645

- tree functype = type_to_tree(this->type_->get_backend(gogo));

14646

-

14647

- if (functype != error_mark_node)

14648

- {

14649

- // The type of a function comes back as a pointer to a

14650

- // struct whose first field is the function, but we want the

14651

- // real function type for a function declaration.

14652

- go_assert(POINTER_TYPE_P(functype)

14653

- && TREE_CODE(TREE_TYPE(functype)) == RECORD_TYPE);

14654

- functype = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(functype)));

14655

- go_assert(FUNCTION_POINTER_TYPE_P(functype));

14656

- functype = TREE_TYPE(functype);

14657

- }

14658

-

14659

- if (functype == error_mark_node)

14660

- this->fndecl_ = error_mark_node;

14661

- else

14662

- {

14663

- tree decl = build_decl(this->location().gcc_location(), FUNCTION_DECL,

14664

- id, functype);

14665

-

14666

- this->fndecl_ = decl;

14667

-

14668

- if (no->package() != NULL)

14669

- ;

14670

- else if (this->enclosing_ != NULL || Gogo::is_thunk(no))

14671

- ;

14672

- else if (Gogo::unpack_hidden_name(no->name()) == "init"

14673

- && !this->type_->is_method())

14674

- ;

14675

- else if (Gogo::unpack_hidden_name(no->name()) == "main"

14676

- && gogo->is_main_package())

14677

- TREE_PUBLIC(decl) = 1;

14678

- // Methods have to be public even if they are hidden because

14679

- // they can be pulled into type descriptors when using

14680

- // anonymous fields.

14681

- else if (!Gogo::is_hidden_name(no->name())

14682

- || this->type_->is_method())

14683

- {

14684

- TREE_PUBLIC(decl) = 1;

14685

- std::string pkgpath = gogo->pkgpath_symbol();

14686

- if (this->type_->is_method()

14687

- && Gogo::is_hidden_name(no->name())

14688

- && Gogo::hidden_name_pkgpath(no->name()) != gogo->pkgpath())

14689

- {

14690

- // This is a method we created for an unexported

14691

- // method of an imported embedded type. We need to

14692

- // use the pkgpath of the imported package to avoid

14693

- // a possible name collision. See bug478 for a test

14694

- // case.

14695

- pkgpath = Gogo::hidden_name_pkgpath(no->name());

14696

- pkgpath = Gogo::pkgpath_for_symbol(pkgpath);

14697

- }

14698

-

14699

- std::string asm_name = pkgpath;

14700

- asm_name.append(1, '.');

14701

- asm_name.append(Gogo::unpack_hidden_name(no->name()));

14702

- if (this->type_->is_method())

14703

- {

14704

- asm_name.append(1, '.');

14705

- Type* rtype = this->type_->receiver()->type();

14706

- asm_name.append(rtype->mangled_name(gogo));

14707

- }

14708

- SET_DECL_ASSEMBLER_NAME(decl,

14709

- get_identifier_from_string(asm_name));

14710

- }

14711

-

14712

- // Why do we have to do this in the frontend?

14713

- tree restype = TREE_TYPE(functype);

14714

- tree resdecl =

14715

- build_decl(this->location().gcc_location(), RESULT_DECL, NULL_TREE,

14716

- restype);

14717

- DECL_ARTIFICIAL(resdecl) = 1;

14718

- DECL_IGNORED_P(resdecl) = 1;

14719

- DECL_CONTEXT(resdecl) = decl;

14720

- DECL_RESULT(decl) = resdecl;

14721

-

14722

- // If a function calls the predeclared recover function, we

14723

- // can't inline it, because recover behaves differently in a

14724

- // function passed directly to defer. If this is a recover

14725

- // thunk that we built to test whether a function can be

14726

- // recovered, we can't inline it, because that will mess up

14727

- // our return address comparison.

14728

- if (this->calls_recover_ || this->is_recover_thunk_)

14729

- DECL_UNINLINABLE(decl) = 1;

14730

-

14731

- // If this is a thunk created to call a function which calls

14732

- // the predeclared recover function, we need to disable

14733

- // stack splitting for the thunk.

14734

- if (this->is_recover_thunk_)

14735

- {

14736

- tree attr = get_identifier("__no_split_stack__");

14737

- DECL_ATTRIBUTES(decl) = tree_cons(attr, NULL_TREE, NULL_TREE);

14738

- }

14739

-

14740

- if (this->in_unique_section_)

14741

- resolve_unique_section (decl, 0, 1);

14742

-

14743

- go_preserve_from_gc(decl);

14744

- }

14745

- }

14746

- return this->fndecl_;

14747

-}

14748

-

14749

-// Get a tree for a function declaration.

14750

-

14751

-tree

14752

-Function_declaration::get_or_make_decl(Gogo* gogo, Named_object* no, tree id)

14753

-{

14754

- if (this->fndecl_ == NULL_TREE)

14755

- {

14756

// Let Go code use an asm declaration to pick up a builtin

14757

// function.

14758

if (!this->asm_name_.empty())

14759

@@ -1412,58 +1229,46 @@

14760

builtin_functions.find(this->asm_name_);

14761

if (p != builtin_functions.end())

14762

{

14763

- this->fndecl_ = p->second;

14764

+ this->fndecl_ = tree_to_function(p->second);

14765

return this->fndecl_;

14766

}

14767

}

14768

14769

- tree functype = type_to_tree(this->fntype_->get_backend(gogo));

14770

+ std::string asm_name;

14771

+ if (this->asm_name_.empty())

14772

+ {

14773

+ asm_name = (no->package() == NULL

14774

+ ? gogo->pkgpath_symbol()

14775

+ : no->package()->pkgpath_symbol());

14776

+ asm_name.append(1, '.');

14777

+ asm_name.append(Gogo::unpack_hidden_name(no->name()));

14778

+ if (this->fntype_->is_method())

14779

+ {

14780

+ asm_name.append(1, '.');

14781

+ Type* rtype = this->fntype_->receiver()->type();

14782

+ asm_name.append(rtype->mangled_name(gogo));

14783

+ }

14784

+ }

14785

14786

- if (functype != error_mark_node)

14787

- {

14788

- // The type of a function comes back as a pointer to a

14789

- // struct whose first field is the function, but we want the

14790

- // real function type for a function declaration.

14791

- go_assert(POINTER_TYPE_P(functype)

14792

- && TREE_CODE(TREE_TYPE(functype)) == RECORD_TYPE);

14793

- functype = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(functype)));

14794

- go_assert(FUNCTION_POINTER_TYPE_P(functype));

14795

- functype = TREE_TYPE(functype);

14796

- }

14797

-

14798

- tree decl;

14799

- if (functype == error_mark_node)

14800

- decl = error_mark_node;

14801

- else

14802

- {

14803

- decl = build_decl(this->location().gcc_location(), FUNCTION_DECL, id,

14804

- functype);

14805

- TREE_PUBLIC(decl) = 1;

14806

- DECL_EXTERNAL(decl) = 1;

14807

-

14808

- if (this->asm_name_.empty())

14809

- {

14810

- std::string asm_name = (no->package() == NULL

14811

- ? gogo->pkgpath_symbol()

14812

- : no->package()->pkgpath_symbol());

14813

- asm_name.append(1, '.');

14814

- asm_name.append(Gogo::unpack_hidden_name(no->name()));

14815

- if (this->fntype_->is_method())

14816

- {

14817

- asm_name.append(1, '.');

14818

- Type* rtype = this->fntype_->receiver()->type();

14819

- asm_name.append(rtype->mangled_name(gogo));

14820

- }

14821

- SET_DECL_ASSEMBLER_NAME(decl,

14822

- get_identifier_from_string(asm_name));

14823

- }

14824

- }

14825

- this->fndecl_ = decl;

14826

- go_preserve_from_gc(decl);

14827

+ Btype* functype = this->fntype_->get_backend_fntype(gogo);

14828

+ this->fndecl_ =

14829

+ gogo->backend()->function(functype, no->get_id(gogo), asm_name,

14830

+ true, true, true, false, false,

14831

+ this->location());

14832

}

14833

+

14834

return this->fndecl_;

14835

}

14836

14837

+// Return the function's decl after it has been built.

14838

+

14839

+tree

14840

+Function::get_decl() const

14841

+{

14842

+ go_assert(this->fndecl_ != NULL);

14843

+ return function_to_tree(this->fndecl_);

14844

+}

14845

+

14846

// We always pass the receiver to a method as a pointer. If the

14847

// receiver is actually declared as a non-pointer type, then we copy

14848

// the value into a local variable, so that it has the right type. In

14849

@@ -1558,7 +1363,7 @@

14850

void

14851

Function::build_tree(Gogo* gogo, Named_object* named_function)

14852

{

14853

- tree fndecl = this->fndecl_;

14854

+ tree fndecl = this->get_decl();

14855

go_assert(fndecl != NULL_TREE);

14856

14857

tree params = NULL_TREE;

14858

@@ -1796,7 +1601,7 @@

14859

set = NULL_TREE;

14860

else

14861

set = fold_build2_loc(end_loc.gcc_location(), MODIFY_EXPR, void_type_node,

14862

- DECL_RESULT(this->fndecl_), retval);

14863

+ DECL_RESULT(this->get_decl()), retval);

14864

tree ret_stmt = fold_build1_loc(end_loc.gcc_location(), RETURN_EXPR,

14865

void_type_node, set);

14866

append_to_statement_list(ret_stmt, &stmt_list);

14867

@@ -1851,7 +1656,7 @@

14868

retval = this->return_value(gogo, named_function, end_loc,

14869

&stmt_list);

14870

set = fold_build2_loc(end_loc.gcc_location(), MODIFY_EXPR, void_type_node,

14871

- DECL_RESULT(this->fndecl_), retval);

14872

+ DECL_RESULT(this->get_decl()), retval);

14873

ret_stmt = fold_build1_loc(end_loc.gcc_location(), RETURN_EXPR,

14874

void_type_node, set);

14875

14876

@@ -1869,7 +1674,7 @@

14877

*fini = stmt_list;

14878

}

14879

14880

-// Return the value to assign to DECL_RESULT(this->fndecl_). This may

14881

+// Return the value to assign to DECL_RESULT(this->get_decl()). This may

14882

// also add statements to STMT_LIST, which need to be executed before

14883

// the assignment. This is used for a return statement with no

14884

// explicit values.

14885

@@ -1902,7 +1707,7 @@

14886

}

14887

else

14888

{

14889

- tree rettype = TREE_TYPE(DECL_RESULT(this->fndecl_));

14890

+ tree rettype = TREE_TYPE(DECL_RESULT(this->get_decl()));

14891

retval = create_tmp_var(rettype, "RESULT");

14892

tree field = TYPE_FIELDS(rettype);

14893

int index = 0;

14894

@@ -2323,18 +2128,14 @@

14895

go_assert(m != NULL);

14896

14897

Named_object* no = m->named_object();

14898

-

14899

- tree fnid = no->get_id(this);

14900

-

14901

- tree fndecl;

14902

+ Bfunction* bf;

14903

if (no->is_function())

14904

- fndecl = no->func_value()->get_or_make_decl(this, no, fnid);

14905

+ bf = no->func_value()->get_or_make_decl(this, no);

14906

else if (no->is_function_declaration())

14907

- fndecl = no->func_declaration_value()->get_or_make_decl(this, no,

14908

- fnid);

14909

+ bf = no->func_declaration_value()->get_or_make_decl(this, no);

14910

else

14911

go_unreachable();

14912

- fndecl = build_fold_addr_expr(fndecl);

14913

+ tree fndecl = build_fold_addr_expr(function_to_tree(bf));

14914

14915

elt = pointers->quick_push(empty);

14916

elt->index = size_int(i);

14917

@@ -2353,10 +2154,11 @@

14918

TREE_CONSTANT(decl) = 1;

14919

DECL_INITIAL(decl) = constructor;

14920

14921

- // If the interface type has hidden methods, then this is the only

14922

- // definition of the table. Otherwise it is a comdat table which

14923

- // may be defined in multiple packages.

14924

- if (has_hidden_methods)

14925

+ // If the interface type has hidden methods, and the table is for a

14926

+ // named type, then this is the only definition of the table.

14927

+ // Otherwise it is a comdat table which may be defined in multiple

14928

+ // packages.

14929

+ if (has_hidden_methods && type->named_type() != NULL)

14930

TREE_PUBLIC(decl) = 1;

14931

else

14932

{

14933

Index: gcc/go/gofrontend/lex.cc

14934

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

14935

--- a/src/gcc/go/gofrontend/lex.cc (.../tags/gcc_4_8_2_release)

14936

+++ b/src/gcc/go/gofrontend/lex.cc (.../branches/gcc-4_8-branch)

14937

@@ -873,7 +873,28 @@

14938

&& (cc < 'a' || cc > 'z')

14939

&& cc != '_'

14940

&& (cc < '0' || cc > '9'))

14941

- break;

14942

+ {

14943

+ // Check for an invalid character here, as we get better

14944

+ // error behaviour if we swallow them as part of the

14945

+ // identifier we are building.

14946

+ if ((cc >= ' ' && cc < 0x7f)

14947

+ || cc == '\t'

14948

+ || cc == '\r'

14949

+ || cc == '\n')

14950

+ break;

14951

+

14952

+ this->lineoff_ = p - this->linebuf_;

14953

+ error_at(this->location(),

14954

+ "invalid character 0x%x in identifier",

14955

+ cc);

14956

+ if (!has_non_ascii_char)

14957

+ {

14958

+ buf.assign(pstart, p - pstart);

14959

+ has_non_ascii_char = true;

14960

+ }

14961

+ if (!Lex::is_invalid_identifier(buf))

14962

+ buf.append("$INVALID$");

14963

+ }

14964

++p;

14965

if (is_first)

14966

{

14967

Index: gcc/go/gofrontend/backend.h

14968

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

14969

--- a/src/gcc/go/gofrontend/backend.h (.../tags/gcc_4_8_2_release)

14970

+++ b/src/gcc/go/gofrontend/backend.h (.../branches/gcc-4_8-branch)

14971

@@ -23,7 +23,7 @@

14972

// The backend representation of a statement.

14973

class Bstatement;

14974

14975

-// The backend representation of a function definition.

14976

+// The backend representation of a function definition or declaration.

14977

class Bfunction;

14978

14979

// The backend representation of a block.

14980

@@ -266,6 +266,11 @@

14981

virtual Bexpression*

14982

convert_expression(Btype* type, Bexpression* expr, Location) = 0;

14983

14984

+ // Create an expression for the address of a function. This is used to

14985

+ // get the address of the code for a function.

14986

+ virtual Bexpression*

14987

+ function_code_expression(Bfunction*, Location) = 0;

14988

+

14989

// Statements.

14990

14991

// Create an error statement. This is used for cases which should

14992

@@ -498,6 +503,32 @@

14993

// recover.

14994

virtual Bexpression*

14995

label_address(Blabel*, Location) = 0;

14996

+

14997

+ // Functions.

14998

+

14999

+ // Create an error function. This is used for cases which should

15000

+ // not occur in a correct program, in order to keep the compilation

15001

+ // going without crashing.

15002

+ virtual Bfunction*

15003

+ error_function() = 0;

15004

+

15005

+ // Declare or define a function of FNTYPE.

15006

+ // NAME is the Go name of the function. ASM_NAME, if not the empty string, is

15007

+ // the name that should be used in the symbol table; this will be non-empty if

15008

+ // a magic extern comment is used.

15009

+ // IS_VISIBLE is true if this function should be visible outside of the

15010

+ // current compilation unit. IS_DECLARATION is true if this is a function

15011

+ // declaration rather than a definition; the function definition will be in

15012

+ // another compilation unit.

15013

+ // IS_INLINABLE is true if the function can be inlined.

15014

+ // DISABLE_SPLIT_STACK is true if this function may not split the stack; this

15015

+ // is used for the implementation of recover.

15016

+ // IN_UNIQUE_SECTION is true if this function should be put into a unique

15017

+ // location if possible; this is used for field tracking.

15018

+ virtual Bfunction*

15019

+ function(Btype* fntype, const std::string& name, const std::string& asm_name,

15020

+ bool is_visible, bool is_declaration, bool is_inlinable,

15021

+ bool disable_split_stack, bool in_unique_section, Location) = 0;

15022

};

15023

15024

// The backend interface has to define this function.

15025

@@ -517,5 +548,6 @@

15026

extern tree stat_to_tree(Bstatement*);

15027

extern tree block_to_tree(Bblock*);

15028

extern tree var_to_tree(Bvariable*);

15029

+extern tree function_to_tree(Bfunction*);

15030

15031

#endif // !defined(GO_BACKEND_H)

15032

Index: gcc/go/gofrontend/types.cc

15033

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

15034

--- a/src/gcc/go/gofrontend/types.cc (.../tags/gcc_4_8_2_release)

15035

+++ b/src/gcc/go/gofrontend/types.cc (.../branches/gcc-4_8-branch)

15036

@@ -1834,7 +1834,9 @@

15037

bloc);

15038

gogo->start_block(bloc);

15039

15040

- if (this->struct_type() != NULL)

15041

+ if (name != NULL && name->real_type()->named_type() != NULL)

15042

+ this->write_named_hash(gogo, name, hash_fntype, equal_fntype);

15043

+ else if (this->struct_type() != NULL)

15044

this->struct_type()->write_hash_function(gogo, name, hash_fntype,

15045

equal_fntype);

15046

else if (this->array_type() != NULL)

15047

@@ -1852,7 +1854,9 @@

15048

false, bloc);

15049

gogo->start_block(bloc);

15050

15051

- if (this->struct_type() != NULL)

15052

+ if (name != NULL && name->real_type()->named_type() != NULL)

15053

+ this->write_named_equal(gogo, name);

15054

+ else if (this->struct_type() != NULL)

15055

this->struct_type()->write_equal_function(gogo, name);

15056

else if (this->array_type() != NULL)

15057

this->array_type()->write_equal_function(gogo, name);

15058

@@ -1865,6 +1869,100 @@

15059

gogo->finish_function(bloc);

15060

}

15061

15062

+// Write a hash function that simply calls the hash function for a

15063

+// named type. This is used when one named type is defined as

15064

+// another. This ensures that this case works when the other named

15065

+// type is defined in another package and relies on calling hash

15066

+// functions defined only in that package.

15067

+

15068

+void

15069

+Type::write_named_hash(Gogo* gogo, Named_type* name,

15070

+ Function_type* hash_fntype, Function_type* equal_fntype)

15071

+{

15072

+ Location bloc = Linemap::predeclared_location();

15073

+

15074

+ Named_type* base_type = name->real_type()->named_type();

15075

+ go_assert(base_type != NULL);

15076

+

15077

+ // The pointer to the type we are going to hash. This is an

15078

+ // unsafe.Pointer.

15079

+ Named_object* key_arg = gogo->lookup("key", NULL);

15080

+ go_assert(key_arg != NULL);

15081

+

15082

+ // The size of the type we are going to hash.

15083

+ Named_object* keysz_arg = gogo->lookup("key_size", NULL);

15084

+ go_assert(keysz_arg != NULL);

15085

+

15086

+ Named_object* hash_fn;

15087

+ Named_object* equal_fn;

15088

+ name->real_type()->type_functions(gogo, base_type, hash_fntype, equal_fntype,

15089

+ &hash_fn, &equal_fn);

15090

+

15091

+ // Call the hash function for the base type.

15092

+ Expression* key_ref = Expression::make_var_reference(key_arg, bloc);

15093

+ Expression* keysz_ref = Expression::make_var_reference(keysz_arg, bloc);

15094

+ Expression_list* args = new Expression_list();

15095

+ args->push_back(key_ref);

15096

+ args->push_back(keysz_ref);

15097

+ Expression* func = Expression::make_func_reference(hash_fn, NULL, bloc);

15098

+ Expression* call = Expression::make_call(func, args, false, bloc);

15099

+

15100

+ // Return the hash of the base type.

15101

+ Expression_list* vals = new Expression_list();

15102

+ vals->push_back(call);

15103

+ Statement* s = Statement::make_return_statement(vals, bloc);

15104

+ gogo->add_statement(s);

15105

+}

15106

+

15107

+// Write an equality function that simply calls the equality function

15108

+// for a named type. This is used when one named type is defined as

15109

+// another. This ensures that this case works when the other named

15110

+// type is defined in another package and relies on calling equality

15111

+// functions defined only in that package.

15112

+

15113

+void

15114

+Type::write_named_equal(Gogo* gogo, Named_type* name)

15115

+{

15116

+ Location bloc = Linemap::predeclared_location();

15117

+

15118

+ // The pointers to the types we are going to compare. These have

15119

+ // type unsafe.Pointer.

15120

+ Named_object* key1_arg = gogo->lookup("key1", NULL);

15121

+ Named_object* key2_arg = gogo->lookup("key2", NULL);

15122

+ go_assert(key1_arg != NULL && key2_arg != NULL);

15123

+

15124

+ Named_type* base_type = name->real_type()->named_type();

15125

+ go_assert(base_type != NULL);

15126

+

15127

+ // Build temporaries with the base type.

15128

+ Type* pt = Type::make_pointer_type(base_type);

15129

+

15130

+ Expression* ref = Expression::make_var_reference(key1_arg, bloc);

15131

+ ref = Expression::make_cast(pt, ref, bloc);

15132

+ Temporary_statement* p1 = Statement::make_temporary(pt, ref, bloc);

15133

+ gogo->add_statement(p1);

15134

+

15135

+ ref = Expression::make_var_reference(key2_arg, bloc);

15136

+ ref = Expression::make_cast(pt, ref, bloc);

15137

+ Temporary_statement* p2 = Statement::make_temporary(pt, ref, bloc);

15138

+ gogo->add_statement(p2);

15139

+

15140

+ // Compare the values for equality.

15141

+ Expression* t1 = Expression::make_temporary_reference(p1, bloc);

15142

+ t1 = Expression::make_unary(OPERATOR_MULT, t1, bloc);

15143

+

15144

+ Expression* t2 = Expression::make_temporary_reference(p2, bloc);

15145

+ t2 = Expression::make_unary(OPERATOR_MULT, t2, bloc);

15146

+

15147

+ Expression* cond = Expression::make_binary(OPERATOR_EQEQ, t1, t2, bloc);

15148

+

15149

+ // Return the equality comparison.

15150

+ Expression_list* vals = new Expression_list();

15151

+ vals->push_back(cond);

15152

+ Statement* s = Statement::make_return_statement(vals, bloc);

15153

+ gogo->add_statement(s);

15154

+}

15155

+

15156

// Return a composite literal for the type descriptor for a plain type

15157

// of kind RUNTIME_TYPE_KIND named NAME.

15158

15159

@@ -2164,26 +2262,9 @@

15160

15161

++p;

15162

go_assert(p->is_field_name("typ"));

15163

- if (!only_value_methods && m->is_value_method())

15164

- {

15165

- // This is a value method on a pointer type. Change the type of

15166

- // the method to use a pointer receiver. The implementation

15167

- // always uses a pointer receiver anyhow.

15168

- Type* rtype = mtype->receiver()->type();

15169

- Type* prtype = Type::make_pointer_type(rtype);

15170

- Typed_identifier* receiver =

15171

- new Typed_identifier(mtype->receiver()->name(), prtype,

15172

- mtype->receiver()->location());

15173

- mtype = Type::make_function_type(receiver,

15174

- (mtype->parameters() == NULL

15175

- ? NULL

15176

- : mtype->parameters()->copy()),

15177

- (mtype->results() == NULL

15178

- ? NULL

15179

- : mtype->results()->copy()),

15180

- mtype->location());

15181

- }

15182

- vals->push_back(Expression::make_type_descriptor(mtype, bloc));

15183

+ bool want_pointer_receiver = !only_value_methods && m->is_value_method();

15184

+ nonmethod_type = mtype->copy_with_receiver_as_param(want_pointer_receiver);

15185

+ vals->push_back(Expression::make_type_descriptor(nonmethod_type, bloc));

15186

15187

++p;

15188

go_assert(p->is_field_name("tfn"));

15189

@@ -3383,6 +3464,68 @@

15190

// Get the backend representation for a function type.

15191

15192

Btype*

15193

+Function_type::get_backend_fntype(Gogo* gogo)

15194

+{

15195

+ if (this->fnbtype_ == NULL)

15196

+ {

15197

+ Backend::Btyped_identifier breceiver;

15198

+ if (this->receiver_ != NULL)

15199

+ {

15200

+ breceiver.name = Gogo::unpack_hidden_name(this->receiver_->name());

15201

+

15202

+ // We always pass the address of the receiver parameter, in

15203

+ // order to make interface calls work with unknown types.

15204

+ Type* rtype = this->receiver_->type();

15205

+ if (rtype->points_to() == NULL)

15206

+ rtype = Type::make_pointer_type(rtype);

15207

+ breceiver.btype = rtype->get_backend(gogo);

15208

+ breceiver.location = this->receiver_->location();

15209

+ }

15210

+

15211

+ std::vector<Backend::Btyped_identifier> bparameters;

15212

+ if (this->parameters_ != NULL)

15213

+ {

15214

+ bparameters.resize(this->parameters_->size());

15215

+ size_t i = 0;

15216

+ for (Typed_identifier_list::const_iterator p =

15217

+ this->parameters_->begin(); p != this->parameters_->end();

15218

+ ++p, ++i)

15219

+ {

15220

+ bparameters[i].name = Gogo::unpack_hidden_name(p->name());

15221

+ bparameters[i].btype = p->type()->get_backend(gogo);

15222

+ bparameters[i].location = p->location();

15223

+ }

15224

+ go_assert(i == bparameters.size());

15225

+ }

15226

+

15227

+ std::vector<Backend::Btyped_identifier> bresults;

15228

+ if (this->results_ != NULL)

15229

+ {

15230

+ bresults.resize(this->results_->size());

15231

+ size_t i = 0;

15232

+ for (Typed_identifier_list::const_iterator p =

15233

+ this->results_->begin(); p != this->results_->end();

15234

+ ++p, ++i)

15235

+ {

15236

+ bresults[i].name = Gogo::unpack_hidden_name(p->name());

15237

+ bresults[i].btype = p->type()->get_backend(gogo);

15238

+ bresults[i].location = p->location();

15239

+ }

15240

+ go_assert(i == bresults.size());

15241

+ }

15242

+

15243

+ this->fnbtype_ = gogo->backend()->function_type(breceiver, bparameters,

15244

+ bresults,

15245

+ this->location());

15246

+

15247

+ }

15248

+

15249

+ return this->fnbtype_;

15250

+}

15251

+

15252

+// Get the backend representation for a Go function type.

15253

+

15254

+Btype*

15255

Function_type::do_get_backend(Gogo* gogo)

15256

{

15257

// When we do anything with a function value other than call it, it

15258

@@ -3395,57 +3538,9 @@

15259

gogo->backend()->placeholder_struct_type("__go_descriptor", loc);

15260

Btype* ptr_struct_type = gogo->backend()->pointer_type(struct_type);

15261

15262

- Backend::Btyped_identifier breceiver;

15263

- if (this->receiver_ != NULL)

15264

- {

15265

- breceiver.name = Gogo::unpack_hidden_name(this->receiver_->name());

15266

-

15267

- // We always pass the address of the receiver parameter, in

15268

- // order to make interface calls work with unknown types.

15269

- Type* rtype = this->receiver_->type();

15270

- if (rtype->points_to() == NULL)

15271

- rtype = Type::make_pointer_type(rtype);

15272

- breceiver.btype = rtype->get_backend(gogo);

15273

- breceiver.location = this->receiver_->location();

15274

- }

15275

-

15276

- std::vector<Backend::Btyped_identifier> bparameters;

15277

- if (this->parameters_ != NULL)

15278

- {

15279

- bparameters.resize(this->parameters_->size());

15280

- size_t i = 0;

15281

- for (Typed_identifier_list::const_iterator p = this->parameters_->begin();

15282

- p != this->parameters_->end();

15283

- ++p, ++i)

15284

- {

15285

- bparameters[i].name = Gogo::unpack_hidden_name(p->name());

15286

- bparameters[i].btype = p->type()->get_backend(gogo);

15287

- bparameters[i].location = p->location();

15288

- }

15289

- go_assert(i == bparameters.size());

15290

- }

15291

-

15292

- std::vector<Backend::Btyped_identifier> bresults;

15293

- if (this->results_ != NULL)

15294

- {

15295

- bresults.resize(this->results_->size());

15296

- size_t i = 0;

15297

- for (Typed_identifier_list::const_iterator p = this->results_->begin();

15298

- p != this->results_->end();

15299

- ++p, ++i)

15300

- {

15301

- bresults[i].name = Gogo::unpack_hidden_name(p->name());

15302

- bresults[i].btype = p->type()->get_backend(gogo);

15303

- bresults[i].location = p->location();

15304

- }

15305

- go_assert(i == bresults.size());

15306

- }

15307

-

15308

- Btype* fntype = gogo->backend()->function_type(breceiver, bparameters,

15309

- bresults, loc);

15310

std::vector<Backend::Btyped_identifier> fields(1);

15311

fields[0].name = "code";

15312

- fields[0].btype = fntype;

15313

+ fields[0].btype = this->get_backend_fntype(gogo);

15314

fields[0].location = loc;

15315

if (!gogo->backend()->set_placeholder_struct_type(struct_type, fields))

15316

return gogo->backend()->error_type();

15317

@@ -3821,6 +3916,32 @@

15318

return ret;

15319

}

15320

15321

+// Make a copy of a function type with the receiver as the first

15322

+// parameter.

15323

+

15324

+Function_type*

15325

+Function_type::copy_with_receiver_as_param(bool want_pointer_receiver) const

15326

+{

15327

+ go_assert(this->is_method());

15328

+ Typed_identifier_list* new_params = new Typed_identifier_list();

15329

+ Type* rtype = this->receiver_->type();

15330

+ if (want_pointer_receiver)

15331

+ rtype = Type::make_pointer_type(rtype);

15332

+ Typed_identifier receiver(this->receiver_->name(), rtype,

15333

+ this->receiver_->location());

15334

+ new_params->push_back(receiver);

15335

+ const Typed_identifier_list* orig_params = this->parameters_;

15336

+ if (orig_params != NULL && !orig_params->empty())

15337

+ {

15338

+ for (Typed_identifier_list::const_iterator p = orig_params->begin();

15339

+ p != orig_params->end();

15340

+ ++p)

15341

+ new_params->push_back(*p);

15342

+ }

15343

+ return Type::make_function_type(NULL, new_params, this->results_,

15344

+ this->location_);

15345

+}

15346

+

15347

// Make a copy of a function type ignoring any receiver and adding a

15348

// closure parameter.

15349

15350

@@ -4195,7 +4316,8 @@

15351

15352

// This is a horrible hack caused by the fact that we don't pack

15353

// the names of builtin types. FIXME.

15354

- if (nt != NULL

15355

+ if (!this->is_imported_

15356

+ && nt != NULL

15357

&& nt->is_builtin()

15358

&& nt->name() == Gogo::unpack_hidden_name(name))

15359

return true;

15360

@@ -4204,6 +4326,36 @@

15361

}

15362

}

15363

15364

+// Return whether this field is an unexported field named NAME.

15365

+

15366

+bool

15367

+Struct_field::is_unexported_field_name(Gogo* gogo,

15368

+ const std::string& name) const

15369

+{

15370

+ const std::string& field_name(this->field_name());

15371

+ if (Gogo::is_hidden_name(field_name)

15372

+ && name == Gogo::unpack_hidden_name(field_name)

15373

+ && gogo->pack_hidden_name(name, false) != field_name)

15374

+ return true;

15375

+

15376

+ // Check for the name of a builtin type. This is like the test in

15377

+ // is_field_name, only there we return false if this->is_imported_,

15378

+ // and here we return true.

15379

+ if (this->is_imported_ && this->is_anonymous())

15380

+ {

15381

+ Type* t = this->typed_identifier_.type();

15382

+ if (t->points_to() != NULL)

15383

+ t = t->points_to();

15384

+ Named_type* nt = t->named_type();

15385

+ if (nt != NULL

15386

+ && nt->is_builtin()

15387

+ && nt->name() == Gogo::unpack_hidden_name(name))

15388

+ return true;

15389

+ }

15390

+

15391

+ return false;

15392

+}

15393

+

15394

// Return whether this field is an embedded built-in type.

15395

15396

bool

15397

@@ -4264,13 +4416,8 @@

15398

++p)

15399

{

15400

Type* t = p->type();

15401

- if (t->is_undefined())

15402

+ if (p->is_anonymous())

15403

{

15404

- error_at(p->location(), "struct field type is incomplete");

15405

- p->set_type(Type::make_error_type());

15406

- }

15407

- else if (p->is_anonymous())

15408

- {

15409

if (t->named_type() != NULL && t->points_to() != NULL)

15410

{

15411

error_at(p->location(), "embedded type may not be a pointer");

15412

@@ -4641,13 +4788,8 @@

15413

for (Struct_field_list::const_iterator pf = fields->begin();

15414

pf != fields->end();

15415

++pf)

15416

- {

15417

- const std::string& field_name(pf->field_name());

15418

- if (Gogo::is_hidden_name(field_name)

15419

- && name == Gogo::unpack_hidden_name(field_name)

15420

- && gogo->pack_hidden_name(name, false) != field_name)

15421

- return true;

15422

- }

15423

+ if (pf->is_unexported_field_name(gogo, name))

15424

+ return true;

15425

}

15426

return false;

15427

}

15428

@@ -5250,6 +5392,7 @@

15429

Type* ftype = imp->read_type();

15430

15431

Struct_field sf(Typed_identifier(name, ftype, imp->location()));

15432

+ sf.set_is_imported();

15433

15434

if (imp->peek_char() == ' ')

15435

{

15436

@@ -9022,6 +9165,8 @@

15437

fntype->is_varargs(), location);

15438

gogo->finish_function(fntype->location());

15439

15440

+ if (type->named_type() == NULL && stub->is_function())

15441

+ stub->func_value()->set_is_unnamed_type_stub_method();

15442

if (m->nointerface() && stub->is_function())

15443

stub->func_value()->set_nointerface();

15444

}

15445

@@ -9289,7 +9434,9 @@

15446

else

15447

{

15448

bool is_unexported;

15449

- if (!Gogo::is_hidden_name(name))

15450

+ // The test for 'a' and 'z' is to handle builtin names,

15451

+ // which are not hidden.

15452

+ if (!Gogo::is_hidden_name(name) && (name[0] < 'a' || name[0] > 'z'))

15453

is_unexported = false;

15454

else

15455

{

15456

Index: gcc/go/gofrontend/expressions.cc

15457

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

15458

--- a/src/gcc/go/gofrontend/expressions.cc (.../tags/gcc_4_8_2_release)

15459

+++ b/src/gcc/go/gofrontend/expressions.cc (.../branches/gcc-4_8-branch)

15460

@@ -1219,7 +1219,7 @@

15461

15462

// Get the tree for the code of a function expression.

15463

15464

-tree

15465

+Bexpression*

15466

Func_expression::get_code_pointer(Gogo* gogo, Named_object* no, Location loc)

15467

{

15468

Function_type* fntype;

15469

@@ -1237,25 +1237,18 @@

15470

error_at(loc,

15471

"invalid use of special builtin function %qs; must be called",

15472

no->message_name().c_str());

15473

- return error_mark_node;

15474

+ return gogo->backend()->error_expression();

15475

}

15476

15477

- tree id = no->get_id(gogo);

15478

- if (id == error_mark_node)

15479

- return error_mark_node;

15480

-

15481

- tree fndecl;

15482

+ Bfunction* fndecl;

15483

if (no->is_function())

15484

- fndecl = no->func_value()->get_or_make_decl(gogo, no, id);

15485

+ fndecl = no->func_value()->get_or_make_decl(gogo, no);

15486

else if (no->is_function_declaration())

15487

- fndecl = no->func_declaration_value()->get_or_make_decl(gogo, no, id);

15488

+ fndecl = no->func_declaration_value()->get_or_make_decl(gogo, no);

15489

else

15490

go_unreachable();

15491

15492

- if (fndecl == error_mark_node)

15493

- return error_mark_node;

15494

-

15495

- return build_fold_addr_expr_loc(loc.gcc_location(), fndecl);

15496

+ return gogo->backend()->function_code_expression(fndecl, loc);

15497

}

15498

15499

// Get the tree for a function expression. This is used when we take

15500

@@ -1492,8 +1485,10 @@

15501

tree

15502

Func_code_reference_expression::do_get_tree(Translate_context* context)

15503

{

15504

- return Func_expression::get_code_pointer(context->gogo(), this->function_,

15505

- this->location());

15506

+ Bexpression* ret =

15507

+ Func_expression::get_code_pointer(context->gogo(), this->function_,

15508

+ this->location());

15509

+ return expr_to_tree(ret);

15510

}

15511

15512

// Make a reference to the code of a function.

15513

@@ -3055,8 +3050,7 @@

15514

do_lower(Gogo*, Named_object*, Statement_inserter*, int);

15515

15516

bool

15517

- do_is_constant() const

15518

- { return this->expr_->is_constant(); }

15519

+ do_is_constant() const;

15520

15521

bool

15522

do_numeric_constant_value(Numeric_constant*) const;

15523

@@ -3198,6 +3192,27 @@

15524

return this;

15525

}

15526

15527

+// Return whether a type conversion is a constant.

15528

+

15529

+bool

15530

+Type_conversion_expression::do_is_constant() const

15531

+{

15532

+ if (!this->expr_->is_constant())

15533

+ return false;

15534

+

15535

+ // A conversion to a type that may not be used as a constant is not

15536

+ // a constant. For example, []byte(nil).

15537

+ Type* type = this->type_;

15538

+ if (type->integer_type() == NULL

15539

+ && type->float_type() == NULL

15540

+ && type->complex_type() == NULL

15541

+ && !type->is_boolean_type()

15542

+ && !type->is_string_type())

15543

+ return false;

15544

+

15545

+ return true;

15546

+}

15547

+

15548

// Return the constant numeric value if there is one.

15549

15550

bool

15551

@@ -5586,6 +5601,15 @@

15552

subcontext.type = NULL;

15553

}

15554

15555

+ if (this->op_ == OPERATOR_ANDAND || this->op_ == OPERATOR_OROR)

15556

+ {

15557

+ // For a logical operation, the context does not determine the

15558

+ // types of the operands. The operands must be some boolean

15559

+ // type but if the context has a boolean type they do not

15560

+ // inherit it. See http://golang.org/issue/3924.

15561

+ subcontext.type = NULL;

15562

+ }

15563

+

15564

// Set the context for the left hand operand.

15565

if (is_shift_op)

15566

{

15567

@@ -5967,6 +5991,43 @@

15568

right);

15569

}

15570

15571

+ // For complex division Go wants slightly different results than the

15572

+ // GCC library provides, so we have our own runtime routine.

15573

+ if (this->op_ == OPERATOR_DIV && this->left_->type()->complex_type() != NULL)

15574

+ {

15575

+ const char *name;

15576

+ tree *pdecl;

15577

+ Type* ctype;

15578

+ static tree complex64_div_decl;

15579

+ static tree complex128_div_decl;

15580

+ switch (this->left_->type()->complex_type()->bits())

15581

+ {

15582

+ case 64:

15583

+ name = "__go_complex64_div";

15584

+ pdecl = &complex64_div_decl;

15585

+ ctype = Type::lookup_complex_type("complex64");

15586

+ break;

15587

+ case 128:

15588

+ name = "__go_complex128_div";

15589

+ pdecl = &complex128_div_decl;

15590

+ ctype = Type::lookup_complex_type("complex128");

15591

+ break;

15592

+ default:

15593

+ go_unreachable();

15594

+ }

15595

+ Btype* cbtype = ctype->get_backend(gogo);

15596

+ tree ctype_tree = type_to_tree(cbtype);

15597

+ return Gogo::call_builtin(pdecl,

15598

+ this->location(),

15599

+ name,

15600

+ 2,

15601

+ ctype_tree,

15602

+ ctype_tree,

15603

+ fold_convert_loc(gccloc, ctype_tree, left),

15604

+ type,

15605

+ fold_convert_loc(gccloc, ctype_tree, right));

15606

+ }

15607

+

15608

tree compute_type = excess_precision_type(type);

15609

if (compute_type != NULL_TREE)

15610

{

15611

@@ -7191,6 +7252,15 @@

15612

if (this->code_ == BUILTIN_OFFSETOF)

15613

{

15614

Expression* arg = this->one_arg();

15615

+

15616

+ if (arg->bound_method_expression() != NULL

15617

+ || arg->interface_field_reference_expression() != NULL)

15618

+ {

15619

+ this->report_error(_("invalid use of method value as argument "

15620

+ "of Offsetof"));

15621

+ return this;

15622

+ }

15623

+

15624

Field_reference_expression* farg = arg->field_reference_expression();

15625

while (farg != NULL)

15626

{

15627

@@ -7200,7 +7270,8 @@

15628

// it must not be reached through pointer indirections.

15629

if (farg->expr()->deref() != farg->expr())

15630

{

15631

- this->report_error(_("argument of Offsetof implies indirection of an embedded field"));

15632

+ this->report_error(_("argument of Offsetof implies "

15633

+ "indirection of an embedded field"));

15634

return this;

15635

}

15636

// Go up until we reach the original base.

15637

@@ -7476,7 +7547,7 @@

15638

switch (nc.to_unsigned_long(&v))

15639

{

15640

case Numeric_constant::NC_UL_VALID:

15641

- return true;

15642

+ break;

15643

case Numeric_constant::NC_UL_NOTINT:

15644

error_at(e->location(), "non-integer %s argument to make",

15645

is_length ? "len" : "cap");

15646

@@ -7488,8 +7559,23 @@

15647

case Numeric_constant::NC_UL_BIG:

15648

// We don't want to give a compile-time error for a 64-bit

15649

// value on a 32-bit target.

15650

- return true;

15651

+ break;

15652

}

15653

+

15654

+ mpz_t val;

15655

+ if (!nc.to_int(&val))

15656

+ go_unreachable();

15657

+ int bits = mpz_sizeinbase(val, 2);

15658

+ mpz_clear(val);

15659

+ Type* int_type = Type::lookup_integer_type("int");

15660

+ if (bits >= int_type->integer_type()->bits())

15661

+ {

15662

+ error_at(e->location(), "%s argument too large for make",

15663

+ is_length ? "len" : "cap");

15664

+ return false;

15665

+ }

15666

+

15667

+ return true;

15668

}

15669

15670

if (e->type()->integer_type() != NULL)

15671

@@ -7595,6 +7681,8 @@

15672

bool

15673

Builtin_call_expression::do_is_constant() const

15674

{

15675

+ if (this->is_error_expression())

15676

+ return true;

15677

switch (this->code_)

15678

{

15679

case BUILTIN_LEN:

15680

@@ -9744,15 +9832,9 @@

15681

}

15682

15683

tree fntype_tree = type_to_tree(fntype->get_backend(gogo));

15684

- if (fntype_tree == error_mark_node)

15685

+ tree fnfield_type = type_to_tree(fntype->get_backend_fntype(gogo));

15686

+ if (fntype_tree == error_mark_node || fnfield_type == error_mark_node)

15687

return error_mark_node;

15688

- go_assert(POINTER_TYPE_P(fntype_tree));

15689

- if (TREE_TYPE(fntype_tree) == error_mark_node)

15690

- return error_mark_node;

15691

- go_assert(TREE_CODE(TREE_TYPE(fntype_tree)) == RECORD_TYPE);

15692

- tree fnfield_type = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(fntype_tree)));

15693

- if (fnfield_type == error_mark_node)

15694

- return error_mark_node;

15695

go_assert(FUNCTION_POINTER_TYPE_P(fnfield_type));

15696

tree rettype = TREE_TYPE(TREE_TYPE(fnfield_type));

15697

if (rettype == error_mark_node)

15698

@@ -9763,7 +9845,7 @@

15699

if (func != NULL)

15700

{

15701

Named_object* no = func->named_object();

15702

- fn = Func_expression::get_code_pointer(gogo, no, location);

15703

+ fn = expr_to_tree(Func_expression::get_code_pointer(gogo, no, location));

15704

if (!has_closure)

15705

closure_tree = NULL_TREE;

15706

else

15707

@@ -10817,11 +10899,20 @@

15708

void

15709

String_index_expression::do_check_types(Gogo*)

15710

{

15711

- if (this->start_->type()->integer_type() == NULL)

15712

+ Numeric_constant nc;

15713

+ unsigned long v;

15714

+ if (this->start_->type()->integer_type() == NULL

15715

+ && !this->start_->type()->is_error()

15716

+ && (!this->start_->numeric_constant_value(&nc)

15717

+ || nc.to_unsigned_long(&v) == Numeric_constant::NC_UL_NOTINT))

15718

this->report_error(_("index must be integer"));

15719

if (this->end_ != NULL

15720

&& this->end_->type()->integer_type() == NULL

15721

- && !this->end_->is_nil_expression())

15722

+ && !this->end_->type()->is_error()

15723

+ && !this->end_->is_nil_expression()

15724

+ && !this->end_->is_error_expression()

15725

+ && (!this->end_->numeric_constant_value(&nc)

15726

+ || nc.to_unsigned_long(&v) == Numeric_constant::NC_UL_NOTINT))

15727

this->report_error(_("slice end must be integer"));

15728

15729

std::string sval;

15730

Index: gcc/recog.c

15731

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

15732

--- a/src/gcc/recog.c (.../tags/gcc_4_8_2_release)

15733

+++ b/src/gcc/recog.c (.../branches/gcc-4_8-branch)

15734

@@ -3061,6 +3061,9 @@

15735

return 1;

15736

}

15737

15738

+/* Regno offset to be used in the register search. */

15739

+static int search_ofs;

15740

+

15741

/* Try to find a hard register of mode MODE, matching the register class in

15742

CLASS_STR, which is available at the beginning of insn CURRENT_INSN and

15743

remains available until the end of LAST_INSN. LAST_INSN may be NULL_RTX,

15744

@@ -3076,7 +3079,6 @@

15745

peep2_find_free_register (int from, int to, const char *class_str,

15746

enum machine_mode mode, HARD_REG_SET *reg_set)

15747

{

15748

- static int search_ofs;

15749

enum reg_class cl;

15750

HARD_REG_SET live;

15751

df_ref *def_rec;

15752

@@ -3541,6 +3543,7 @@

15753

/* Initialize the regsets we're going to use. */

15754

for (i = 0; i < MAX_INSNS_PER_PEEP2 + 1; ++i)

15755

peep2_insn_data[i].live_before = BITMAP_ALLOC (&reg_obstack);

15756

+ search_ofs = 0;

15757

live = BITMAP_ALLOC (&reg_obstack);

15758

15759

FOR_EACH_BB_REVERSE (bb)

15760

Index: gcc/ada/indepsw-darwin.adb

15761

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

15762

--- a/src/gcc/ada/indepsw-darwin.adb (.../tags/gcc_4_8_2_release)

15763

+++ b/src/gcc/ada/indepsw-darwin.adb (.../branches/gcc-4_8-branch)

15764

@@ -0,0 +1,67 @@

15765

+------------------------------------------------------------------------------

15766

+-- --

15767

+-- GNAT COMPILER COMPONENTS --

15768

+-- --

15769

+-- I N D E P S W --

15770

+-- --

15771

+-- B o d y --

15772

+-- (Darwin version) --

15773

+-- --

15774

15775

+-- --

15776

+-- GNAT is free software; you can redistribute it and/or modify it under --

15777

+-- terms of the GNU General Public License as published by the Free Soft- --

15778

+-- ware Foundation; either version 3, or (at your option) any later ver- --

15779

+-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --

15780

+-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --

15781

+-- or FITNESS FOR A PARTICULAR PURPOSE. --

15782

+-- --

15783

+-- As a special exception under Section 7 of GPL version 3, you are granted --

15784

+-- additional permissions described in the GCC Runtime Library Exception, --

15785

+-- version 3.1, as published by the Free Software Foundation. --

15786

+-- --

15787

+-- You should have received a copy of the GNU General Public License and --

15788

+-- a copy of the GCC Runtime Library Exception along with this program; --

15789

+-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --

15790

+-- <http://www.gnu.org/licenses/>. --

15791

+-- --

15792

+-- GNAT was originally developed by the GNAT team at New York University. --

15793

+-- Extensive contributions were provided by Ada Core Technologies Inc. --

15794

+-- --

15795

+------------------------------------------------------------------------------

15796

+

15797

+-- This is the Darwin version

15798

+

15799

+package body Indepsw is

15800

+

15801

+ Map_Switch : aliased constant String := "-Wl,-map,";

15802

+

15803

+ -------------

15804

+ -- Convert --

15805

+ -------------

15806

+

15807

+ procedure Convert

15808

+ (Switch : Switch_Kind;

15809

+ Argument : String;

15810

+ To : out String_List_Access)

15811

+ is

15812

+ begin

15813

+ case Switch is

15814

+ when Map_File =>

15815

+ To := new Argument_List'(1 => new String'(Map_Switch & Argument));

15816

+ end case;

15817

+ end Convert;

15818

+

15819

+ ------------------

15820

+ -- Is_Supported --

15821

+ ------------------

15822

+

15823

+ function Is_Supported (Switch : Switch_Kind) return Boolean is

15824

+ begin

15825

+ case Switch is

15826

+ when Map_File =>

15827

+ return True;

15828

+ end case;

15829

+ end Is_Supported;

15830

+

15831

+end Indepsw;

15832

Index: gcc/ada/ChangeLog

15833

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

15834

--- a/src/gcc/ada/ChangeLog (.../tags/gcc_4_8_2_release)

15835

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

15836

@@ -1,3 +1,29 @@

15837

+2013-12-12 Eric Botcazou <ebotcazou@adacore.com>

15838

+ Iain Sandoe <iain@codesourcery.com>

15839

+

15840

+ PR ada/55946

15841

+ * gcc-interface/Make-lang.in (ada/doctools/xgnatugn): Use gnatmake.

15842

+ * gcc-interface/Makefile.in (GCC_LINK): Add LDFLAGS.

15843

+ (../../gnatmake): Remove LDFLAGS.

15844

+ (../../gnatlink): Likewise.

15845

+

15846

+2013-12-04 Eric Botcazou <ebotcazou@adacore.com>

15847

+

15848

+ PR ada/59382

15849

+ * indepsw-darwin.adb: New file.

15850

+

15851

+2013-10-19 Eric Botcazou <ebotcazou@adacore.com>

15852

+

15853

+ * gcc-interface/utils.c (scale_by_factor_of): New function.

15854

+ (rest_of_record_type_compilation): Use scale_by_factor_of in order to

15855

+ scale the original offset for both rounding cases; in the second case,

15856

+ take into accout the addend to compute the alignment. Tidy up.

15857

+

15858

+2013-10-19 Eric Botcazou <ebotcazou@adacore.com>

15859

+

15860

+ * gcc-interface/utils.c (gnat_set_type_context): New function.

15861

+ (gnat_pushdecl): Use it to set the context of the type.

15862

+

15863

2013-10-16 Release Manager

15864

15865

* GCC 4.8.2 released.

15866

Index: gcc/ada/gcc-interface/utils.c

15867

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

15868

--- a/src/gcc/ada/gcc-interface/utils.c (.../tags/gcc_4_8_2_release)

15869

+++ b/src/gcc/ada/gcc-interface/utils.c (.../branches/gcc-4_8-branch)

15870

@@ -232,6 +232,7 @@

15871

static tree split_plus (tree, tree *);

15872

static tree float_type_for_precision (int, enum machine_mode);

15873

static tree convert_to_fat_pointer (tree, tree);

15874

+static unsigned int scale_by_factor_of (tree, unsigned int);

15875

static bool potential_alignment_gap (tree, tree, tree);

15876

static void process_attributes (tree, struct attrib *);

15877

15878

@@ -532,6 +533,22 @@

15879

free_binding_level = level;

15880

}

15881

15882

+/* Set the context of TYPE and its parallel types (if any) to CONTEXT. */

15883

+

15884

+static void

15885

+gnat_set_type_context (tree type, tree context)

15886

+{

15887

+ tree decl = TYPE_STUB_DECL (type);

15888

+

15889

+ TYPE_CONTEXT (type) = context;

15890

+

15891

+ while (decl && DECL_PARALLEL_TYPE (decl))

15892

+ {

15893

+ TYPE_CONTEXT (DECL_PARALLEL_TYPE (decl)) = context;

15894

+ decl = TYPE_STUB_DECL (DECL_PARALLEL_TYPE (decl));

15895

+ }

15896

+}

15897

+

15898

/* Record DECL as belonging to the current lexical scope and use GNAT_NODE

15899

for location information and flag propagation. */

15900

15901

@@ -613,7 +630,7 @@

15902

if (TREE_CODE (t) == POINTER_TYPE)

15903

TYPE_NEXT_PTR_TO (t) = tt;

15904

TYPE_NAME (tt) = DECL_NAME (decl);

15905

- TYPE_CONTEXT (tt) = DECL_CONTEXT (decl);

15906

+ gnat_set_type_context (tt, DECL_CONTEXT (decl));

15907

TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (t);

15908

DECL_ORIGINAL_TYPE (decl) = tt;

15909

}

15910

@@ -623,7 +640,7 @@

15911

/* We need a variant for the placeholder machinery to work. */

15912

tree tt = build_variant_type_copy (t);

15913

TYPE_NAME (tt) = decl;

15914

- TYPE_CONTEXT (tt) = DECL_CONTEXT (decl);

15915

+ gnat_set_type_context (tt, DECL_CONTEXT (decl));

15916

TREE_USED (tt) = TREE_USED (t);

15917

TREE_TYPE (decl) = tt;

15918

if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))

15919

@@ -645,7 +662,7 @@

15920

if (!(TYPE_NAME (t) && TREE_CODE (TYPE_NAME (t)) == TYPE_DECL))

15921

{

15922

TYPE_NAME (t) = decl;

15923

- TYPE_CONTEXT (t) = DECL_CONTEXT (decl);

15924

+ gnat_set_type_context (t, DECL_CONTEXT (decl));

15925

}

15926

}

15927

}

15928

@@ -1692,93 +1709,74 @@

15929

TYPE_SIZE_UNIT (new_record_type)

15930

= size_int (TYPE_ALIGN (record_type) / BITS_PER_UNIT);

15931

15932

- /* Now scan all the fields, replacing each field with a new

15933

- field corresponding to the new encoding. */

15934

+ /* Now scan all the fields, replacing each field with a new field

15935

+ corresponding to the new encoding. */

15936

for (old_field = TYPE_FIELDS (record_type); old_field;

15937

old_field = DECL_CHAIN (old_field))

15938

{

15939

tree field_type = TREE_TYPE (old_field);

15940

tree field_name = DECL_NAME (old_field);

15941

- tree new_field;

15942

tree curpos = bit_position (old_field);

15943

+ tree pos, new_field;

15944

bool var = false;

15945

unsigned int align = 0;

15946

- tree pos;

15947

15948

+ /* We're going to do some pattern matching below so remove as many

15949

+ conversions as possible. */

15950

+ curpos = remove_conversions (curpos, true);

15951

+

15952

/* See how the position was modified from the last position.

15953

15954

- There are two basic cases we support: a value was added

15955

- to the last position or the last position was rounded to

15956

- a boundary and they something was added. Check for the

15957

- first case first. If not, see if there is any evidence

15958

- of rounding. If so, round the last position and try

15959

- again.

15960

+ There are two basic cases we support: a value was added

15961

+ to the last position or the last position was rounded to

15962

+ a boundary and they something was added. Check for the

15963

+ first case first. If not, see if there is any evidence

15964

+ of rounding. If so, round the last position and retry.

15965

15966

- If this is a union, the position can be taken as zero. */

15967

-

15968

- /* Some computations depend on the shape of the position expression,

15969

- so strip conversions to make sure it's exposed. */

15970

- curpos = remove_conversions (curpos, true);

15971

-

15972

+ If this is a union, the position can be taken as zero. */

15973

if (TREE_CODE (new_record_type) == UNION_TYPE)

15974

- pos = bitsize_zero_node, align = 0;

15975

+ pos = bitsize_zero_node;

15976

else

15977

pos = compute_related_constant (curpos, last_pos);

15978

15979

- if (!pos && TREE_CODE (curpos) == MULT_EXPR

15980

+ if (!pos

15981

+ && TREE_CODE (curpos) == MULT_EXPR

15982

&& host_integerp (TREE_OPERAND (curpos, 1), 1))

15983

{

15984

tree offset = TREE_OPERAND (curpos, 0);

15985

align = tree_low_cst (TREE_OPERAND (curpos, 1), 1);

15986

-

15987

- /* An offset which is a bitwise AND with a mask increases the

15988

- alignment according to the number of trailing zeros. */

15989

- offset = remove_conversions (offset, true);

15990

- if (TREE_CODE (offset) == BIT_AND_EXPR

15991

- && TREE_CODE (TREE_OPERAND (offset, 1)) == INTEGER_CST)

15992

- {

15993

- unsigned HOST_WIDE_INT mask

15994

- = TREE_INT_CST_LOW (TREE_OPERAND (offset, 1));

15995

- unsigned int i;

15996

-

15997

- for (i = 0; i < HOST_BITS_PER_WIDE_INT; i++)

15998

- {

15999

- if (mask & 1)

16000

- break;

16001

- mask >>= 1;

16002

- align *= 2;

16003

- }

16004

- }

16005

-

16006

- pos = compute_related_constant (curpos,

16007

- round_up (last_pos, align));

16008

+ align = scale_by_factor_of (offset, align);

16009

+ last_pos = round_up (last_pos, align);

16010

+ pos = compute_related_constant (curpos, last_pos);

16011

}

16012

- else if (!pos && TREE_CODE (curpos) == PLUS_EXPR

16013

- && TREE_CODE (TREE_OPERAND (curpos, 1)) == INTEGER_CST

16014

+ else if (!pos

16015

+ && TREE_CODE (curpos) == PLUS_EXPR

16016

+ && host_integerp (TREE_OPERAND (curpos, 1), 1)

16017

&& TREE_CODE (TREE_OPERAND (curpos, 0)) == MULT_EXPR

16018

- && host_integerp (TREE_OPERAND

16019

- (TREE_OPERAND (curpos, 0), 1),

16020

- 1))

16021

+ && host_integerp

16022

+ (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1))

16023

{

16024

+ tree offset = TREE_OPERAND (TREE_OPERAND (curpos, 0), 0);

16025

+ unsigned HOST_WIDE_INT addend

16026

+ = tree_low_cst (TREE_OPERAND (curpos, 1), 1);

16027

align

16028

- = tree_low_cst

16029

- (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1);

16030

- pos = compute_related_constant (curpos,

16031

- round_up (last_pos, align));

16032

+ = tree_low_cst (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1);

16033

+ align = scale_by_factor_of (offset, align);

16034

+ align = MIN (align, addend & -addend);

16035

+ last_pos = round_up (last_pos, align);

16036

+ pos = compute_related_constant (curpos, last_pos);

16037

}

16038

- else if (potential_alignment_gap (prev_old_field, old_field,

16039

- pos))

16040

+ else if (potential_alignment_gap (prev_old_field, old_field, pos))

16041

{

16042

align = TYPE_ALIGN (field_type);

16043

- pos = compute_related_constant (curpos,

16044

- round_up (last_pos, align));

16045

+ last_pos = round_up (last_pos, align);

16046

+ pos = compute_related_constant (curpos, last_pos);

16047

}

16048

16049

/* If we can't compute a position, set it to zero.

16050

16051

- ??? We really should abort here, but it's too much work

16052

- to get this correct for all cases. */

16053

-

16054

+ ??? We really should abort here, but it's too much work

16055

+ to get this correct for all cases. */

16056

if (!pos)

16057

pos = bitsize_zero_node;

16058

16059

@@ -2553,6 +2551,32 @@

16060

return false;

16061

}

16062

16063

+/* Return VALUE scaled by the biggest power-of-2 factor of EXPR. */

16064

+

16065

+static unsigned int

16066

+scale_by_factor_of (tree expr, unsigned int value)

16067

+{

16068

+ expr = remove_conversions (expr, true);

16069

+

16070

+ /* An expression which is a bitwise AND with a mask has a power-of-2 factor

16071

+ corresponding to the number of trailing zeros of the mask. */

16072

+ if (TREE_CODE (expr) == BIT_AND_EXPR

16073

+ && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)

16074

+ {

16075

+ unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (TREE_OPERAND (expr, 1));

16076

+ unsigned int i = 0;

16077

+

16078

+ while ((mask & 1) == 0 && i < HOST_BITS_PER_WIDE_INT)

16079

+ {

16080

+ mask >>= 1;

16081

+ value *= 2;

16082

+ i++;

16083

+ }

16084

+ }

16085

+

16086

+ return value;

16087

+}

16088

+

16089

/* Given two consecutive field decls PREV_FIELD and CURR_FIELD, return true

16090

unless we can prove these 2 fields are laid out in such a way that no gap

16091

exist between the end of PREV_FIELD and the beginning of CURR_FIELD. OFFSET

16092

Index: gcc/ada/gcc-interface/Makefile.in

16093

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

16094

--- a/src/gcc/ada/gcc-interface/Makefile.in (.../tags/gcc_4_8_2_release)

16095

+++ b/src/gcc/ada/gcc-interface/Makefile.in (.../branches/gcc-4_8-branch)

16096

@@ -2397,7 +2397,7 @@

16097

"GNATLINK=$(GNATLINK)" \

16098

"GNATBIND=$(GNATBIND)"

16099

16100

-GCC_LINK=$(CC) $(GCC_LINK_FLAGS) $(ADA_INCLUDES)

16101

+GCC_LINK=$(CC) $(GCC_LINK_FLAGS) $(ADA_INCLUDES) $(LDFLAGS)

16102

16103

# Build directory for the tools. Let's copy the target-dependent

16104

# sources using the same mechanism as for gnatlib. The other sources are

16105

@@ -2519,12 +2519,10 @@

16106

16107

# Likewise for the tools

16108

../../gnatmake$(exeext): $(P) b_gnatm.o link.o targext.o $(GNATMAKE_OBJS)

16109

- $(GCC_LINK) $(ALL_CFLAGS) $(LDFLAGS) -o $@ b_gnatm.o $(GNATMAKE_OBJS) \

16110

- $(TOOLS_LIBS)

16111

+ +$(GCC_LINK) $(ALL_CFLAGS) -o $@ b_gnatm.o $(GNATMAKE_OBJS) $(TOOLS_LIBS)

16112

16113

../../gnatlink$(exeext): $(P) b_gnatl.o link.o targext.o $(GNATLINK_OBJS)

16114

- $(GCC_LINK) $(ALL_CFLAGS) $(LDFLAGS) -o $@ b_gnatl.o $(GNATLINK_OBJS) \

16115

- $(TOOLS_LIBS)

16116

+ +$(GCC_LINK) $(ALL_CFLAGS) -o $@ b_gnatl.o $(GNATLINK_OBJS) $(TOOLS_LIBS)

16117

16118

../stamp-gnatlib-$(RTSDIR):

16119

@if [ ! -f stamp-gnatlib-$(RTSDIR) ] ; \

16120

Index: gcc/ada/gcc-interface/Make-lang.in

16121

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

16122

--- a/src/gcc/ada/gcc-interface/Make-lang.in (.../tags/gcc_4_8_2_release)

16123

+++ b/src/gcc/ada/gcc-interface/Make-lang.in (.../branches/gcc-4_8-branch)

16124

@@ -625,7 +625,7 @@

16125

ada/doctools/xgnatugn$(build_exeext): ada/xgnatugn.adb

16126

-$(MKDIR) ada/doctools

16127

$(CP) $^ ada/doctools

16128

- cd ada/doctools && $(GNATMAKE) -q xgnatugn

16129

+ cd ada/doctools && gnatmake -q xgnatugn

16130

16131

# Note that doc/gnat_ugn.texi and doc/projects.texi do not depend on

16132

# xgnatugn being built so we can distribute a pregenerated doc/gnat_ugn.info

16133

Index: gcc/fortran/interface.c

16134

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

16135

--- a/src/gcc/fortran/interface.c (.../tags/gcc_4_8_2_release)

16136

+++ b/src/gcc/fortran/interface.c (.../branches/gcc-4_8-branch)

16137

@@ -1245,7 +1245,8 @@

16138

return FAILURE;

16139

}

16140

16141

- if (r1->ts.u.cl->length)

16142

+ if (s1->ts.u.cl && s1->ts.u.cl->length

16143

+ && s2->ts.u.cl && s2->ts.u.cl->length)

16144

{

16145

int compval = gfc_dep_compare_expr (r1->ts.u.cl->length,

16146

r2->ts.u.cl->length);

16147

@@ -1367,8 +1368,8 @@

16148

if (s1->attr.function && s2->attr.function)

16149

{

16150

/* If both are functions, check result characteristics. */

16151

- if (check_result_characteristics (s1, s2, errmsg, err_len)

16152

- == FAILURE)

16153

+ if (check_result_characteristics (s1, s2, errmsg, err_len) == FAILURE

16154

+ || check_result_characteristics (s2, s1, errmsg, err_len) == FAILURE)

16155

return 0;

16156

}

16157

16158

Index: gcc/fortran/trans-expr.c

16159

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

16160

--- a/src/gcc/fortran/trans-expr.c (.../tags/gcc_4_8_2_release)

16161

+++ b/src/gcc/fortran/trans-expr.c (.../branches/gcc-4_8-branch)

16162

@@ -670,7 +670,6 @@

16163

gfc_add_modify (&parmse->post, vptr,

16164

fold_convert (TREE_TYPE (vptr), ctree));

16165

16166

- gcc_assert (!optional || (optional && !copyback));

16167

if (optional)

16168

{

16169

tree tmp2;

16170

Index: gcc/fortran/class.c

16171

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

16172

--- a/src/gcc/fortran/class.c (.../tags/gcc_4_8_2_release)

16173

+++ b/src/gcc/fortran/class.c (.../branches/gcc-4_8-branch)

16174

@@ -2486,7 +2486,7 @@

16175

return NULL;

16176

16177

/* Sometimes the typespec is passed from a single call. */

16178

- if (ts->type == BT_DERIVED)

16179

+ if (ts->type == BT_DERIVED || ts->type == BT_CLASS)

16180

return gfc_find_derived_vtab (ts->u.derived);

16181

16182

/* Find the top-level namespace. */

16183

Index: gcc/fortran/decl.c

16184

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

16185

--- a/src/gcc/fortran/decl.c (.../tags/gcc_4_8_2_release)

16186

+++ b/src/gcc/fortran/decl.c (.../branches/gcc-4_8-branch)

16187

@@ -7384,6 +7384,7 @@

16188

16189

16190

/* Check a derived type that is being extended. */

16191

+

16192

static gfc_symbol*

16193

check_extended_derived_type (char *name)

16194

{

16195

@@ -7395,14 +7396,15 @@

16196

return NULL;

16197

}

16198

16199

+ extended = gfc_find_dt_in_generic (extended);

16200

+

16201

+ /* F08:C428. */

16202

if (!extended)

16203

{

16204

- gfc_error ("No such symbol in TYPE definition at %C");

16205

+ gfc_error ("Symbol '%s' at %C has not been previously defined", name);

16206

return NULL;

16207

}

16208

16209

- extended = gfc_find_dt_in_generic (extended);

16210

-

16211

if (extended->attr.flavor != FL_DERIVED)

16212

{

16213

gfc_error ("'%s' in EXTENDS expression at %C is not a "

16214

Index: gcc/fortran/ChangeLog

16215

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

16216

--- a/src/gcc/fortran/ChangeLog (.../tags/gcc_4_8_2_release)

16217

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

16218

@@ -1,3 +1,78 @@

16219

+2014-01-04 Janus Weil <janus@gcc.gnu.org>

16220

+

16221

+ Backport from mainline

16222

+ 2014-01-02 Janus Weil <janus@gcc.gnu.org>

16223

+

16224

+ PR fortran/59654

16225

+ * resolve.c (resolve_typebound_procedures): No need to create the vtab

16226

+ here.

16227

+

16228

+2013-12-31 Janus Weil <janus@gcc.gnu.org>

16229

+

16230

+ Backport from mainline

16231

+ 2013-12-30 Janus Weil <janus@gcc.gnu.org>

16232

+

16233

+ PR fortran/58998

16234

+ * resolve.c (resolve_symbol): Check that symbol is not only flavorless

16235

+ but also untyped.

16236

+

16237

+2013-12-18 Janus Weil <janus@gcc.gnu.org>

16238

+

16239

+ Backport from mainline

16240

+ 2013-12-15 Janus Weil <janus@gcc.gnu.org>

16241

+

16242

+ PR fortran/59493

16243

+ * class.c (gfc_find_intrinsic_vtab): Handle BT_CLASS.

16244

+

16245

+2013-11-30 Paul Thomas <pault@gcc.gnu.org>

16246

+

16247

+ Backport from mainline

16248

+ 2013-11-04 Paul Thomas <pault@gcc.gnu.org>

16249

+

16250

+ PR fortran/57445

16251

+ * trans-expr.c (gfc_conv_class_to_class): Remove spurious

16252

+ assert.

16253

+

16254

+2013-11-17 Janus Weil <janus@gcc.gnu.org>

16255

+

16256

+ Backport from mainline

16257

+ 2013-11-07 Janus Weil <janus@gcc.gnu.org>

16258

+

16259

+ PR fortran/58471

16260

+ * primary.c (gfc_expr_attr): Check for result symbol.

16261

+

16262

+2013-11-16 Janus Weil <janus@gcc.gnu.org>

16263

+

16264

+ Backport from mainline

16265

+ 2013-09-20 Janus Weil <janus@gcc.gnu.org>

16266

+

16267

+ PR fortran/58099

16268

+ * expr.c (gfc_check_pointer_assign): Remove second call to

16269

+ 'gfc_compare_interfaces' with swapped arguments.

16270

+ * interface.c (gfc_compare_interfaces): Symmetrize the call to

16271

+ 'check_result_characteristics' by calling it with swapped arguments.

16272

+

16273

+2013-11-16 Paul Thomas <pault@gcc.gnu.org>

16274

+

16275

+ PR fortran/58771

16276

+ * trans-io.c (transfer_expr): If the backend_decl for a derived

16277

+ type is missing, build it with gfc_typenode_for_spec.

16278

+

16279

+2013-11-05 Steven G. Kargl <kargl@gcc.gnu.org>

16280

+

16281

+ PR fortran/58989

16282

+ * check.c (gfc_check_reshape): ensure that shape is a constant

16283

+ expression.

16284

+

16285

+2013-11-02 Janus Weil <janus@gcc.gnu.org>

16286

+

16287

+ Backport from mainline

16288

+ 2013-09-23 Janus Weil <janus@gcc.gnu.org>

16289

+

16290

+ PR fortran/58355

16291

+ * decl.c (check_extended_derived_type): Prevent segfault, modify error

16292

+ message.

16293

+

16294

2013-10-16 Release Manager

16295

16296

* GCC 4.8.2 released.

16297

Index: gcc/fortran/expr.c

16298

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

16299

--- a/src/gcc/fortran/expr.c (.../tags/gcc_4_8_2_release)

16300

+++ b/src/gcc/fortran/expr.c (.../branches/gcc-4_8-branch)

16301

@@ -3555,14 +3555,6 @@

16302

return FAILURE;

16303

}

16304

16305

- if (!gfc_compare_interfaces (s2, s1, name, 0, 1,

16306

- err, sizeof(err), NULL, NULL))

16307

- {

16308

- gfc_error ("Interface mismatch in procedure pointer assignment "

16309

- "at %L: %s", &rvalue->where, err);

16310

- return FAILURE;

16311

- }

16312

-

16313

return SUCCESS;

16314

}

16315

16316

Index: gcc/fortran/resolve.c

16317

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

16318

--- a/src/gcc/fortran/resolve.c (.../tags/gcc_4_8_2_release)

16319

+++ b/src/gcc/fortran/resolve.c (.../branches/gcc-4_8-branch)

16320

@@ -12425,9 +12425,6 @@

16321

resolve_bindings_derived = derived;

16322

resolve_bindings_result = SUCCESS;

16323

16324

- /* Make sure the vtab has been generated. */

16325

- gfc_find_derived_vtab (derived);

16326

-

16327

if (derived->f2k_derived->tb_sym_root)

16328

gfc_traverse_symtree (derived->f2k_derived->tb_sym_root,

16329

&resolve_typebound_procedure);

16330

@@ -13256,7 +13253,8 @@

16331

if (sym->attr.flavor == FL_UNKNOWN

16332

|| (sym->attr.flavor == FL_PROCEDURE && !sym->attr.intrinsic

16333

&& !sym->attr.generic && !sym->attr.external

16334

- && sym->attr.if_source == IFSRC_UNKNOWN))

16335

+ && sym->attr.if_source == IFSRC_UNKNOWN

16336

+ && sym->ts.type == BT_UNKNOWN))

16337

{

16338

16339

/* If we find that a flavorless symbol is an interface in one of the

16340

Index: gcc/fortran/trans-io.c

16341

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

16342

--- a/src/gcc/fortran/trans-io.c (.../tags/gcc_4_8_2_release)

16343

+++ b/src/gcc/fortran/trans-io.c (.../branches/gcc-4_8-branch)

16344

@@ -243,16 +243,16 @@

16345

16346

/* The code to generate the error. */

16347

gfc_start_block (&block);

16348

-

16349

+

16350

arg1 = gfc_build_addr_expr (NULL_TREE, var);

16351

-

16352

+

16353

arg2 = build_int_cst (integer_type_node, error_code),

16354

-

16355

+

16356

asprintf (&message, "%s", _(msgid));

16357

arg3 = gfc_build_addr_expr (pchar_type_node,

16358

gfc_build_localized_cstring_const (message));

16359

free (message);

16360

-

16361

+

16362

tmp = build_call_expr_loc (input_location,

16363

gfor_fndecl_generate_error, 3, arg1, arg2, arg3);

16364

16365

@@ -521,7 +521,7 @@

16366

gfc_trans_io_runtime_check (cond, var, LIBERROR_BAD_UNIT,

16367

"Unit number in I/O statement too small",

16368

&se.pre);

16369

-

16370

+

16371

/* UNIT numbers should be less than the max. */

16372

val = gfc_conv_mpz_to_tree (gfc_integer_kinds[i].huge, 4);

16373

cond = fold_build2_loc (input_location, GT_EXPR, boolean_type_node,

16374

@@ -1000,7 +1000,7 @@

16375

if (p->convert)

16376

mask |= set_string (&block, &post_block, var, IOPARM_open_convert,

16377

p->convert);

16378

-

16379

+

16380

if (p->newunit)

16381

mask |= set_parameter_ref (&block, &post_block, var, IOPARM_open_newunit,

16382

p->newunit);

16383

@@ -1234,7 +1234,7 @@

16384

{

16385

mask |= set_parameter_ref (&block, &post_block, var, IOPARM_inquire_exist,

16386

p->exist);

16387

-

16388

+

16389

if (p->unit && !p->iostat)

16390

{

16391

p->iostat = create_dummy_iostat ();

16392

@@ -1322,7 +1322,7 @@

16393

if (p->pad)

16394

mask |= set_string (&block, &post_block, var, IOPARM_inquire_pad,

16395

p->pad);

16396

-

16397

+

16398

if (p->convert)

16399

mask |= set_string (&block, &post_block, var, IOPARM_inquire_convert,

16400

p->convert);

16401

@@ -1547,7 +1547,7 @@

16402

tree dtype;

16403

tree dt_parm_addr;

16404

tree decl = NULL_TREE;

16405

- int n_dim;

16406

+ int n_dim;

16407

int itype;

16408

int rank = 0;

16409

16410

@@ -2032,7 +2032,7 @@

16411

if (gfc_notification_std (GFC_STD_GNU) != SILENT)

16412

{

16413

gfc_error_now ("Derived type '%s' at %L has PRIVATE components",

16414

- ts->u.derived->name, code != NULL ? &(code->loc) :

16415

+ ts->u.derived->name, code != NULL ? &(code->loc) :

16416

&gfc_current_locus);

16417

return;

16418

}

16419

@@ -2041,7 +2041,7 @@

16420

ts->kind = ts->u.derived->ts.kind;

16421

ts->f90_type = ts->u.derived->ts.f90_type;

16422

}

16423

-

16424

+

16425

kind = ts->kind;

16426

function = NULL;

16427

arg2 = NULL;

16428

@@ -2123,7 +2123,7 @@

16429

function = iocall[IOCALL_X_CHARACTER_WIDE];

16430

else

16431

function = iocall[IOCALL_X_CHARACTER_WIDE_WRITE];

16432

-

16433

+

16434

tmp = gfc_build_addr_expr (NULL_TREE, dt_parm);

16435

tmp = build_call_expr_loc (input_location,

16436

function, 4, tmp, addr_expr, arg2, arg3);

16437

@@ -2158,6 +2158,12 @@

16438

expr = build_fold_indirect_ref_loc (input_location,

16439

expr);

16440

16441

+ /* Make sure that the derived type has been built. An external

16442

+ function, if only referenced in an io statement requires this

16443

+ check (see PR58771). */

16444

+ if (ts->u.derived->backend_decl == NULL_TREE)

16445

+ tmp = gfc_typenode_for_spec (ts);

16446

+

16447

for (c = ts->u.derived->components; c; c = c->next)

16448

{

16449

field = c->backend_decl;

16450

Index: gcc/fortran/check.c

16451

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

16452

--- a/src/gcc/fortran/check.c (.../tags/gcc_4_8_2_release)

16453

+++ b/src/gcc/fortran/check.c (.../branches/gcc-4_8-branch)

16454

@@ -3208,7 +3208,7 @@

16455

"than %d elements", &shape->where, GFC_MAX_DIMENSIONS);

16456

return FAILURE;

16457

}

16458

- else if (shape->expr_type == EXPR_ARRAY)

16459

+ else if (shape->expr_type == EXPR_ARRAY && gfc_is_constant_expr (shape))

16460

{

16461

gfc_expr *e;

16462

int i, extent;

16463

Index: gcc/fortran/primary.c

16464

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

16465

--- a/src/gcc/fortran/primary.c (.../tags/gcc_4_8_2_release)

16466

+++ b/src/gcc/fortran/primary.c (.../branches/gcc-4_8-branch)

16467

@@ -2252,7 +2252,7 @@

16468

case EXPR_FUNCTION:

16469

gfc_clear_attr (&attr);

16470

16471

- if (e->value.function.esym != NULL)

16472

+ if (e->value.function.esym && e->value.function.esym->result)

16473

{

16474

gfc_symbol *sym = e->value.function.esym->result;

16475

attr = sym->attr;

16476

Index: gcc/configure.ac

16477

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

16478

--- a/src/gcc/configure.ac (.../tags/gcc_4_8_2_release)

16479

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

16480

@@ -1516,13 +1516,11 @@

16481

/* | [A-Za-z]:[\\/]* ) realsrcdir=${srcdir};;

16482

*) realsrcdir=../${srcdir};;

16483

esac

16484

- saved_CFLAGS="${CFLAGS}"

16485

CC="${CC_FOR_BUILD}" CFLAGS="${CFLAGS_FOR_BUILD}" \

16486

- LDFLAGS="${LDFLAGS_FOR_BUILD}" \

16487

+ LDFLAGS="${LDFLAGS_FOR_BUILD}" GMPINC="" \

16488

${realsrcdir}/configure \

16489

--enable-languages=${enable_languages-all} \

16490

--target=$target_alias --host=$build_alias --build=$build_alias

16491

- CFLAGS="${saved_CFLAGS}"

16492

16493

# We just finished tests for the build machine, so rename

16494

# the file auto-build.h in the gcc directory.

16495

@@ -1887,6 +1885,7 @@

16496

if test x$build != x$host || test "x$coverage_flags" != x

16497

then

16498

BUILD_CFLAGS='$(INTERNAL_CFLAGS) $(T_CFLAGS) $(CFLAGS_FOR_BUILD)'

16499

+ BUILD_CXXFLAGS='$(INTERNAL_CFLAGS) $(T_CFLAGS) $(CXXFLAGS_FOR_BUILD)'

16500

BUILD_LDFLAGS='$(LDFLAGS_FOR_BUILD)'

16501

fi

16502

16503

@@ -3611,6 +3610,19 @@

16504

kasumi_fi_xor %f46, %f48, %f50, %f52],,

16505

[AC_DEFINE(HAVE_AS_SPARC4, 1,

16506

[Define if your assembler supports SPARC4 instructions.])])

16507

+

16508

+ gcc_GAS_CHECK_FEATURE([LEON instructions],

16509

+ gcc_cv_as_sparc_leon,,

16510

+ [-Aleon],

16511

+ [.text

16512

+ .register %g2, #scratch

16513

+ .register %g3, #scratch

16514

+ .align 4

16515

+ smac %g2, %g3, %g1

16516

+ umac %g2, %g3, %g1

16517

+ cas [[%g2]], %g3, %g1],,

16518

+ [AC_DEFINE(HAVE_AS_LEON, 1,

16519

+ [Define if your assembler supports LEON instructions.])])

16520

;;

16521

16522

changequote(,)dnl

16523

@@ -5193,15 +5205,15 @@

16524

AC_MSG_CHECKING([for exported symbols])

16525

if test "x$export_sym_check" != x; then

16526

echo "int main() {return 0;} int foobar() {return 0;}" > conftest.c

16527

- ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest > /dev/null 2>&1

16528

- if $export_sym_check conftest | grep foobar > /dev/null; then

16529

+ ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest$ac_exeext > /dev/null 2>&1

16530

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

16531

: # No need to use a flag

16532

AC_MSG_RESULT([yes])

16533

else

16534

AC_MSG_RESULT([yes])

16535

AC_MSG_CHECKING([for -rdynamic])

16536

- ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest > /dev/null 2>&1

16537

- if $export_sym_check conftest | grep foobar > /dev/null; then

16538

+ ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest$ac_exeext > /dev/null 2>&1

16539

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

16540

plugin_rdynamic=yes

16541

pluginlibs="-rdynamic"

16542

else

16543

Index: gcc/BASE-VER

16544

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

16545

--- a/src/gcc/BASE-VER (.../tags/gcc_4_8_2_release)

16546

+++ b/src/gcc/BASE-VER (.../branches/gcc-4_8-branch)

16547

@@ -1 +1 @@

16548

-4.8.2

16549

+4.8.3

16550

Index: gcc/print-rtl.c

16551

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

16552

--- a/src/gcc/print-rtl.c (.../tags/gcc_4_8_2_release)

16553

+++ b/src/gcc/print-rtl.c (.../branches/gcc-4_8-branch)

16554

@@ -582,6 +582,8 @@

16555

16556

if (MEM_EXPR (in_rtx))

16557

print_mem_expr (outfile, MEM_EXPR (in_rtx));

16558

+ else

16559

+ fputc (' ', outfile);

16560

16561

if (MEM_OFFSET_KNOWN_P (in_rtx))

16562

fprintf (outfile, "+" HOST_WIDE_INT_PRINT_DEC, MEM_OFFSET (in_rtx));

16563

Index: gcc/ipa-split.c

16564

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

16565

--- a/src/gcc/ipa-split.c (.../tags/gcc_4_8_2_release)

16566

+++ b/src/gcc/ipa-split.c (.../branches/gcc-4_8-branch)

16567

@@ -136,7 +136,7 @@

16568

variable, check it if it is present in bitmap passed via DATA. */

16569

16570

static bool

16571

-test_nonssa_use (gimple stmt ATTRIBUTE_UNUSED, tree t, void *data)

16572

+test_nonssa_use (gimple, tree t, tree, void *data)

16573

{

16574

t = get_base_address (t);

16575

16576

@@ -229,7 +229,7 @@

16577

}

16578

if (gimple_code (stmt) == GIMPLE_LABEL

16579

&& test_nonssa_use (stmt, gimple_label_label (stmt),

16580

- non_ssa_vars))

16581

+ NULL_TREE, non_ssa_vars))

16582

{

16583

ok = false;

16584

goto done;

16585

@@ -258,7 +258,7 @@

16586

if (virtual_operand_p (gimple_phi_result (stmt)))

16587

continue;

16588

if (TREE_CODE (op) != SSA_NAME

16589

- && test_nonssa_use (stmt, op, non_ssa_vars))

16590

+ && test_nonssa_use (stmt, op, op, non_ssa_vars))

16591

{

16592

ok = false;

16593

goto done;

16594

@@ -670,7 +670,7 @@

16595

Return true when access to T prevents splitting the function. */

16596

16597

static bool

16598

-mark_nonssa_use (gimple stmt ATTRIBUTE_UNUSED, tree t, void *data)

16599

+mark_nonssa_use (gimple, tree t, tree, void *data)

16600

{

16601

t = get_base_address (t);

16602

16603

@@ -830,7 +830,7 @@

16604

if (TREE_CODE (op) == SSA_NAME)

16605

bitmap_set_bit (used_ssa_names, SSA_NAME_VERSION (op));

16606

else

16607

- can_split &= !mark_nonssa_use (stmt, op, non_ssa_vars);

16608

+ can_split &= !mark_nonssa_use (stmt, op, op, non_ssa_vars);

16609

}

16610

}

16611

return can_split;

16612

Index: gcc/alias.c

16613

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

16614

--- a/src/gcc/alias.c (.../tags/gcc_4_8_2_release)

16615

+++ b/src/gcc/alias.c (.../branches/gcc-4_8-branch)

16616

@@ -2871,17 +2871,14 @@

16617

/* Wipe the reg_seen array clean. */

16618

bitmap_clear (reg_seen);

16619

16620

- /* Mark all hard registers which may contain an address.

16621

- The stack, frame and argument pointers may contain an address.

16622

- An argument register which can hold a Pmode value may contain

16623

- an address even if it is not in BASE_REGS.

16624

+ /* Initialize the alias information for this pass. */

16625

+ for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)

16626

+ if (static_reg_base_value[i])

16627

+ {

16628

+ new_reg_base_value[i] = static_reg_base_value[i];

16629

+ bitmap_set_bit (reg_seen, i);

16630

+ }

16631

16632

- The address expression is VOIDmode for an argument and

16633

- Pmode for other registers. */

16634

-

16635

- memcpy (new_reg_base_value, static_reg_base_value,

16636

- FIRST_PSEUDO_REGISTER * sizeof (rtx));

16637

-

16638

/* Walk the insns adding values to the new_reg_base_value array. */

16639

for (i = 0; i < rpo_cnt; i++)

16640

{

16641

Index: gcc/tree-vect-loop.c

16642

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

16643

--- a/src/gcc/tree-vect-loop.c (.../tags/gcc_4_8_2_release)

16644

+++ b/src/gcc/tree-vect-loop.c (.../branches/gcc-4_8-branch)

16645

@@ -1537,7 +1537,7 @@

16646

16647

if (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)

16648

|| LOOP_VINFO_INT_NITERS (loop_vinfo) % vectorization_factor != 0

16649

- || LOOP_PEELING_FOR_ALIGNMENT (loop_vinfo))

16650

+ || LOOP_VINFO_PEELING_FOR_GAPS (loop_vinfo))

16651

{

16652

if (dump_enabled_p ())

16653

dump_printf_loc (MSG_NOTE, vect_location, "epilog loop required.");

16654

@@ -3115,14 +3115,12 @@

16655

stmt_vec_info stmt_vinfo = vinfo_for_stmt (iv_phi);

16656

loop_vec_info loop_vinfo = STMT_VINFO_LOOP_VINFO (stmt_vinfo);

16657

struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo);

16658

- tree scalar_type;

16659

tree vectype;

16660

int nunits;

16661

edge pe = loop_preheader_edge (loop);

16662

struct loop *iv_loop;

16663

basic_block new_bb;

16664

tree new_vec, vec_init, vec_step, t;

16665

- tree access_fn;

16666

tree new_var;

16667

tree new_name;

16668

gimple init_stmt, induction_phi, new_stmt;

16669

@@ -3130,7 +3128,6 @@

16670

tree init_expr, step_expr;

16671

int vf = LOOP_VINFO_VECT_FACTOR (loop_vinfo);

16672

int i;

16673

- bool ok;

16674

int ncopies;

16675

tree expr;

16676

stmt_vec_info phi_info = vinfo_for_stmt (iv_phi);

16677

@@ -3159,16 +3156,14 @@

16678

latch_e = loop_latch_edge (iv_loop);

16679

loop_arg = PHI_ARG_DEF_FROM_EDGE (iv_phi, latch_e);

16680

16681

- access_fn = analyze_scalar_evolution (iv_loop, PHI_RESULT (iv_phi));

16682

- gcc_assert (access_fn);

16683

- STRIP_NOPS (access_fn);

16684

- ok = vect_is_simple_iv_evolution (iv_loop->num, access_fn,

16685

- &init_expr, &step_expr);

16686

- gcc_assert (ok);

16687

+ step_expr = STMT_VINFO_LOOP_PHI_EVOLUTION_PART (phi_info);

16688

+ gcc_assert (step_expr != NULL_TREE);

16689

+

16690

pe = loop_preheader_edge (iv_loop);

16691

+ init_expr = PHI_ARG_DEF_FROM_EDGE (iv_phi,

16692

+ loop_preheader_edge (iv_loop));

16693

16694

- scalar_type = TREE_TYPE (init_expr);

16695

- vectype = get_vectype_for_scalar_type (scalar_type);

16696

+ vectype = get_vectype_for_scalar_type (TREE_TYPE (init_expr));

16697

resvectype = get_vectype_for_scalar_type (TREE_TYPE (PHI_RESULT (iv_phi)));

16698

gcc_assert (vectype);

16699

nunits = TYPE_VECTOR_SUBPARTS (vectype);

16700

@@ -3177,6 +3172,16 @@

16701

gcc_assert (phi_info);

16702

gcc_assert (ncopies >= 1);

16703

16704

+ /* Convert the step to the desired type. */

16705

+ step_expr = force_gimple_operand (fold_convert (TREE_TYPE (vectype),

16706

+ step_expr),

16707

+ &stmts, true, NULL_TREE);

16708

+ if (stmts)

16709

+ {

16710

+ new_bb = gsi_insert_seq_on_edge_immediate (pe, stmts);

16711

+ gcc_assert (!new_bb);

16712

+ }

16713

+

16714

/* Find the first insertion point in the BB. */

16715

si = gsi_after_labels (bb);

16716

16717

@@ -3186,9 +3191,7 @@

16718

/* iv_loop is nested in the loop to be vectorized. init_expr had already

16719

been created during vectorization of previous stmts. We obtain it

16720

from the STMT_VINFO_VEC_STMT of the defining stmt. */

16721

- tree iv_def = PHI_ARG_DEF_FROM_EDGE (iv_phi,

16722

- loop_preheader_edge (iv_loop));

16723

- vec_init = vect_get_vec_def_for_operand (iv_def, iv_phi, NULL);

16724

+ vec_init = vect_get_vec_def_for_operand (init_expr, iv_phi, NULL);

16725

/* If the initial value is not of proper type, convert it. */

16726

if (!useless_type_conversion_p (vectype, TREE_TYPE (vec_init)))

16727

{

16728

@@ -3211,8 +3214,11 @@

16729

16730

/* iv_loop is the loop to be vectorized. Create:

16731

vec_init = [X, X+S, X+2*S, X+3*S] (S = step_expr, X = init_expr) */

16732

- new_var = vect_get_new_vect_var (scalar_type, vect_scalar_var, "var_");

16733

- new_name = force_gimple_operand (init_expr, &stmts, false, new_var);

16734

+ new_var = vect_get_new_vect_var (TREE_TYPE (vectype),

16735

+ vect_scalar_var, "var_");

16736

+ new_name = force_gimple_operand (fold_convert (TREE_TYPE (vectype),

16737

+ init_expr),

16738

+ &stmts, false, new_var);

16739

if (stmts)

16740

{

16741

new_bb = gsi_insert_seq_on_edge_immediate (pe, stmts);

16742

@@ -3224,9 +3230,7 @@

16743

for (i = 1; i < nunits; i++)

16744

{

16745

/* Create: new_name_i = new_name + step_expr */

16746

- enum tree_code code = POINTER_TYPE_P (scalar_type)

16747

- ? POINTER_PLUS_EXPR : PLUS_EXPR;

16748

- init_stmt = gimple_build_assign_with_ops (code, new_var,

16749

+ init_stmt = gimple_build_assign_with_ops (PLUS_EXPR, new_var,

16750

new_name, step_expr);

16751

new_name = make_ssa_name (new_var, init_stmt);

16752

gimple_assign_set_lhs (init_stmt, new_name);

16753

Index: gcc/lra-coalesce.c

16754

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

16755

--- a/src/gcc/lra-coalesce.c (.../tags/gcc_4_8_2_release)

16756

+++ b/src/gcc/lra-coalesce.c (.../branches/gcc-4_8-branch)

16757

@@ -221,9 +221,12 @@

16758

basic_block bb;

16759

rtx mv, set, insn, next, *sorted_moves;

16760

int i, mv_num, sregno, dregno;

16761

+ unsigned int regno;

16762

int coalesced_moves;

16763

int max_regno = max_reg_num ();

16764

bitmap_head involved_insns_bitmap;

16765

+ bitmap_head result_pseudo_vals_bitmap;

16766

+ bitmap_iterator bi;

16767

16768

timevar_push (TV_LRA_COALESCE);

16769

16770

@@ -318,6 +321,34 @@

16771

}

16772

}

16773

}

16774

+ /* If we have situation after inheritance pass:

16775

+

16776

+ r1 <- ... insn originally setting p1

16777

+ i1 <- r1 setting inheritance i1 from reload r1

16778

+ ...

16779

+ ... <- ... p2 ... dead p2

16780

+ ..

16781

+ p1 <- i1

16782

+ r2 <- i1

16783

+ ...<- ... r2 ...

16784

+

16785

+ And we are coalescing p1 and p2 using p1. In this case i1 and p1

16786

+ should have different values, otherwise they can get the same

16787

+ hard reg and this is wrong for insn using p2 before coalescing.

16788

+ So invalidate such inheritance pseudo values. */

16789

+ bitmap_initialize (&result_pseudo_vals_bitmap, &reg_obstack);

16790

+ EXECUTE_IF_SET_IN_BITMAP (&coalesced_pseudos_bitmap, 0, regno, bi)

16791

+ bitmap_set_bit (&result_pseudo_vals_bitmap,

16792

+ lra_reg_info[first_coalesced_pseudo[regno]].val);

16793

+ EXECUTE_IF_SET_IN_BITMAP (&lra_inheritance_pseudos, 0, regno, bi)

16794

+ if (bitmap_bit_p (&result_pseudo_vals_bitmap, lra_reg_info[regno].val))

16795

+ {

16796

+ lra_set_regno_unique_value (regno);

16797

+ if (lra_dump_file != NULL)

16798

+ fprintf (lra_dump_file,

16799

+ " Make unique value for inheritance r%d\n", regno);

16800

+ }

16801

+ bitmap_clear (&result_pseudo_vals_bitmap);

16802

bitmap_clear (&used_pseudos_bitmap);

16803

bitmap_clear (&involved_insns_bitmap);

16804

bitmap_clear (&coalesced_pseudos_bitmap);

16805

Index: gcc/gimplify.c

16806

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

16807

--- a/src/gcc/gimplify.c (.../tags/gcc_4_8_2_release)

16808

+++ b/src/gcc/gimplify.c (.../branches/gcc-4_8-branch)

16809

@@ -2060,6 +2060,9 @@

16810

/* Nonlocal VLAs seen in the current function. */

16811

static struct pointer_set_t *nonlocal_vlas;

16812

16813

+/* The VAR_DECLs created for nonlocal VLAs for debug info purposes. */

16814

+static tree nonlocal_vla_vars;

16815

+

16816

/* Gimplify a VAR_DECL or PARM_DECL. Return GS_OK if we expanded a

16817

DECL_VALUE_EXPR, and it's worth re-examining things. */

16818

16819

@@ -2106,14 +2109,13 @@

16820

ctx = ctx->outer_context;

16821

if (!ctx && !pointer_set_insert (nonlocal_vlas, decl))

16822

{

16823

- tree copy = copy_node (decl), block;

16824

+ tree copy = copy_node (decl);

16825

16826

lang_hooks.dup_lang_specific_decl (copy);

16827

SET_DECL_RTL (copy, 0);

16828

TREE_USED (copy) = 1;

16829

- block = DECL_INITIAL (current_function_decl);

16830

- DECL_CHAIN (copy) = BLOCK_VARS (block);

16831

- BLOCK_VARS (block) = copy;

16832

+ DECL_CHAIN (copy) = nonlocal_vla_vars;

16833

+ nonlocal_vla_vars = copy;

16834

SET_DECL_VALUE_EXPR (copy, unshare_expr (value_expr));

16835

DECL_HAS_VALUE_EXPR_P (copy) = 1;

16836

}

16837

@@ -4369,7 +4371,7 @@

16838

unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;

16839

tree index = bitsize_int (indexi);

16840

if (offset / part_widthi

16841

- <= TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))

16842

+ < TYPE_VECTOR_SUBPARTS (TREE_TYPE (addrtype)))

16843

return fold_build3 (BIT_FIELD_REF, type, TREE_OPERAND (addr, 0),

16844

part_width, index);

16845

}

16846

@@ -6131,7 +6133,7 @@

16847

region's REDUCTION clause. */

16848

16849

static bool

16850

-omp_check_private (struct gimplify_omp_ctx *ctx, tree decl)

16851

+omp_check_private (struct gimplify_omp_ctx *ctx, tree decl, bool copyprivate)

16852

{

16853

splay_tree_node n;

16854

16855

@@ -6140,8 +6142,11 @@

16856

ctx = ctx->outer_context;

16857

if (ctx == NULL)

16858

return !(is_global_var (decl)

16859

- /* References might be private, but might be shared too. */

16860

- || lang_hooks.decls.omp_privatize_by_reference (decl));

16861

+ /* References might be private, but might be shared too,

16862

+ when checking for copyprivate, assume they might be

16863

+ private, otherwise assume they might be shared. */

16864

+ || (!copyprivate

16865

+ && lang_hooks.decls.omp_privatize_by_reference (decl)));

16866

16867

n = splay_tree_lookup (ctx->variables, (splay_tree_key) decl);

16868

if (n != NULL)

16869

@@ -6267,12 +6272,36 @@

16870

remove = true;

16871

break;

16872

}

16873

+ if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_COPYPRIVATE

16874

+ && !remove

16875

+ && !omp_check_private (ctx, decl, true))

16876

+ {

16877

+ remove = true;

16878

+ if (is_global_var (decl))

16879

+ {

16880

+ if (DECL_THREAD_LOCAL_P (decl))

16881

+ remove = false;

16882

+ else if (DECL_HAS_VALUE_EXPR_P (decl))

16883

+ {

16884

+ tree value = get_base_address (DECL_VALUE_EXPR (decl));

16885

+

16886

+ if (value

16887

+ && DECL_P (value)

16888

+ && DECL_THREAD_LOCAL_P (value))

16889

+ remove = false;

16890

+ }

16891

+ }

16892

+ if (remove)

16893

+ error_at (OMP_CLAUSE_LOCATION (c),

16894

+ "copyprivate variable %qE is not threadprivate"

16895

+ " or private in outer context", DECL_NAME (decl));

16896

+ }

16897

do_notice:

16898

if (outer_ctx)

16899

omp_notice_variable (outer_ctx, decl, true);

16900

if (check_non_private

16901

&& region_type == ORT_WORKSHARE

16902

- && omp_check_private (ctx, decl))

16903

+ && omp_check_private (ctx, decl, false))

16904

{

16905

error ("%s variable %qE is private in outer context",

16906

check_non_private, DECL_NAME (decl));

16907

@@ -8261,6 +8290,21 @@

16908

16909

if (nonlocal_vlas)

16910

{

16911

+ if (nonlocal_vla_vars)

16912

+ {

16913

+ /* tree-nested.c may later on call declare_vars (..., true);

16914

+ which relies on BLOCK_VARS chain to be the tail of the

16915

+ gimple_bind_vars chain. Ensure we don't violate that

16916

+ assumption. */

16917

+ if (gimple_bind_block (outer_bind)

16918

+ == DECL_INITIAL (current_function_decl))

16919

+ declare_vars (nonlocal_vla_vars, outer_bind, true);

16920

+ else

16921

+ BLOCK_VARS (DECL_INITIAL (current_function_decl))

16922

+ = chainon (BLOCK_VARS (DECL_INITIAL (current_function_decl)),

16923

+ nonlocal_vla_vars);

16924

+ nonlocal_vla_vars = NULL_TREE;

16925

+ }

16926

pointer_set_destroy (nonlocal_vlas);

16927

nonlocal_vlas = NULL;

16928

}

16929

Index: gcc/tree-dfa.c

16930

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

16931

--- a/src/gcc/tree-dfa.c (.../tags/gcc_4_8_2_release)

16932

+++ b/src/gcc/tree-dfa.c (.../branches/gcc-4_8-branch)

16933

@@ -386,7 +386,6 @@

16934

double_int bit_offset = double_int_zero;

16935

HOST_WIDE_INT hbit_offset;

16936

bool seen_variable_array_ref = false;

16937

- tree base_type;

16938

16939

/* First get the final access size from just the outermost expression. */

16940

if (TREE_CODE (exp) == COMPONENT_REF)

16941

@@ -417,8 +416,6 @@

16942

and find the ultimate containing object. */

16943

while (1)

16944

{

16945

- base_type = TREE_TYPE (exp);

16946

-

16947

switch (TREE_CODE (exp))

16948

{

16949

case BIT_FIELD_REF:

16950

@@ -543,7 +540,38 @@

16951

case VIEW_CONVERT_EXPR:

16952

break;

16953

16954

+ case TARGET_MEM_REF:

16955

+ /* Via the variable index or index2 we can reach the

16956

+ whole object. Still hand back the decl here. */

16957

+ if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR

16958

+ && (TMR_INDEX (exp) || TMR_INDEX2 (exp)))

16959

+ {

16960

+ exp = TREE_OPERAND (TMR_BASE (exp), 0);

16961

+ bit_offset = double_int_zero;

16962

+ maxsize = -1;

16963

+ goto done;

16964

+ }

16965

+ /* Fallthru. */

16966

case MEM_REF:

16967

+ /* We need to deal with variable arrays ending structures such as

16968

+ struct { int length; int a[1]; } x; x.a[d]

16969

+ struct { struct { int a; int b; } a[1]; } x; x.a[d].a

16970

+ struct { struct { int a[1]; } a[1]; } x; x.a[0][d], x.a[d][0]

16971

+ struct { int len; union { int a[1]; struct X x; } u; } x; x.u.a[d]

16972

+ where we do not know maxsize for variable index accesses to

16973

+ the array. The simplest way to conservatively deal with this

16974

+ is to punt in the case that offset + maxsize reaches the

16975

+ base type boundary. This needs to include possible trailing

16976

+ padding that is there for alignment purposes. */

16977

+ if (seen_variable_array_ref

16978

+ && maxsize != -1

16979

+ && (!bit_offset.fits_shwi ()

16980

+ || !host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)

16981

+ || (bit_offset.to_shwi () + maxsize

16982

+ == (HOST_WIDE_INT) TREE_INT_CST_LOW

16983

+ (TYPE_SIZE (TREE_TYPE (exp))))))

16984

+ maxsize = -1;

16985

+

16986

/* Hand back the decl for MEM[&decl, off]. */

16987

if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)

16988

{

16989

@@ -565,45 +593,24 @@

16990

}

16991

goto done;

16992

16993

- case TARGET_MEM_REF:

16994

- /* Hand back the decl for MEM[&decl, off]. */

16995

- if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR)

16996

- {

16997

- /* Via the variable index or index2 we can reach the

16998

- whole object. */

16999

- if (TMR_INDEX (exp) || TMR_INDEX2 (exp))

17000

- {

17001

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

17002

- bit_offset = double_int_zero;

17003

- maxsize = -1;

17004

- goto done;

17005

- }

17006

- if (integer_zerop (TMR_OFFSET (exp)))

17007

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

17008

- else

17009

- {

17010

- double_int off = mem_ref_offset (exp);

17011

- off = off.alshift (BITS_PER_UNIT == 8

17012

- ? 3 : exact_log2 (BITS_PER_UNIT),

17013

- HOST_BITS_PER_DOUBLE_INT);

17014

- off += bit_offset;

17015

- if (off.fits_shwi ())

17016

- {

17017

- bit_offset = off;

17018

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

17019

- }

17020

- }

17021

- }

17022

- goto done;

17023

-

17024

default:

17025

goto done;

17026

}

17027

17028

exp = TREE_OPERAND (exp, 0);

17029

}

17030

- done:

17031

17032

+ /* We need to deal with variable arrays ending structures. */

17033

+ if (seen_variable_array_ref

17034

+ && maxsize != -1

17035

+ && (!bit_offset.fits_shwi ()

17036

+ || !host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)

17037

+ || (bit_offset.to_shwi () + maxsize

17038

+ == (HOST_WIDE_INT)

17039

+ TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp))))))

17040

+ maxsize = -1;

17041

+

17042

+ done:

17043

if (!bit_offset.fits_shwi ())

17044

{

17045

*poffset = 0;

17046

@@ -615,24 +622,6 @@

17047

17048

hbit_offset = bit_offset.to_shwi ();

17049

17050

- /* We need to deal with variable arrays ending structures such as

17051

- struct { int length; int a[1]; } x; x.a[d]

17052

- struct { struct { int a; int b; } a[1]; } x; x.a[d].a

17053

- struct { struct { int a[1]; } a[1]; } x; x.a[0][d], x.a[d][0]

17054

- struct { int len; union { int a[1]; struct X x; } u; } x; x.u.a[d]

17055

- where we do not know maxsize for variable index accesses to

17056

- the array. The simplest way to conservatively deal with this

17057

- is to punt in the case that offset + maxsize reaches the

17058

- base type boundary. This needs to include possible trailing padding

17059

- that is there for alignment purposes. */

17060

-

17061

- if (seen_variable_array_ref

17062

- && maxsize != -1

17063

- && (!host_integerp (TYPE_SIZE (base_type), 1)

17064

- || (hbit_offset + maxsize

17065

- == (signed) TREE_INT_CST_LOW (TYPE_SIZE (base_type)))))

17066

- maxsize = -1;

17067

-

17068

/* In case of a decl or constant base object we can do better. */

17069

17070

if (DECL_P (exp))

17071

Index: gcc/gimple-fold.c

17072

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

17073

--- a/src/gcc/gimple-fold.c (.../tags/gcc_4_8_2_release)

17074

+++ b/src/gcc/gimple-fold.c (.../branches/gcc-4_8-branch)

17075

@@ -178,7 +178,7 @@

17076

/* Make sure we create a cgraph node for functions we'll reference.

17077

They can be non-existent if the reference comes from an entry

17078

of an external vtable for example. */

17079

- cgraph_get_create_node (base);

17080

+ cgraph_get_create_real_symbol_node (base);

17081

}

17082

/* Fixup types in global initializers. */

17083

if (TREE_TYPE (TREE_TYPE (cval)) != TREE_TYPE (TREE_OPERAND (cval, 0)))

17084

Index: gcc/cfgexpand.c

17085

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

17086

--- a/src/gcc/cfgexpand.c (.../tags/gcc_4_8_2_release)

17087

+++ b/src/gcc/cfgexpand.c (.../branches/gcc-4_8-branch)

17088

@@ -331,7 +331,7 @@

17089

enter its partition number into bitmap DATA. */

17090

17091

static bool

17092

-visit_op (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

17093

+visit_op (gimple, tree op, tree, void *data)

17094

{

17095

bitmap active = (bitmap)data;

17096

op = get_base_address (op);

17097

@@ -351,7 +351,7 @@

17098

from bitmap DATA. */

17099

17100

static bool

17101

-visit_conflict (gimple stmt ATTRIBUTE_UNUSED, tree op, void *data)

17102

+visit_conflict (gimple, tree op, tree, void *data)

17103

{

17104

bitmap active = (bitmap)data;

17105

op = get_base_address (op);

17106

@@ -385,7 +385,7 @@

17107

edge e;

17108

edge_iterator ei;

17109

gimple_stmt_iterator gsi;

17110

- bool (*visit)(gimple, tree, void *);

17111

+ walk_stmt_load_store_addr_fn visit;

17112

17113

bitmap_clear (work);

17114

FOR_EACH_EDGE (e, ei, bb->preds)

17115

@@ -4707,14 +4707,18 @@

17116

if (e->insns.r)

17117

{

17118

rebuild_jump_labels_chain (e->insns.r);

17119

- /* Avoid putting insns before parm_birth_insn. */

17120

+ /* Put insns after parm birth, but before

17121

+ NOTE_INSNS_FUNCTION_BEG. */

17122

if (e->src == ENTRY_BLOCK_PTR

17123

- && single_succ_p (ENTRY_BLOCK_PTR)

17124

- && parm_birth_insn)

17125

+ && single_succ_p (ENTRY_BLOCK_PTR))

17126

{

17127

rtx insns = e->insns.r;

17128

e->insns.r = NULL_RTX;

17129

- emit_insn_after_noloc (insns, parm_birth_insn, e->dest);

17130

+ if (NOTE_P (parm_birth_insn)

17131

+ && NOTE_KIND (parm_birth_insn) == NOTE_INSN_FUNCTION_BEG)

17132

+ emit_insn_before_noloc (insns, parm_birth_insn, e->dest);

17133

+ else

17134

+ emit_insn_after_noloc (insns, parm_birth_insn, e->dest);

17135

}

17136

else

17137

commit_one_edge_insertion (e);

17138

Index: gcc/tree-ssa-pre.c

17139

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

17140

--- a/src/gcc/tree-ssa-pre.c (.../tags/gcc_4_8_2_release)

17141

+++ b/src/gcc/tree-ssa-pre.c (.../branches/gcc-4_8-branch)

17142

@@ -3664,6 +3664,12 @@

17143

if (dump_file && dump_flags & TDF_DETAILS)

17144

fprintf (dump_file, "Starting insert iteration %d\n", num_iterations);

17145

new_stuff = insert_aux (ENTRY_BLOCK_PTR);

17146

+

17147

+ /* Clear the NEW sets before the next iteration. We have already

17148

+ fully propagated its contents. */

17149

+ if (new_stuff)

17150

+ FOR_ALL_BB (bb)

17151

+ bitmap_set_free (NEW_SETS (bb));

17152

}

17153

statistics_histogram_event (cfun, "insert iterations", num_iterations);

17154

}

17155

Index: gcc/cfgcleanup.c

17156

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

17157

--- a/src/gcc/cfgcleanup.c (.../tags/gcc_4_8_2_release)

17158

+++ b/src/gcc/cfgcleanup.c (.../branches/gcc-4_8-branch)

17159

@@ -1293,7 +1293,6 @@

17160

{

17161

rtx i1, i2, last1, last2, afterlast1, afterlast2;

17162

int ninsns = 0;

17163

- rtx p1;

17164

enum replace_direction dir, last_dir, afterlast_dir;

17165

bool follow_fallthru, did_fallthru;

17166

17167

@@ -1321,8 +1320,9 @@

17168

|| (returnjump_p (i2) && !side_effects_p (PATTERN (i2))))

17169

{

17170

last2 = i2;

17171

- /* Count everything except for unconditional jump as insn. */

17172

- if (!simplejump_p (i2) && !returnjump_p (i2) && last1)

17173

+ /* Count everything except for unconditional jump as insn.

17174

+ Don't count any jumps if dir_p is NULL. */

17175

+ if (!simplejump_p (i2) && !returnjump_p (i2) && last1 && dir_p)

17176

ninsns++;

17177

i2 = PREV_INSN (i2);

17178

}

17179

@@ -1373,8 +1373,8 @@

17180

last1 = i1, last2 = i2;

17181

afterlast_dir = last_dir;

17182

last_dir = dir;

17183

- p1 = PATTERN (i1);

17184

- if (!(GET_CODE (p1) == USE || GET_CODE (p1) == CLOBBER))

17185

+ if (GET_CODE (PATTERN (i1)) != USE

17186

+ && GET_CODE (PATTERN (i1)) != CLOBBER)

17187

ninsns++;

17188

}

17189

17190

@@ -1420,7 +1420,8 @@

17191

/* Like flow_find_cross_jump, except start looking for a matching sequence from

17192

the head of the two blocks. Do not include jumps at the end.

17193

If STOP_AFTER is nonzero, stop after finding that many matching

17194

- instructions. */

17195

+ instructions. If STOP_AFTER is zero, count all INSN_P insns, if it is

17196

+ non-zero, only count active insns. */

17197

17198

int

17199

flow_find_head_matching_sequence (basic_block bb1, basic_block bb2, rtx *f1,

17200

@@ -1492,7 +1493,10 @@

17201

17202

beforelast1 = last1, beforelast2 = last2;

17203

last1 = i1, last2 = i2;

17204

- ninsns++;

17205

+ if (!stop_after

17206

+ || (GET_CODE (PATTERN (i1)) != USE

17207

+ && GET_CODE (PATTERN (i1)) != CLOBBER))

17208

+ ninsns++;

17209

}

17210

17211

if (i1 == BB_END (bb1) || i2 == BB_END (bb2)

17212

Index: gcc/simplify-rtx.c

17213

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

17214

--- a/src/gcc/simplify-rtx.c (.../tags/gcc_4_8_2_release)

17215

+++ b/src/gcc/simplify-rtx.c (.../branches/gcc-4_8-branch)

17216

@@ -639,11 +639,16 @@

17217

XEXP (op, 0), origmode);

17218

}

17219

17220

- /* Simplify (truncate:SI (op:DI (x:DI) (y:DI)))

17221

- to (op:SI (truncate:SI (x:DI)) (truncate:SI (x:DI))). */

17222

- if (GET_CODE (op) == PLUS

17223

- || GET_CODE (op) == MINUS

17224

- || GET_CODE (op) == MULT)

17225

+ /* If the machine can perform operations in the truncated mode, distribute

17226

+ the truncation, i.e. simplify (truncate:QI (op:SI (x:SI) (y:SI))) into

17227

+ (op:QI (truncate:QI (x:SI)) (truncate:QI (y:SI))). */

17228

+ if (1

17229

+#ifdef WORD_REGISTER_OPERATIONS

17230

+ && precision >= BITS_PER_WORD

17231

+#endif

17232

+ && (GET_CODE (op) == PLUS

17233

+ || GET_CODE (op) == MINUS

17234

+ || GET_CODE (op) == MULT))

17235

{

17236

rtx op0 = simplify_gen_unary (TRUNCATE, mode, XEXP (op, 0), op_mode);

17237

if (op0)

17238

Index: gcc/tree-sra.c

17239

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

17240

--- a/src/gcc/tree-sra.c (.../tags/gcc_4_8_2_release)

17241

+++ b/src/gcc/tree-sra.c (.../branches/gcc-4_8-branch)

17242

@@ -1161,8 +1161,7 @@

17243

GIMPLE_ASM operands with memory constrains which cannot be scalarized. */

17244

17245

static bool

17246

-asm_visit_addr (gimple stmt ATTRIBUTE_UNUSED, tree op,

17247

- void *data ATTRIBUTE_UNUSED)

17248

+asm_visit_addr (gimple, tree op, tree, void *)

17249

{

17250

op = get_base_address (op);

17251

if (op

17252

Index: gcc/tree-predcom.c

17253

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

17254

--- a/src/gcc/tree-predcom.c (.../tags/gcc_4_8_2_release)

17255

+++ b/src/gcc/tree-predcom.c (.../branches/gcc-4_8-branch)

17256

@@ -1323,90 +1323,43 @@

17257

gsi_insert_after (&bsi, new_stmt, GSI_NEW_STMT);

17258

}

17259

17260

-/* Returns the reference to the address of REF in the ITER-th iteration of

17261

- LOOP, or NULL if we fail to determine it (ITER may be negative). We

17262

- try to preserve the original shape of the reference (not rewrite it

17263

- as an indirect ref to the address), to make tree_could_trap_p in

17264

- prepare_initializers_chain return false more often. */

17265

+/* Returns a memory reference to DR in the ITER-th iteration of

17266

+ the loop it was analyzed in. Append init stmts to STMTS. */

17267

17268

-static tree

17269

-ref_at_iteration (struct loop *loop, tree ref, int iter)

17270

+static tree

17271

+ref_at_iteration (data_reference_p dr, int iter, gimple_seq *stmts)

17272

{

17273

- tree idx, *idx_p, type, val, op0 = NULL_TREE, ret;

17274

- affine_iv iv;

17275

- bool ok;

17276

-

17277

- if (handled_component_p (ref))

17278

- {

17279

- op0 = ref_at_iteration (loop, TREE_OPERAND (ref, 0), iter);

17280

- if (!op0)

17281

- return NULL_TREE;

17282

- }

17283

- else if (!INDIRECT_REF_P (ref)

17284

- && TREE_CODE (ref) != MEM_REF)

17285

- return unshare_expr (ref);

17286

-

17287

- if (TREE_CODE (ref) == MEM_REF)

17288

- {

17289

- ret = unshare_expr (ref);

17290

- idx = TREE_OPERAND (ref, 0);

17291

- idx_p = &TREE_OPERAND (ret, 0);

17292

- }

17293

- else if (TREE_CODE (ref) == COMPONENT_REF)

17294

- {

17295

- /* Check that the offset is loop invariant. */

17296

- if (TREE_OPERAND (ref, 2)

17297

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 2)))

17298

- return NULL_TREE;

17299

-

17300

- return build3 (COMPONENT_REF, TREE_TYPE (ref), op0,

17301

- unshare_expr (TREE_OPERAND (ref, 1)),

17302

- unshare_expr (TREE_OPERAND (ref, 2)));

17303

- }

17304

- else if (TREE_CODE (ref) == ARRAY_REF)

17305

- {

17306

- /* Check that the lower bound and the step are loop invariant. */

17307

- if (TREE_OPERAND (ref, 2)

17308

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 2)))

17309

- return NULL_TREE;

17310

- if (TREE_OPERAND (ref, 3)

17311

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 3)))

17312

- return NULL_TREE;

17313

-

17314

- ret = build4 (ARRAY_REF, TREE_TYPE (ref), op0, NULL_TREE,

17315

- unshare_expr (TREE_OPERAND (ref, 2)),

17316

- unshare_expr (TREE_OPERAND (ref, 3)));

17317

- idx = TREE_OPERAND (ref, 1);

17318

- idx_p = &TREE_OPERAND (ret, 1);

17319

- }

17320

+ tree off = DR_OFFSET (dr);

17321

+ tree coff = DR_INIT (dr);

17322

+ if (iter == 0)

17323

+ ;

17324

+ else if (TREE_CODE (DR_STEP (dr)) == INTEGER_CST)

17325

+ coff = size_binop (PLUS_EXPR, coff,

17326

+ size_binop (MULT_EXPR, DR_STEP (dr), ssize_int (iter)));

17327

else

17328

- return NULL_TREE;

17329

-

17330

- ok = simple_iv (loop, loop, idx, &iv, true);

17331

- if (!ok)

17332

- return NULL_TREE;

17333

- iv.base = expand_simple_operations (iv.base);

17334

- if (integer_zerop (iv.step))

17335

- *idx_p = unshare_expr (iv.base);

17336

- else

17337

+ off = size_binop (PLUS_EXPR, off,

17338

+ size_binop (MULT_EXPR, DR_STEP (dr), ssize_int (iter)));

17339

+ tree addr = fold_build_pointer_plus (DR_BASE_ADDRESS (dr), off);

17340

+ addr = force_gimple_operand_1 (addr, stmts, is_gimple_mem_ref_addr,

17341

+ NULL_TREE);

17342

+ tree alias_ptr = fold_convert (reference_alias_ptr_type (DR_REF (dr)), coff);

17343

+ /* While data-ref analysis punts on bit offsets it still handles

17344

+ bitfield accesses at byte boundaries. Cope with that. Note that

17345

+ we cannot simply re-apply the outer COMPONENT_REF because the

17346

+ byte-granular portion of it is already applied via DR_INIT and

17347

+ DR_OFFSET, so simply build a BIT_FIELD_REF knowing that the bits

17348

+ start at offset zero. */

17349

+ if (TREE_CODE (DR_REF (dr)) == COMPONENT_REF

17350

+ && DECL_BIT_FIELD (TREE_OPERAND (DR_REF (dr), 1)))

17351

{

17352

- type = TREE_TYPE (iv.base);

17353

- if (POINTER_TYPE_P (type))

17354

- {

17355

- val = fold_build2 (MULT_EXPR, sizetype, iv.step,

17356

- size_int (iter));

17357

- val = fold_build_pointer_plus (iv.base, val);

17358

- }

17359

- else

17360

- {

17361

- val = fold_build2 (MULT_EXPR, type, iv.step,

17362

- build_int_cst_type (type, iter));

17363

- val = fold_build2 (PLUS_EXPR, type, iv.base, val);

17364

- }

17365

- *idx_p = unshare_expr (val);

17366

+ tree field = TREE_OPERAND (DR_REF (dr), 1);

17367

+ return build3 (BIT_FIELD_REF, TREE_TYPE (DR_REF (dr)),

17368

+ build2 (MEM_REF, DECL_BIT_FIELD_TYPE (field),

17369

+ addr, alias_ptr),

17370

+ DECL_SIZE (field), bitsize_zero_node);

17371

}

17372

-

17373

- return ret;

17374

+ else

17375

+ return fold_build2 (MEM_REF, TREE_TYPE (DR_REF (dr)), addr, alias_ptr);

17376

}

17377

17378

/* Get the initialization expression for the INDEX-th temporary variable

17379

@@ -2068,7 +2021,11 @@

17380

17381

stmt = find_common_use_stmt (&name1, &name2);

17382

17383

- if (!stmt)

17384

+ if (!stmt

17385

+ /* A simple post-dominance check - make sure the combination

17386

+ is executed under the same condition as the references. */

17387

+ || (gimple_bb (stmt) != gimple_bb (r1->stmt)

17388

+ && gimple_bb (stmt) != gimple_bb (r2->stmt)))

17389

return false;

17390

17391

acode = gimple_assign_rhs_code (stmt);

17392

@@ -2365,14 +2322,10 @@

17393

if (chain->inits[i] != NULL_TREE)

17394

continue;

17395

17396

- init = ref_at_iteration (loop, DR_REF (dr), (int) i - n);

17397

- if (!init)

17398

- return false;

17399

-

17400

+ init = ref_at_iteration (dr, (int) i - n, &stmts);

17401

if (!chain->all_always_accessed && tree_could_trap_p (init))

17402

return false;

17403

17404

- init = force_gimple_operand (init, &stmts, false, NULL_TREE);

17405

if (stmts)

17406

gsi_insert_seq_on_edge_immediate (entry, stmts);

17407

17408

Index: gcc/loop-iv.c

17409

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

17410

--- a/src/gcc/loop-iv.c (.../tags/gcc_4_8_2_release)

17411

+++ b/src/gcc/loop-iv.c (.../branches/gcc-4_8-branch)

17412

@@ -425,7 +425,9 @@

17413

&& !iv->first_special)

17414

{

17415

rtx val = get_iv_value (iv, const0_rtx);

17416

- val = lowpart_subreg (mode, val, iv->extend_mode);

17417

+ val = lowpart_subreg (mode, val,

17418

+ iv->extend == IV_UNKNOWN_EXTEND

17419

+ ? iv->mode : iv->extend_mode);

17420

17421

iv->base = val;

17422

iv->extend = IV_UNKNOWN_EXTEND;

17423

@@ -465,8 +467,14 @@

17424

&& !iv->first_special)

17425

{

17426

rtx val = get_iv_value (iv, const0_rtx);

17427

+ if (iv->extend_mode != iv->mode

17428

+ && iv->extend != IV_UNKNOWN_EXTEND

17429

+ && iv->extend != extend)

17430

+ val = lowpart_subreg (iv->mode, val, iv->extend_mode);

17431

val = simplify_gen_unary (iv_extend_to_rtx_code (extend), mode,

17432

- val, iv->extend_mode);

17433

+ val,

17434

+ iv->extend == extend

17435

+ ? iv->extend_mode : iv->mode);

17436

iv->base = val;

17437

iv->extend = IV_UNKNOWN_EXTEND;

17438

iv->mode = iv->extend_mode = mode;

17439

Index: gcc/ipa-prop.c

17440

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

17441

--- a/src/gcc/ipa-prop.c (.../tags/gcc_4_8_2_release)

17442

+++ b/src/gcc/ipa-prop.c (.../branches/gcc-4_8-branch)

17443

@@ -623,16 +623,22 @@

17444

if (parm_ainfo && parm_ainfo->parm_modified)

17445

return false;

17446

17447

- gcc_checking_assert (gimple_vuse (stmt) != NULL_TREE);

17448

- ao_ref_init (&refd, parm_load);

17449

- /* We can cache visited statements only when parm_ainfo is available and when

17450

- we are looking at a naked load of the whole parameter. */

17451

- if (!parm_ainfo || TREE_CODE (parm_load) != PARM_DECL)

17452

- visited_stmts = NULL;

17453

+ if (optimize)

17454

+ {

17455

+ gcc_checking_assert (gimple_vuse (stmt) != NULL_TREE);

17456

+ ao_ref_init (&refd, parm_load);

17457

+ /* We can cache visited statements only when parm_ainfo is available and

17458

+ when we are looking at a naked load of the whole parameter. */

17459

+ if (!parm_ainfo || TREE_CODE (parm_load) != PARM_DECL)

17460

+ visited_stmts = NULL;

17461

+ else

17462

+ visited_stmts = &parm_ainfo->parm_visited_statements;

17463

+ walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, &modified,

17464

+ visited_stmts);

17465

+ }

17466

else

17467

- visited_stmts = &parm_ainfo->parm_visited_statements;

17468

- walk_aliased_vdefs (&refd, gimple_vuse (stmt), mark_modified, &modified,

17469

- visited_stmts);

17470

+ modified = true;

17471

+

17472

if (parm_ainfo && modified)

17473

parm_ainfo->parm_modified = true;

17474

return !modified;

17475

@@ -740,7 +746,7 @@

17476

ipa_load_from_parm_agg_1 (vec<ipa_param_descriptor_t> descriptors,

17477

struct param_analysis_info *parms_ainfo, gimple stmt,

17478

tree op, int *index_p, HOST_WIDE_INT *offset_p,

17479

- bool *by_ref_p)

17480

+ HOST_WIDE_INT *size_p, bool *by_ref_p)

17481

{

17482

int index;

17483

HOST_WIDE_INT size, max_size;

17484

@@ -758,6 +764,8 @@

17485

{

17486

*index_p = index;

17487

*by_ref_p = false;

17488

+ if (size_p)

17489

+ *size_p = size;

17490

return true;

17491

}

17492

return false;

17493

@@ -800,6 +808,8 @@

17494

{

17495

*index_p = index;

17496

*by_ref_p = true;

17497

+ if (size_p)

17498

+ *size_p = size;

17499

return true;

17500

}

17501

return false;

17502

@@ -814,7 +824,7 @@

17503

bool *by_ref_p)

17504

{

17505

return ipa_load_from_parm_agg_1 (info->descriptors, NULL, stmt, op, index_p,

17506

- offset_p, by_ref_p);

17507

+ offset_p, NULL, by_ref_p);

17508

}

17509

17510

/* Given that an actual argument is an SSA_NAME (given in NAME) and is a result

17511

@@ -1462,6 +1472,9 @@

17512

{

17513

struct cgraph_edge *cs;

17514

17515

+ if (!optimize)

17516

+ return;

17517

+

17518

for (cs = node->callees; cs; cs = cs->next_callee)

17519

{

17520

struct cgraph_node *callee = cgraph_function_or_thunk_node (cs->callee,

17521

@@ -1646,7 +1659,7 @@

17522

if (gimple_assign_single_p (def)

17523

&& ipa_load_from_parm_agg_1 (info->descriptors, parms_ainfo, def,

17524

gimple_assign_rhs1 (def), &index, &offset,

17525

- &by_ref))

17526

+ NULL, &by_ref))

17527

{

17528

struct cgraph_edge *cs = ipa_note_param_call (node, index, call);

17529

cs->indirect_info->offset = offset;

17530

@@ -1847,8 +1860,7 @@

17531

passed in DATA. */

17532

17533

static bool

17534

-visit_ref_for_mod_analysis (gimple stmt ATTRIBUTE_UNUSED,

17535

- tree op, void *data)

17536

+visit_ref_for_mod_analysis (gimple, tree op, tree, void *data)

17537

{

17538

struct ipa_node_params *info = (struct ipa_node_params *) data;

17539

17540

@@ -2126,7 +2138,6 @@

17541

we may create the first reference to the object in the unit. */

17542

if (!callee || callee->global.inlined_to)

17543

{

17544

- struct cgraph_node *first_clone = callee;

17545

17546

/* We are better to ensure we can refer to it.

17547

In the case of static functions we are out of luck, since we already

17548

@@ -2142,31 +2153,7 @@

17549

xstrdup (cgraph_node_name (ie->callee)), ie->callee->uid);

17550

return NULL;

17551

}

17552

-

17553

- /* Create symbol table node. Even if inline clone exists, we can not take

17554

- it as a target of non-inlined call. */

17555

- callee = cgraph_create_node (target);

17556

-

17557

- /* OK, we previously inlined the function, then removed the offline copy and

17558

- now we want it back for external call. This can happen when devirtualizing

17559

- while inlining function called once that happens after extern inlined and

17560

- virtuals are already removed. In this case introduce the external node

17561

- and make it available for call. */

17562

- if (first_clone)

17563

- {

17564

- first_clone->clone_of = callee;

17565

- callee->clones = first_clone;

17566

- symtab_prevail_in_asm_name_hash ((symtab_node)callee);

17567

- symtab_insert_node_to_hashtable ((symtab_node)callee);

17568

- if (dump_file)

17569

- fprintf (dump_file, "ipa-prop: Introduced new external node "

17570

- "(%s/%i) and turned into root of the clone tree.\n",

17571

- xstrdup (cgraph_node_name (callee)), callee->uid);

17572

- }

17573

- else if (dump_file)

17574

- fprintf (dump_file, "ipa-prop: Introduced new external node "

17575

- "(%s/%i).\n",

17576

- xstrdup (cgraph_node_name (callee)), callee->uid);

17577

+ callee = cgraph_get_create_real_symbol_node (target);

17578

}

17579

ipa_check_create_node_params ();

17580

17581

@@ -3902,7 +3889,7 @@

17582

struct ipa_agg_replacement_value *v;

17583

gimple stmt = gsi_stmt (gsi);

17584

tree rhs, val, t;

17585

- HOST_WIDE_INT offset;

17586

+ HOST_WIDE_INT offset, size;

17587

int index;

17588

bool by_ref, vce;

17589

17590

@@ -3929,13 +3916,15 @@

17591

continue;

17592

17593

if (!ipa_load_from_parm_agg_1 (descriptors, parms_ainfo, stmt,

17594

- rhs, &index, &offset, &by_ref))

17595

+ rhs, &index, &offset, &size, &by_ref))

17596

continue;

17597

for (v = aggval; v; v = v->next)

17598

if (v->index == index

17599

&& v->offset == offset)

17600

break;

17601

- if (!v || v->by_ref != by_ref)

17602

+ if (!v

17603

+ || v->by_ref != by_ref

17604

+ || tree_low_cst (TYPE_SIZE (TREE_TYPE (v->value)), 0) != size)

17605

continue;

17606

17607

gcc_checking_assert (is_gimple_ip_invariant (v->value));

17608

Index: gcc/tree-ssa-dce.c

17609

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

17610

--- a/src/gcc/tree-ssa-dce.c (.../tags/gcc_4_8_2_release)

17611

+++ b/src/gcc/tree-ssa-dce.c (.../branches/gcc-4_8-branch)

17612

@@ -1307,26 +1307,19 @@

17613

stats.total++;

17614

17615

/* We can mark a call to free as not necessary if the

17616

- defining statement of its argument is an allocation

17617

- function and that is not necessary itself. */

17618

- if (gimple_call_builtin_p (stmt, BUILT_IN_FREE))

17619

+ defining statement of its argument is not necessary

17620

+ (and thus is getting removed). */

17621

+ if (gimple_plf (stmt, STMT_NECESSARY)

17622

+ && gimple_call_builtin_p (stmt, BUILT_IN_FREE))

17623

{

17624

tree ptr = gimple_call_arg (stmt, 0);

17625

- tree callee2;

17626

- gimple def_stmt;

17627

- if (TREE_CODE (ptr) != SSA_NAME)

17628

- continue;

17629

- def_stmt = SSA_NAME_DEF_STMT (ptr);

17630

- if (!is_gimple_call (def_stmt)

17631

- || gimple_plf (def_stmt, STMT_NECESSARY))

17632

- continue;

17633

- callee2 = gimple_call_fndecl (def_stmt);

17634

- if (callee2 == NULL_TREE

17635

- || DECL_BUILT_IN_CLASS (callee2) != BUILT_IN_NORMAL

17636

- || (DECL_FUNCTION_CODE (callee2) != BUILT_IN_MALLOC

17637

- && DECL_FUNCTION_CODE (callee2) != BUILT_IN_CALLOC))

17638

- continue;

17639

- gimple_set_plf (stmt, STMT_NECESSARY, false);

17640

+ if (TREE_CODE (ptr) == SSA_NAME)

17641

+ {

17642

+ gimple def_stmt = SSA_NAME_DEF_STMT (ptr);

17643

+ if (!gimple_nop_p (def_stmt)

17644

+ && !gimple_plf (def_stmt, STMT_NECESSARY))

17645

+ gimple_set_plf (stmt, STMT_NECESSARY, false);

17646

+ }

17647

}

17648

17649

/* If GSI is not necessary then remove it. */

17650

Index: gcc/tree-ssa-ter.c

17651

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

17652

--- a/src/gcc/tree-ssa-ter.c (.../tags/gcc_4_8_2_release)

17653

+++ b/src/gcc/tree-ssa-ter.c (.../branches/gcc-4_8-branch)

17654

@@ -590,6 +590,30 @@

17655

}

17656

17657

17658

+/* Helper function for find_ssaname_in_stores. Called via walk_tree to

17659

+ find a SSA_NAME DATA somewhere in *TP. */

17660

+

17661

+static tree

17662

+find_ssaname (tree *tp, int *walk_subtrees, void *data)

17663

+{

17664

+ tree var = (tree) data;

17665

+ if (*tp == var)

17666

+ return var;

17667

+ else if (IS_TYPE_OR_DECL_P (*tp))

17668

+ *walk_subtrees = 0;

17669

+ return NULL_TREE;

17670

+}

17671

+

17672

+/* Helper function for find_replaceable_in_bb. Return true if SSA_NAME DATA

17673

+ is used somewhere in T, which is a store in the statement. Called via

17674

+ walk_stmt_load_store_addr_ops. */

17675

+

17676

+static bool

17677

+find_ssaname_in_store (gimple, tree, tree t, void *data)

17678

+{

17679

+ return walk_tree (&t, find_ssaname, data, NULL) != NULL_TREE;

17680

+}

17681

+

17682

/* This function processes basic block BB, and looks for variables which can

17683

be replaced by their expressions. Results are stored in the table TAB. */

17684

17685

@@ -643,8 +667,7 @@

17686

/* If the stmt does a memory store and the replacement

17687

is a load aliasing it avoid creating overlapping

17688

assignments which we cannot expand correctly. */

17689

- if (gimple_vdef (stmt)

17690

- && gimple_assign_single_p (stmt))

17691

+ if (gimple_vdef (stmt))

17692

{

17693

gimple def_stmt = SSA_NAME_DEF_STMT (use);

17694

while (is_gimple_assign (def_stmt)

17695

@@ -653,9 +676,29 @@

17696

= SSA_NAME_DEF_STMT (gimple_assign_rhs1 (def_stmt));

17697

if (gimple_vuse (def_stmt)

17698

&& gimple_assign_single_p (def_stmt)

17699

- && refs_may_alias_p (gimple_assign_lhs (stmt),

17700

- gimple_assign_rhs1 (def_stmt)))

17701

- same_root_var = true;

17702

+ && stmt_may_clobber_ref_p (stmt,

17703

+ gimple_assign_rhs1 (def_stmt)))

17704

+ {

17705

+ /* For calls, it is not a problem if USE is among

17706

+ call's arguments or say OBJ_TYPE_REF argument,

17707

+ all those necessarily need to be evaluated before

17708

+ the call that may clobber the memory. But if

17709

+ LHS of the call refers to USE, expansion might

17710

+ evaluate it after the call, prevent TER in that

17711

+ case.

17712

+ For inline asm, allow TER of loads into input

17713

+ arguments, but disallow TER for USEs that occur

17714

+ somewhere in outputs. */

17715

+ if (is_gimple_call (stmt)

17716

+ || gimple_code (stmt) == GIMPLE_ASM)

17717

+ {

17718

+ if (walk_stmt_load_store_ops (stmt, use, NULL,

17719

+ find_ssaname_in_store))

17720

+ same_root_var = true;

17721

+ }

17722

+ else

17723

+ same_root_var = true;

17724

+ }

17725

}

17726

17727

/* Mark expression as replaceable unless stmt is volatile, or the

17728

Index: gcc/tree-vect-stmts.c

17729

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

17730

--- a/src/gcc/tree-vect-stmts.c (.../tags/gcc_4_8_2_release)

17731

+++ b/src/gcc/tree-vect-stmts.c (.../branches/gcc-4_8-branch)

17732

@@ -6054,8 +6054,7 @@

17733

corresponding to that mode. The theory is that any use that

17734

would cause problems with this will disable vectorization anyway. */

17735

else if (!SCALAR_FLOAT_TYPE_P (scalar_type)

17736

- && !INTEGRAL_TYPE_P (scalar_type)

17737

- && !POINTER_TYPE_P (scalar_type))

17738

+ && !INTEGRAL_TYPE_P (scalar_type))

17739

scalar_type = lang_hooks.types.type_for_mode (inner_mode, 1);

17740

17741

/* We can't build a vector type of elements with alignment bigger than

17742

Index: gcc/tree-object-size.c

17743

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

17744

--- a/src/gcc/tree-object-size.c (.../tags/gcc_4_8_2_release)

17745

+++ b/src/gcc/tree-object-size.c (.../branches/gcc-4_8-branch)

17746

@@ -64,7 +64,7 @@

17747

the subobject (innermost array or field with address taken).

17748

object_sizes[2] is lower bound for number of bytes till the end of

17749

the object and object_sizes[3] lower bound for subobject. */

17750

-static unsigned HOST_WIDE_INT *object_sizes[4];

17751

+static vec<unsigned HOST_WIDE_INT> object_sizes[4];

17752

17753

/* Bitmaps what object sizes have been computed already. */

17754

static bitmap computed[4];

17755

@@ -493,7 +493,7 @@

17756

17757

if (TREE_CODE (ptr) == SSA_NAME

17758

&& POINTER_TYPE_P (TREE_TYPE (ptr))

17759

- && object_sizes[object_size_type] != NULL)

17760

+ && computed[object_size_type] != NULL)

17761

{

17762

if (!bitmap_bit_p (computed[object_size_type], SSA_NAME_VERSION (ptr)))

17763

{

17764

@@ -501,6 +501,8 @@

17765

bitmap_iterator bi;

17766

unsigned int i;

17767

17768

+ if (num_ssa_names > object_sizes[object_size_type].length ())

17769

+ object_sizes[object_size_type].safe_grow (num_ssa_names);

17770

if (dump_file)

17771

{

17772

fprintf (dump_file, "Computing %s %sobject size for ",

17773

@@ -1162,12 +1164,12 @@

17774

{

17775

int object_size_type;

17776

17777

- if (object_sizes[0])

17778

+ if (computed[0])

17779

return;

17780

17781

for (object_size_type = 0; object_size_type <= 3; object_size_type++)

17782

{

17783

- object_sizes[object_size_type] = XNEWVEC (unsigned HOST_WIDE_INT, num_ssa_names);

17784

+ object_sizes[object_size_type].safe_grow (num_ssa_names);

17785

computed[object_size_type] = BITMAP_ALLOC (NULL);

17786

}

17787

17788

@@ -1184,9 +1186,8 @@

17789

17790

for (object_size_type = 0; object_size_type <= 3; object_size_type++)

17791

{

17792

- free (object_sizes[object_size_type]);

17793

+ object_sizes[object_size_type].release ();

17794

BITMAP_FREE (computed[object_size_type]);

17795

- object_sizes[object_size_type] = NULL;

17796

}

17797

}

17798

17799

@@ -1202,18 +1203,11 @@

17800

gimple_stmt_iterator i;

17801

for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))

17802

{

17803

- tree callee, result;

17804

+ tree result;

17805

gimple call = gsi_stmt (i);

17806

-

17807

- if (gimple_code (call) != GIMPLE_CALL)

17808

+ if (!gimple_call_builtin_p (call, BUILT_IN_OBJECT_SIZE))

17809

continue;

17810

17811

- callee = gimple_call_fndecl (call);

17812

- if (!callee

17813

- || DECL_BUILT_IN_CLASS (callee) != BUILT_IN_NORMAL

17814

- || DECL_FUNCTION_CODE (callee) != BUILT_IN_OBJECT_SIZE)

17815

- continue;

17816

-

17817

init_object_sizes ();

17818

result = fold_call_stmt (call, false);

17819

if (!result)

17820

@@ -1240,20 +1234,32 @@

17821

continue;

17822

}

17823

17824

+ gcc_assert (TREE_CODE (result) == INTEGER_CST);

17825

+

17826

if (dump_file && (dump_flags & TDF_DETAILS))

17827

{

17828

fprintf (dump_file, "Simplified\n ");

17829

print_gimple_stmt (dump_file, call, 0, dump_flags);

17830

+ fprintf (dump_file, " to ");

17831

+ print_generic_expr (dump_file, result, 0);

17832

+ fprintf (dump_file, "\n");

17833

}

17834

17835

- if (!update_call_from_tree (&i, result))

17836

- gcc_unreachable ();

17837

+ tree lhs = gimple_call_lhs (call);

17838

+ if (!lhs)

17839

+ continue;

17840

17841

- if (dump_file && (dump_flags & TDF_DETAILS))

17842

+ /* Propagate into all uses and fold those stmts. */

17843

+ gimple use_stmt;

17844

+ imm_use_iterator iter;

17845

+ FOR_EACH_IMM_USE_STMT (use_stmt, iter, lhs)

17846

{

17847

- fprintf (dump_file, "to\n ");

17848

- print_gimple_stmt (dump_file, gsi_stmt (i), 0, dump_flags);

17849

- fprintf (dump_file, "\n");

17850

+ use_operand_p use_p;

17851

+ FOR_EACH_IMM_USE_ON_STMT (use_p, iter)

17852

+ SET_USE (use_p, result);

17853

+ gimple_stmt_iterator gsi = gsi_for_stmt (use_stmt);

17854

+ fold_stmt (&gsi);

17855

+ update_stmt (gsi_stmt (gsi));

17856

}

17857

}

17858

}

17859

Index: gcc/combine.c

17860

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

17861

--- a/src/gcc/combine.c (.../tags/gcc_4_8_2_release)

17862

+++ b/src/gcc/combine.c (.../branches/gcc-4_8-branch)

17863

@@ -5798,8 +5798,15 @@

17864

return x;

17865

}

17866

17867

- /* If the code changed, return a whole new comparison. */

17868

- if (new_code != code)

17869

+ /* If the code changed, return a whole new comparison.

17870

+ We also need to avoid using SUBST in cases where

17871

+ simplify_comparison has widened a comparison with a CONST_INT,

17872

+ since in that case the wider CONST_INT may fail the sanity

17873

+ checks in do_SUBST. */

17874

+ if (new_code != code

17875

+ || (CONST_INT_P (op1)

17876

+ && GET_MODE (op0) != GET_MODE (XEXP (x, 0))

17877

+ && GET_MODE (op0) != GET_MODE (XEXP (x, 1))))

17878

return gen_rtx_fmt_ee (new_code, mode, op0, op1);

17879

17880

/* Otherwise, keep this operation, but maybe change its operands.

17881

@@ -7991,7 +7998,7 @@

17882

if (code == CALL || code == ASM_OPERANDS || code == CLOBBER)

17883

return x;

17884

17885

- /* We want to perform the operation is its present mode unless we know

17886

+ /* We want to perform the operation in its present mode unless we know

17887

that the operation is valid in MODE, in which case we do the operation

17888

in MODE. */

17889

op_mode = ((GET_MODE_CLASS (mode) == GET_MODE_CLASS (GET_MODE (x))

17890

@@ -8427,9 +8434,10 @@

17891

GET_MODE (x), GEN_INT (mask),

17892

XEXP (x, 1));

17893

if (temp && CONST_INT_P (temp))

17894

- SUBST (XEXP (x, 0),

17895

- force_to_mode (XEXP (x, 0), GET_MODE (x),

17896

- INTVAL (temp), next_select));

17897

+ x = simplify_gen_binary (code, GET_MODE (x),

17898

+ force_to_mode (XEXP (x, 0), GET_MODE (x),

17899

+ INTVAL (temp), next_select),

17900

+ XEXP (x, 1));

17901

}

17902

break;

17903

17904

@@ -8497,14 +8505,16 @@

17905

/* We have no way of knowing if the IF_THEN_ELSE can itself be

17906

written in a narrower mode. We play it safe and do not do so. */

17907

17908

- SUBST (XEXP (x, 1),

17909

- gen_lowpart_or_truncate (GET_MODE (x),

17910

- force_to_mode (XEXP (x, 1), mode,

17911

- mask, next_select)));

17912

- SUBST (XEXP (x, 2),

17913

- gen_lowpart_or_truncate (GET_MODE (x),

17914

- force_to_mode (XEXP (x, 2), mode,

17915

- mask, next_select)));

17916

+ op0 = gen_lowpart_or_truncate (GET_MODE (x),

17917

+ force_to_mode (XEXP (x, 1), mode,

17918

+ mask, next_select));

17919

+ op1 = gen_lowpart_or_truncate (GET_MODE (x),

17920

+ force_to_mode (XEXP (x, 2), mode,

17921

+ mask, next_select));

17922

+ if (op0 != XEXP (x, 1) || op1 != XEXP (x, 2))

17923

+ x = simplify_gen_ternary (IF_THEN_ELSE, GET_MODE (x),

17924

+ GET_MODE (XEXP (x, 0)), XEXP (x, 0),

17925

+ op0, op1);

17926

break;

17927

17928

default:

17929

Index: gcc/tree-flow.h

17930

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

17931

--- a/src/gcc/tree-flow.h (.../tags/gcc_4_8_2_release)

17932

+++ b/src/gcc/tree-flow.h (.../branches/gcc-4_8-branch)

17933

@@ -425,6 +425,7 @@

17934

basic_block, tree);

17935

void remove_edge_and_dominated_blocks (edge);

17936

bool tree_node_can_be_shared (tree);

17937

+extern unsigned int split_critical_edges (void);

17938

17939

/* In tree-cfgcleanup.c */

17940

extern bitmap cfgcleanup_altered_bbs;

17941

Index: gcc/config.gcc

17942

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

17943

--- a/src/gcc/config.gcc (.../tags/gcc_4_8_2_release)

17944

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

17945

@@ -1761,6 +1761,14 @@

17946

tmake_file="${tmake_file} microblaze/t-microblaze-linux"

17947

;;

17948

microblaze*-*-rtems*)

17949

+ case $target in

17950

+ microblazeel-*)

17951

+ tm_defines="${tm_defines} TARGET_BIG_ENDIAN_DEFAULT=0"

17952

+ ;;

17953

+ microblaze-*)

17954

+ tm_defines="${tm_defines} TARGET_BIG_ENDIAN_DEFAULT=4321"

17955

+ ;;

17956

+ esac

17957

tm_file="${tm_file} dbxelf.h"

17958

tm_file="${tm_file} microblaze/rtems.h rtems.h newlib-stdint.h"

17959

c_target_objs="${c_target_objs} microblaze-c.o"

17960

@@ -2963,11 +2971,18 @@

17961

with_cpu=8540

17962

fi

17963

;;

17964

- sparc-leon*-*)

17965

- with_cpu=v8;

17966

- ;;

17967

sparc*-*-*)

17968

- with_cpu="`echo ${target} | sed 's/-.*$//'`"

17969

+ case ${target} in

17970

+ *-leon-*)

17971

+ with_cpu=leon

17972

+ ;;

17973

+ *-leon[3-9]*)

17974

+ with_cpu=leon3

17975

+ ;;

17976

+ *)

17977

+ with_cpu="`echo ${target} | sed 's/-.*$//'`"

17978

+ ;;

17979

+ esac

17980

;;

17981

esac

17982

17983

@@ -3587,7 +3602,7 @@

17984

case ${val} in

17985

"" | sparc | sparcv9 | sparc64 \

17986

| v7 | cypress \

17987

- | v8 | supersparc | hypersparc | leon \

17988

17989

| sparclite | f930 | f934 | sparclite86x \

17990

| sparclet | tsc701 \

17991

17992

@@ -3745,15 +3760,6 @@

17993

cxx_target_objs="${cxx_target_objs} sh-c.o"

17994

;;

17995

17996

- sparc-leon*-*)

17997

- if test x$with_tune = x ; then

17998

- with_tune=leon;

17999

- fi

18000

-

18001

- # The SPARC port checks this value at compile-time.

18002

- target_cpu_default2="TARGET_CPU_$with_cpu"

18003

- ;;

18004

-

18005

sparc*-*-*)

18006

# Some standard aliases.

18007

case x$with_cpu in

18008

@@ -3765,6 +3771,17 @@

18009

;;

18010

esac

18011

18012

+ if test x$with_tune = x ; then

18013

+ case ${target} in

18014

+ *-leon-*)

18015

+ with_tune=leon

18016

+ ;;

18017

+ *-leon[3-9]*)

18018

+ with_tune=leon3

18019

+ ;;

18020

+ esac

18021

+ fi

18022

+

18023

# The SPARC port checks this value at compile-time.

18024

target_cpu_default2="TARGET_CPU_$with_cpu"

18025

;;

18026

Index: gcc/Makefile.in

18027

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

18028

--- a/src/gcc/Makefile.in (.../tags/gcc_4_8_2_release)

18029

+++ b/src/gcc/Makefile.in (.../branches/gcc-4_8-branch)

18030

@@ -3037,7 +3037,7 @@

18031

$(TM_H) coretypes.h $(GIMPLE_H) \

18032

$(TREE_PASS_H) $(FLAGS_H) $(EXPR_H) $(BASIC_BLOCK_H) \

18033

$(GGC_H) $(OBSTACK_H) $(PARAMS_H) $(CPPLIB_H) $(PARAMS_H) \

18034

- $(GIMPLE_PRETTY_PRINT_H) langhooks.h

18035

+ $(GIMPLE_PRETTY_PRINT_H) langhooks.h $(OPTABS_H)

18036

tree-complex.o : tree-complex.c $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TREE_H) \

18037

$(TM_H) $(FLAGS_H) $(TREE_FLOW_H) $(GIMPLE_H) \

18038

tree-iterator.h $(TREE_PASS_H) tree-ssa-propagate.h

18039

@@ -3276,12 +3276,12 @@

18040

$(TM_H) $(RTL_H) $(REGS_H) insn-config.h insn-codes.h $(DF_H) \

18041

$(RECOG_H) output.h addresses.h $(REGS_H) hard-reg-set.h $(FLAGS_H) \

18042

$(FUNCTION_H) $(EXPR_H) $(BASIC_BLOCK_H) $(TM_P_H) $(EXCEPT_H) \

18043

- ira.h rtl-error.h $(LRA_INT_H)

18044

+ ira.h rtl-error.h $(LRA_INT_H) $(OPTABS_H)

18045

lra-eliminations.o : lra-eliminations.c $(CONFIG_H) $(SYSTEM_H) coretypes.h \

18046

$(TM_H) $(RTL_H) $(REGS_H) insn-config.h $(DF_H) \

18047

$(RECOG_H) output.h $(REGS_H) hard-reg-set.h $(FLAGS_H) $(FUNCTION_H) \

18048

$(EXPR_H) $(BASIC_BLOCK_H) $(TM_P_H) $(EXCEPT_H) ira.h \

18049

- rtl-error.h $(LRA_INT_H)

18050

+ rtl-error.h $(LRA_INT_H) $(OPTABS_H)

18051

lra-lives.o : lra-lives.c $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TM_H) \

18052

$(RTL_H) $(REGS_H) insn-config.h $(DF_H) \

18053

$(RECOG_H) output.h $(REGS_H) hard-reg-set.h $(FLAGS_H) $(FUNCTION_H) \

18054

Index: gcc/gimple.c

18055

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

18056

--- a/src/gcc/gimple.c (.../tags/gcc_4_8_2_release)

18057

+++ b/src/gcc/gimple.c (.../branches/gcc-4_8-branch)

18058

@@ -3841,42 +3841,46 @@

18059

18060

/* For the statement STMT call the callbacks VISIT_LOAD, VISIT_STORE and

18061

VISIT_ADDR if non-NULL on loads, store and address-taken operands

18062

- passing the STMT, the base of the operand and DATA to it. The base

18063

- will be either a decl, an indirect reference (including TARGET_MEM_REF)

18064

- or the argument of an address expression.

18065

+ passing the STMT, the base of the operand, the operand itself containing

18066

+ the base and DATA to it. The base will be either a decl, an indirect

18067

+ reference (including TARGET_MEM_REF) or the argument of an address

18068

+ expression.

18069

Returns the results of these callbacks or'ed. */

18070

18071

bool

18072

walk_stmt_load_store_addr_ops (gimple stmt, void *data,

18073

- bool (*visit_load)(gimple, tree, void *),

18074

- bool (*visit_store)(gimple, tree, void *),

18075

- bool (*visit_addr)(gimple, tree, void *))

18076

+ walk_stmt_load_store_addr_fn visit_load,

18077

+ walk_stmt_load_store_addr_fn visit_store,

18078

+ walk_stmt_load_store_addr_fn visit_addr)

18079

{

18080

bool ret = false;

18081

unsigned i;

18082

if (gimple_assign_single_p (stmt))

18083

{

18084

- tree lhs, rhs;

18085

+ tree lhs, rhs, arg;

18086

if (visit_store)

18087

{

18088

- lhs = get_base_loadstore (gimple_assign_lhs (stmt));

18089

+ arg = gimple_assign_lhs (stmt);

18090

+ lhs = get_base_loadstore (arg);

18091

if (lhs)

18092

- ret |= visit_store (stmt, lhs, data);

18093

+ ret |= visit_store (stmt, lhs, arg, data);

18094

}

18095

- rhs = gimple_assign_rhs1 (stmt);

18096

+ arg = gimple_assign_rhs1 (stmt);

18097

+ rhs = arg;

18098

while (handled_component_p (rhs))

18099

rhs = TREE_OPERAND (rhs, 0);

18100

if (visit_addr)

18101

{

18102

if (TREE_CODE (rhs) == ADDR_EXPR)

18103

- ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);

18104

+ ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), arg, data);

18105

else if (TREE_CODE (rhs) == TARGET_MEM_REF

18106

&& TREE_CODE (TMR_BASE (rhs)) == ADDR_EXPR)

18107

- ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (rhs), 0), data);

18108

+ ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (rhs), 0), arg,

18109

+ data);

18110

else if (TREE_CODE (rhs) == OBJ_TYPE_REF

18111

&& TREE_CODE (OBJ_TYPE_REF_OBJECT (rhs)) == ADDR_EXPR)

18112

ret |= visit_addr (stmt, TREE_OPERAND (OBJ_TYPE_REF_OBJECT (rhs),

18113

- 0), data);

18114

+ 0), arg, data);

18115

else if (TREE_CODE (rhs) == CONSTRUCTOR)

18116

{

18117

unsigned int ix;

18118

@@ -3884,23 +3888,23 @@

18119

18120

FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (rhs), ix, val)

18121

if (TREE_CODE (val) == ADDR_EXPR)

18122

- ret |= visit_addr (stmt, TREE_OPERAND (val, 0), data);

18123

+ ret |= visit_addr (stmt, TREE_OPERAND (val, 0), arg, data);

18124

else if (TREE_CODE (val) == OBJ_TYPE_REF

18125

&& TREE_CODE (OBJ_TYPE_REF_OBJECT (val)) == ADDR_EXPR)

18126

ret |= visit_addr (stmt,

18127

TREE_OPERAND (OBJ_TYPE_REF_OBJECT (val),

18128

- 0), data);

18129

+ 0), arg, data);

18130

}

18131

lhs = gimple_assign_lhs (stmt);

18132

if (TREE_CODE (lhs) == TARGET_MEM_REF

18133

&& TREE_CODE (TMR_BASE (lhs)) == ADDR_EXPR)

18134

- ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (lhs), 0), data);

18135

+ ret |= visit_addr (stmt, TREE_OPERAND (TMR_BASE (lhs), 0), lhs, data);

18136

}

18137

if (visit_load)

18138

{

18139

rhs = get_base_loadstore (rhs);

18140

if (rhs)

18141

- ret |= visit_load (stmt, rhs, data);

18142

+ ret |= visit_load (stmt, rhs, arg, data);

18143

}

18144

}

18145

else if (visit_addr

18146

@@ -3913,17 +3917,17 @@

18147

if (op == NULL_TREE)

18148

;

18149

else if (TREE_CODE (op) == ADDR_EXPR)

18150

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18151

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18152

/* COND_EXPR and VCOND_EXPR rhs1 argument is a comparison

18153

tree with two operands. */

18154

else if (i == 1 && COMPARISON_CLASS_P (op))

18155

{

18156

if (TREE_CODE (TREE_OPERAND (op, 0)) == ADDR_EXPR)

18157

ret |= visit_addr (stmt, TREE_OPERAND (TREE_OPERAND (op, 0),

18158

- 0), data);

18159

+ 0), op, data);

18160

if (TREE_CODE (TREE_OPERAND (op, 1)) == ADDR_EXPR)

18161

ret |= visit_addr (stmt, TREE_OPERAND (TREE_OPERAND (op, 1),

18162

- 0), data);

18163

+ 0), op, data);

18164

}

18165

}

18166

}

18167

@@ -3931,38 +3935,39 @@

18168

{

18169

if (visit_store)

18170

{

18171

- tree lhs = gimple_call_lhs (stmt);

18172

- if (lhs)

18173

+ tree arg = gimple_call_lhs (stmt);

18174

+ if (arg)

18175

{

18176

- lhs = get_base_loadstore (lhs);

18177

+ tree lhs = get_base_loadstore (arg);

18178

if (lhs)

18179

- ret |= visit_store (stmt, lhs, data);

18180

+ ret |= visit_store (stmt, lhs, arg, data);

18181

}

18182

}

18183

if (visit_load || visit_addr)

18184

for (i = 0; i < gimple_call_num_args (stmt); ++i)

18185

{

18186

- tree rhs = gimple_call_arg (stmt, i);

18187

+ tree arg = gimple_call_arg (stmt, i);

18188

if (visit_addr

18189

- && TREE_CODE (rhs) == ADDR_EXPR)

18190

- ret |= visit_addr (stmt, TREE_OPERAND (rhs, 0), data);

18191

+ && TREE_CODE (arg) == ADDR_EXPR)

18192

+ ret |= visit_addr (stmt, TREE_OPERAND (arg, 0), arg, data);

18193

else if (visit_load)

18194

{

18195

- rhs = get_base_loadstore (rhs);

18196

+ tree rhs = get_base_loadstore (arg);

18197

if (rhs)

18198

- ret |= visit_load (stmt, rhs, data);

18199

+ ret |= visit_load (stmt, rhs, arg, data);

18200

}

18201

}

18202

if (visit_addr

18203

&& gimple_call_chain (stmt)

18204

&& TREE_CODE (gimple_call_chain (stmt)) == ADDR_EXPR)

18205

ret |= visit_addr (stmt, TREE_OPERAND (gimple_call_chain (stmt), 0),

18206

- data);

18207

+ gimple_call_chain (stmt), data);

18208

if (visit_addr

18209

&& gimple_call_return_slot_opt_p (stmt)

18210

&& gimple_call_lhs (stmt) != NULL_TREE

18211

&& TREE_ADDRESSABLE (TREE_TYPE (gimple_call_lhs (stmt))))

18212

- ret |= visit_addr (stmt, gimple_call_lhs (stmt), data);

18213

+ ret |= visit_addr (stmt, gimple_call_lhs (stmt),

18214

+ gimple_call_lhs (stmt), data);

18215

}

18216

else if (gimple_code (stmt) == GIMPLE_ASM)

18217

{

18218

@@ -3978,7 +3983,7 @@

18219

tree link = gimple_asm_output_op (stmt, i);

18220

tree op = get_base_loadstore (TREE_VALUE (link));

18221

if (op && visit_store)

18222

- ret |= visit_store (stmt, op, data);

18223

+ ret |= visit_store (stmt, op, TREE_VALUE (link), data);

18224

if (visit_addr)

18225

{

18226

constraint = TREE_STRING_POINTER

18227

@@ -3987,7 +3992,7 @@

18228

parse_output_constraint (&constraint, i, 0, 0, &allows_mem,

18229

&allows_reg, &is_inout);

18230

if (op && !allows_reg && allows_mem)

18231

- ret |= visit_addr (stmt, op, data);

18232

+ ret |= visit_addr (stmt, op, TREE_VALUE (link), data);

18233

}

18234

}

18235

if (visit_load || visit_addr)

18236

@@ -3997,14 +4002,14 @@

18237

tree op = TREE_VALUE (link);

18238

if (visit_addr

18239

&& TREE_CODE (op) == ADDR_EXPR)

18240

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18241

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18242

else if (visit_load || visit_addr)

18243

{

18244

op = get_base_loadstore (op);

18245

if (op)

18246

{

18247

if (visit_load)

18248

- ret |= visit_load (stmt, op, data);

18249

+ ret |= visit_load (stmt, op, TREE_VALUE (link), data);

18250

if (visit_addr)

18251

{

18252

constraint = TREE_STRING_POINTER

18253

@@ -4013,7 +4018,8 @@

18254

0, oconstraints,

18255

&allows_mem, &allows_reg);

18256

if (!allows_reg && allows_mem)

18257

- ret |= visit_addr (stmt, op, data);

18258

+ ret |= visit_addr (stmt, op, TREE_VALUE (link),

18259

+ data);

18260

}

18261

}

18262

}

18263

@@ -4026,12 +4032,12 @@

18264

{

18265

if (visit_addr

18266

&& TREE_CODE (op) == ADDR_EXPR)

18267

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18268

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18269

else if (visit_load)

18270

{

18271

- op = get_base_loadstore (op);

18272

- if (op)

18273

- ret |= visit_load (stmt, op, data);

18274

+ tree base = get_base_loadstore (op);

18275

+ if (base)

18276

+ ret |= visit_load (stmt, base, op, data);

18277

}

18278

}

18279

}

18280

@@ -4042,7 +4048,7 @@

18281

{

18282

tree op = PHI_ARG_DEF (stmt, i);

18283

if (TREE_CODE (op) == ADDR_EXPR)

18284

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18285

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18286

}

18287

}

18288

else if (visit_addr

18289

@@ -4050,7 +4056,7 @@

18290

{

18291

tree op = gimple_goto_dest (stmt);

18292

if (TREE_CODE (op) == ADDR_EXPR)

18293

- ret |= visit_addr (stmt, TREE_OPERAND (op, 0), data);

18294

+ ret |= visit_addr (stmt, TREE_OPERAND (op, 0), op, data);

18295

}

18296

18297

return ret;

18298

@@ -4061,8 +4067,8 @@

18299

18300

bool

18301

walk_stmt_load_store_ops (gimple stmt, void *data,

18302

- bool (*visit_load)(gimple, tree, void *),

18303

- bool (*visit_store)(gimple, tree, void *))

18304

+ walk_stmt_load_store_addr_fn visit_load,

18305

+ walk_stmt_load_store_addr_fn visit_store)

18306

{

18307

return walk_stmt_load_store_addr_ops (stmt, data,

18308

visit_load, visit_store, NULL);

18309

@@ -4071,8 +4077,7 @@

18310

/* Helper for gimple_ior_addresses_taken_1. */

18311

18312

static bool

18313

-gimple_ior_addresses_taken_1 (gimple stmt ATTRIBUTE_UNUSED,

18314

- tree addr, void *data)

18315

+gimple_ior_addresses_taken_1 (gimple, tree addr, tree, void *data)

18316

{

18317

bitmap addresses_taken = (bitmap)data;

18318

addr = get_base_address (addr);

18319

Index: gcc/gimple.h

18320

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

18321

--- a/src/gcc/gimple.h (.../tags/gcc_4_8_2_release)

18322

+++ b/src/gcc/gimple.h (.../branches/gcc-4_8-branch)

18323

@@ -888,13 +888,14 @@

18324

extern alias_set_type gimple_get_alias_set (tree);

18325

extern void count_uses_and_derefs (tree, gimple, unsigned *, unsigned *,

18326

unsigned *);

18327

+typedef bool (*walk_stmt_load_store_addr_fn) (gimple, tree, tree, void *);

18328

extern bool walk_stmt_load_store_addr_ops (gimple, void *,

18329

- bool (*)(gimple, tree, void *),

18330

- bool (*)(gimple, tree, void *),

18331

- bool (*)(gimple, tree, void *));

18332

+ walk_stmt_load_store_addr_fn,

18333

+ walk_stmt_load_store_addr_fn,

18334

+ walk_stmt_load_store_addr_fn);

18335

extern bool walk_stmt_load_store_ops (gimple, void *,

18336

- bool (*)(gimple, tree, void *),

18337

- bool (*)(gimple, tree, void *));

18338

+ walk_stmt_load_store_addr_fn,

18339

+ walk_stmt_load_store_addr_fn);

18340

extern bool gimple_ior_addresses_taken (bitmap, gimple);

18341

extern bool gimple_call_builtin_p (gimple, enum built_in_class);

18342

extern bool gimple_call_builtin_p (gimple, enum built_in_function);

18343

Index: gcc/tree-cfg.c

18344

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

18345

--- a/src/gcc/tree-cfg.c (.../tags/gcc_4_8_2_release)

18346

+++ b/src/gcc/tree-cfg.c (.../branches/gcc-4_8-branch)

18347

@@ -104,7 +104,6 @@

18348

static void assign_discriminator (location_t, basic_block);

18349

static edge gimple_redirect_edge_and_branch (edge, basic_block);

18350

static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);

18351

-static unsigned int split_critical_edges (void);

18352

18353

/* Various helpers. */

18354

static inline bool stmt_starts_bb_p (gimple, gimple);

18355

@@ -3513,11 +3512,10 @@

18356

case PLUS_EXPR:

18357

case MINUS_EXPR:

18358

{

18359

- /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.

18360

- ??? This just makes the checker happy and may not be what is

18361

- intended. */

18362

- if (TREE_CODE (lhs_type) == VECTOR_TYPE

18363

- && POINTER_TYPE_P (TREE_TYPE (lhs_type)))

18364

+ tree lhs_etype = lhs_type;

18365

+ tree rhs1_etype = rhs1_type;

18366

+ tree rhs2_etype = rhs2_type;

18367

+ if (TREE_CODE (lhs_type) == VECTOR_TYPE)

18368

{

18369

if (TREE_CODE (rhs1_type) != VECTOR_TYPE

18370

|| TREE_CODE (rhs2_type) != VECTOR_TYPE)

18371

@@ -3525,22 +3523,13 @@

18372

error ("invalid non-vector operands to vector valued plus");

18373

return true;

18374

}

18375

- lhs_type = TREE_TYPE (lhs_type);

18376

- rhs1_type = TREE_TYPE (rhs1_type);

18377

- rhs2_type = TREE_TYPE (rhs2_type);

18378

- /* PLUS_EXPR is commutative, so we might end up canonicalizing

18379

- the pointer to 2nd place. */

18380

- if (POINTER_TYPE_P (rhs2_type))

18381

- {

18382

- tree tem = rhs1_type;

18383

- rhs1_type = rhs2_type;

18384

- rhs2_type = tem;

18385

- }

18386

- goto do_pointer_plus_expr_check;

18387

+ lhs_etype = TREE_TYPE (lhs_type);

18388

+ rhs1_etype = TREE_TYPE (rhs1_type);

18389

+ rhs2_etype = TREE_TYPE (rhs2_type);

18390

}

18391

- if (POINTER_TYPE_P (lhs_type)

18392

- || POINTER_TYPE_P (rhs1_type)

18393

- || POINTER_TYPE_P (rhs2_type))

18394

+ if (POINTER_TYPE_P (lhs_etype)

18395

+ || POINTER_TYPE_P (rhs1_etype)

18396

+ || POINTER_TYPE_P (rhs2_etype))

18397

{

18398

error ("invalid (pointer) operands to plus/minus");

18399

return true;

18400

@@ -3552,7 +3541,6 @@

18401

18402

case POINTER_PLUS_EXPR:

18403

{

18404

-do_pointer_plus_expr_check:

18405

if (!POINTER_TYPE_P (rhs1_type)

18406

|| !useless_type_conversion_p (lhs_type, rhs1_type)

18407

|| !ptrofftype_p (rhs2_type))

18408

@@ -7658,7 +7646,7 @@

18409

18410

/* Split all critical edges. */

18411

18412

-static unsigned int

18413

+unsigned int

18414

split_critical_edges (void)

18415

{

18416

basic_block bb;

18417

Index: gcc/passes.c

18418

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

18419

--- a/src/gcc/passes.c (.../tags/gcc_4_8_2_release)

18420

+++ b/src/gcc/passes.c (.../branches/gcc-4_8-branch)

18421

@@ -1398,6 +1398,7 @@

18422

/* After CCP we rewrite no longer addressed locals into SSA

18423

form if possible. */

18424

NEXT_PASS (pass_forwprop);

18425

+ NEXT_PASS (pass_object_sizes);

18426

/* pass_build_alias is a dummy pass that ensures that we

18427

execute TODO_rebuild_alias at this point. */

18428

NEXT_PASS (pass_build_alias);

18429

@@ -1435,7 +1436,6 @@

18430

NEXT_PASS (pass_dce);

18431

NEXT_PASS (pass_forwprop);

18432

NEXT_PASS (pass_phiopt);

18433

- NEXT_PASS (pass_object_sizes);

18434

NEXT_PASS (pass_strlen);

18435

NEXT_PASS (pass_ccp);

18436

/* After CCP we rewrite no longer addressed locals into SSA

18437

Index: gcc/tree-ssa-reassoc.c

18438

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

18439

--- a/src/gcc/tree-ssa-reassoc.c (.../tags/gcc_4_8_2_release)

18440

+++ b/src/gcc/tree-ssa-reassoc.c (.../branches/gcc-4_8-branch)

18441

@@ -1980,8 +1980,15 @@

18442

18443

tem = fold_convert_loc (loc, optype, tem);

18444

gsi = gsi_for_stmt (stmt);

18445

- tem = force_gimple_operand_gsi (&gsi, tem, true, NULL_TREE, true,

18446

- GSI_SAME_STMT);

18447

+ /* In rare cases range->exp can be equal to lhs of stmt.

18448

+ In that case we have to insert after the stmt rather then before

18449

+ it. */

18450

+ if (op == range->exp)

18451

+ tem = force_gimple_operand_gsi (&gsi, tem, true, NULL_TREE, false,

18452

+ GSI_SAME_STMT);

18453

+ else

18454

+ tem = force_gimple_operand_gsi (&gsi, tem, true, NULL_TREE, true,

18455

+ GSI_SAME_STMT);

18456

18457

/* If doing inter-bb range test optimization, update the

18458

stmts immediately. Start with changing the first range test

18459

Index: gcc/config/s390/s390.c

18460

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

18461

--- a/src/gcc/config/s390/s390.c (.../tags/gcc_4_8_2_release)

18462

+++ b/src/gcc/config/s390/s390.c (.../branches/gcc-4_8-branch)

18463

@@ -407,6 +407,65 @@

18464

bytes on a z10 (or higher) CPU. */

18465

#define PREDICT_DISTANCE (TARGET_Z10 ? 384 : 2048)

18466

18467

+static const int s390_hotpatch_trampoline_halfwords_default = 12;

18468

+static const int s390_hotpatch_trampoline_halfwords_max = 1000000;

18469

+static int s390_hotpatch_trampoline_halfwords = -1;

18470

+

18471

+/* Return the argument of the given hotpatch attribute or the default value if

18472

+ no argument is present. */

18473

+

18474

+static inline int

18475

+get_hotpatch_attribute (tree hotpatch_attr)

18476

+{

18477

+ const_tree args;

18478

+

18479

+ args = TREE_VALUE (hotpatch_attr);

18480

+

18481

+ return (args) ?

18482

+ TREE_INT_CST_LOW (TREE_VALUE (args)):

18483

+ s390_hotpatch_trampoline_halfwords_default;

18484

+}

18485

+

18486

+/* Check whether the hotpatch attribute is applied to a function and, if it has

18487

+ an argument, the argument is valid. */

18488

+

18489

+static tree

18490

+s390_handle_hotpatch_attribute (tree *node, tree name, tree args,

18491

+ int flags ATTRIBUTE_UNUSED, bool *no_add_attrs)

18492

+{

18493

+ if (TREE_CODE (*node) != FUNCTION_DECL)

18494

+ {

18495

+ warning (OPT_Wattributes, "%qE attribute only applies to functions",

18496

+ name);

18497

+ *no_add_attrs = true;

18498

+ }

18499

+ else if (args)

18500

+ {

18501

+ tree expr = TREE_VALUE (args);

18502

+

18503

+ if (TREE_CODE (expr) != INTEGER_CST

18504

+ || !INTEGRAL_TYPE_P (TREE_TYPE (expr))

18505

+ || TREE_INT_CST_HIGH (expr) != 0

18506

+ || TREE_INT_CST_LOW (expr) > (unsigned int)

18507

+ s390_hotpatch_trampoline_halfwords_max)

18508

+ {

18509

+ error ("requested %qE attribute is not a non-negative integer"

18510

+ " constant or too large (max. %d)", name,

18511

+ s390_hotpatch_trampoline_halfwords_max);

18512

+ *no_add_attrs = true;

18513

+ }

18514

+ }

18515

+

18516

+ return NULL_TREE;

18517

+}

18518

+

18519

+static const struct attribute_spec s390_attribute_table[] = {

18520

+ { "hotpatch", 0, 1, true, false, false, s390_handle_hotpatch_attribute, false

18521

+ },

18522

+ /* End element. */

18523

+ { NULL, 0, 0, false, false, false, NULL, false }

18524

+};

18525

+

18526

/* Return the alignment for LABEL. We default to the -falign-labels

18527

value except for the literal pool base label. */

18528

int

18529

@@ -883,7 +942,8 @@

18530

{

18531

/* For CCRAWmode put the required cc mask into the second

18532

operand. */

18533

- if (GET_MODE (XVECEXP (*op0, 0, 0)) == CCRAWmode)

18534

+ if (GET_MODE (XVECEXP (*op0, 0, 0)) == CCRAWmode

18535

+ && INTVAL (*op1) >= 0 && INTVAL (*op1) <= 3)

18536

*op1 = gen_rtx_CONST_INT (VOIDmode, 1 << (3 - INTVAL (*op1)));

18537

*op0 = XVECEXP (*op0, 0, 0);

18538

*code = new_code;

18539

@@ -1594,6 +1654,46 @@

18540

static void

18541

s390_option_override (void)

18542

{

18543

+ unsigned int i;

18544

+ cl_deferred_option *opt;

18545

+ vec<cl_deferred_option> *v =

18546

+ (vec<cl_deferred_option> *) s390_deferred_options;

18547

+

18548

+ if (v)

18549

+ FOR_EACH_VEC_ELT (*v, i, opt)

18550

+ {

18551

+ switch (opt->opt_index)

18552

+ {

18553

+ case OPT_mhotpatch:

18554

+ s390_hotpatch_trampoline_halfwords = (opt->value) ?

18555

+ s390_hotpatch_trampoline_halfwords_default : -1;

18556

+ break;

18557

+ case OPT_mhotpatch_:

18558

+ {

18559

+ int val;

18560

+

18561

+ val = integral_argument (opt->arg);

18562

+ if (val == -1)

18563

+ {

18564

+ /* argument is not a plain number */

18565

+ error ("argument to %qs should be a non-negative integer",

18566

+ "-mhotpatch=");

18567

+ break;

18568

+ }

18569

+ else if (val > s390_hotpatch_trampoline_halfwords_max)

18570

+ {

18571

+ error ("argument to %qs is too large (max. %d)",

18572

+ "-mhotpatch=", s390_hotpatch_trampoline_halfwords_max);

18573

+ break;

18574

+ }

18575

+ s390_hotpatch_trampoline_halfwords = val;

18576

+ break;

18577

+ }

18578

+ default:

18579

+ gcc_unreachable ();

18580

+ }

18581

+ }

18582

+

18583

/* Set up function hooks. */

18584

init_machine_status = s390_init_machine_status;

18585

18586

@@ -5311,6 +5411,102 @@

18587

gcc_unreachable ();

18588

}

18589

18590

+/* Returns -1 if the function should not be made hotpatchable. Otherwise it

18591

+ returns a number >= 0 that is the desired size of the hotpatch trampoline

18592

+ in halfwords. */

18593

+

18594

+static int s390_function_num_hotpatch_trampoline_halfwords (tree decl,

18595

+ bool do_warn)

18596

+{

18597

+ tree attr;

18598

+

18599

+ if (DECL_DECLARED_INLINE_P (decl)

18600

+ || DECL_ARTIFICIAL (decl)

18601

+ || MAIN_NAME_P (DECL_NAME (decl)))

18602

+ {

18603

+ /* - Explicitly inlined functions cannot be hotpatched.

18604

+ - Artificial functions need not be hotpatched.

18605

+ - Making the main function hotpatchable is useless. */

18606

+ return -1;

18607

+ }

18608

+ attr = lookup_attribute ("hotpatch", DECL_ATTRIBUTES (decl));

18609

+ if (attr || s390_hotpatch_trampoline_halfwords >= 0)

18610

+ {

18611

+ if (lookup_attribute ("always_inline", DECL_ATTRIBUTES (decl)))

18612

+ {

18613

+ if (do_warn)

18614

+ warning (OPT_Wattributes, "function %qE with the %qs attribute"

18615

+ " is not hotpatchable", DECL_NAME (decl), "always_inline");

18616

+ return -1;

18617

+ }

18618

+ else

18619

+ {

18620

+ return (attr) ?

18621

+ get_hotpatch_attribute (attr) : s390_hotpatch_trampoline_halfwords;

18622

+ }

18623

+ }

18624

+

18625

+ return -1;

18626

+}

18627

+

18628

+/* Hook to determine if one function can safely inline another. */

18629

+

18630

+static bool

18631

+s390_can_inline_p (tree caller, tree callee)

18632

+{

18633

+ if (s390_function_num_hotpatch_trampoline_halfwords (callee, false) >= 0)

18634

+ return false;

18635

+

18636

+ return default_target_can_inline_p (caller, callee);

18637

+}

18638

+

18639

+/* Write the extra assembler code needed to declare a function properly. */

18640

+

18641

+void

18642

+s390_asm_output_function_label (FILE *asm_out_file, const char *fname,

18643

+ tree decl)

18644

+{

18645

+ int hotpatch_trampoline_halfwords = -1;

18646

+

18647

+ if (decl)

18648

+ {

18649

+ hotpatch_trampoline_halfwords =

18650

+ s390_function_num_hotpatch_trampoline_halfwords (decl, true);

18651

+ if (hotpatch_trampoline_halfwords >= 0

18652

+ && decl_function_context (decl) != NULL_TREE)

18653

+ {

18654

+ warning_at (0, DECL_SOURCE_LOCATION (decl),

18655

+ "hotpatch_prologue is not compatible with nested"

18656

+ " function");

18657

+ hotpatch_trampoline_halfwords = -1;

18658

+ }

18659

+ }

18660

+

18661

+ if (hotpatch_trampoline_halfwords > 0)

18662

+ {

18663

+ int i;

18664

+

18665

+ /* Add a trampoline code area before the function label and initialize it

18666

+ with two-byte nop instructions. This area can be overwritten with code

18667

+ that jumps to a patched version of the function. */

18668

+ for (i = 0; i < hotpatch_trampoline_halfwords; i++)

18669

+ asm_fprintf (asm_out_file, "\tnopr\t%%r7\n");

18670

+ /* Note: The function label must be aligned so that (a) the bytes of the

18671

+ following nop do not cross a cacheline boundary, and (b) a jump address

18672

+ (eight bytes for 64 bit targets, 4 bytes for 32 bit targets) can be

18673

+ stored directly before the label without crossing a cacheline

18674

+ boundary. All this is necessary to make sure the trampoline code can

18675

+ be changed atomically. */

18676

+ }

18677

+

18678

+ ASM_OUTPUT_LABEL (asm_out_file, fname);

18679

+

18680

+ /* Output a four-byte nop if hotpatching is enabled. This can be overwritten

18681

+ atomically with a relative backwards jump to the trampoline area. */

18682

+ if (hotpatch_trampoline_halfwords >= 0)

18683

+ asm_fprintf (asm_out_file, "\tnop\t0\n");

18684

+}

18685

+

18686

/* Output machine-dependent UNSPECs occurring in address constant X

18687

in assembler syntax to stdio stream FILE. Returns true if the

18688

constant X could be recognized, false otherwise. */

18689

@@ -7846,6 +8042,9 @@

18690

{

18691

bb = BASIC_BLOCK (bb_index);

18692

18693

+ if (!bb)

18694

+ continue;

18695

+

18696

FOR_BB_INSNS (bb, insn)

18697

{

18698

rtx ite, cc, pat, target;

18699

@@ -7959,7 +8158,10 @@

18700

if (!result)

18701

return;

18702

18703

- PATTERN (tbegin_insn) = XVECEXP (PATTERN (tbegin_insn), 0, 0);

18704

+ PATTERN (tbegin_insn) = gen_rtx_PARALLEL (VOIDmode,

18705

+ gen_rtvec (2,

18706

+ XVECEXP (PATTERN (tbegin_insn), 0, 0),

18707

+ XVECEXP (PATTERN (tbegin_insn), 0, 1)));

18708

INSN_CODE (tbegin_insn) = -1;

18709

df_insn_rescan (tbegin_insn);

18710

18711

@@ -9573,6 +9775,7 @@

18712

const int CC3 = 1 << 0;

18713

rtx abort_label = gen_label_rtx ();

18714

rtx leave_label = gen_label_rtx ();

18715

+ rtx retry_plus_two = gen_reg_rtx (SImode);

18716

rtx retry_reg = gen_reg_rtx (SImode);

18717

rtx retry_label = NULL_RTX;

18718

rtx jump;

18719

@@ -9581,16 +9784,17 @@

18720

if (retry != NULL_RTX)

18721

{

18722

emit_move_insn (retry_reg, retry);

18723

+ emit_insn (gen_addsi3 (retry_plus_two, retry_reg, const2_rtx));

18724

+ emit_insn (gen_addsi3 (retry_reg, retry_reg, const1_rtx));

18725

retry_label = gen_label_rtx ();

18726

emit_label (retry_label);

18727

}

18728

18729

if (clobber_fprs_p)

18730

- emit_insn (gen_tbegin_1 (tdb,

18731

- gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK)));

18732

+ emit_insn (gen_tbegin_1 (gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK), tdb));

18733

else

18734

- emit_insn (gen_tbegin_nofloat_1 (tdb,

18735

- gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK)));

18736

+ emit_insn (gen_tbegin_nofloat_1 (gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK),

18737

+ tdb));

18738

18739

jump = s390_emit_jump (abort_label,

18740

gen_rtx_NE (VOIDmode,

18741

@@ -9611,6 +9815,10 @@

18742

/* Abort handler code. */

18743

18744

emit_label (abort_label);

18745

+ emit_move_insn (dest, gen_rtx_UNSPEC (SImode,

18746

+ gen_rtvec (1, gen_rtx_REG (CCRAWmode,

18747

+ CC_REGNUM)),

18748

+ UNSPEC_CC_TO_INT));

18749

if (retry != NULL_RTX)

18750

{

18751

rtx count = gen_reg_rtx (SImode);

18752

@@ -9622,7 +9830,7 @@

18753

add_reg_note (jump, REG_BR_PROB, very_unlikely);

18754

18755

/* CC2 - transient failure. Perform retry with ppa. */

18756

- emit_move_insn (count, retry);

18757

+ emit_move_insn (count, retry_plus_two);

18758

emit_insn (gen_subsi3 (count, count, retry_reg));

18759

emit_insn (gen_tx_assist (count));

18760

jump = emit_jump_insn (gen_doloop_si64 (retry_label,

18761

@@ -9632,10 +9840,6 @@

18762

LABEL_NUSES (retry_label) = 1;

18763

}

18764

18765

- emit_move_insn (dest, gen_rtx_UNSPEC (SImode,

18766

- gen_rtvec (1, gen_rtx_REG (CCRAWmode,

18767

- CC_REGNUM)),

18768

- UNSPEC_CC_TO_INT));

18769

emit_label (leave_label);

18770

}

18771

18772

@@ -9674,6 +9878,9 @@

18773

s390_init_builtins (void)

18774

{

18775

tree ftype, uint64_type;

18776

+ tree returns_twice_attr = tree_cons (get_identifier ("returns_twice"),

18777

+ NULL, NULL);

18778

+ tree noreturn_attr = tree_cons (get_identifier ("noreturn"), NULL, NULL);

18779

18780

/* void foo (void) */

18781

ftype = build_function_type_list (void_type_node, NULL_TREE);

18782

@@ -9684,17 +9891,17 @@

18783

ftype = build_function_type_list (void_type_node, integer_type_node,

18784

NULL_TREE);

18785

add_builtin_function ("__builtin_tabort", ftype,

18786

- S390_BUILTIN_TABORT, BUILT_IN_MD, NULL, NULL_TREE);

18787

+ S390_BUILTIN_TABORT, BUILT_IN_MD, NULL, noreturn_attr);

18788

add_builtin_function ("__builtin_tx_assist", ftype,

18789

S390_BUILTIN_TX_ASSIST, BUILT_IN_MD, NULL, NULL_TREE);

18790

18791

/* int foo (void *) */

18792

ftype = build_function_type_list (integer_type_node, ptr_type_node, NULL_TREE);

18793

add_builtin_function ("__builtin_tbegin", ftype, S390_BUILTIN_TBEGIN,

18794

- BUILT_IN_MD, NULL, NULL_TREE);

18795

+ BUILT_IN_MD, NULL, returns_twice_attr);

18796

add_builtin_function ("__builtin_tbegin_nofloat", ftype,

18797

S390_BUILTIN_TBEGIN_NOFLOAT,

18798

- BUILT_IN_MD, NULL, NULL_TREE);

18799

+ BUILT_IN_MD, NULL, returns_twice_attr);

18800

18801

/* int foo (void *, int) */

18802

ftype = build_function_type_list (integer_type_node, ptr_type_node,

18803

@@ -9702,11 +9909,11 @@

18804

add_builtin_function ("__builtin_tbegin_retry", ftype,

18805

S390_BUILTIN_TBEGIN_RETRY,

18806

BUILT_IN_MD,

18807

- NULL, NULL_TREE);

18808

+ NULL, returns_twice_attr);

18809

add_builtin_function ("__builtin_tbegin_retry_nofloat", ftype,

18810

S390_BUILTIN_TBEGIN_RETRY_NOFLOAT,

18811

BUILT_IN_MD,

18812

- NULL, NULL_TREE);

18813

+ NULL, returns_twice_attr);

18814

18815

/* int foo (void) */

18816

ftype = build_function_type_list (integer_type_node, NULL_TREE);

18817

@@ -11622,6 +11829,12 @@

18818

#undef TARGET_CANONICALIZE_COMPARISON

18819

#define TARGET_CANONICALIZE_COMPARISON s390_canonicalize_comparison

18820

18821

+#undef TARGET_ATTRIBUTE_TABLE

18822

+#define TARGET_ATTRIBUTE_TABLE s390_attribute_table

18823

+

18824

+#undef TARGET_CAN_INLINE_P

18825

+#define TARGET_CAN_INLINE_P s390_can_inline_p

18826

+

18827

struct gcc_target targetm = TARGET_INITIALIZER;

18828

18829

#include "gt-s390.h"

18830

Index: gcc/config/s390/s390.h

18831

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

18832

--- a/src/gcc/config/s390/s390.h (.../tags/gcc_4_8_2_release)

18833

+++ b/src/gcc/config/s390/s390.h (.../branches/gcc-4_8-branch)

18834

@@ -217,7 +217,7 @@

18835

#define STACK_BOUNDARY 64

18836

18837

/* Allocation boundary (in *bits*) for the code of a function. */

18838

-#define FUNCTION_BOUNDARY 32

18839

+#define FUNCTION_BOUNDARY 64

18840

18841

/* There is no point aligning anything to a rounder boundary than this. */

18842

#define BIGGEST_ALIGNMENT 64

18843

@@ -878,6 +878,9 @@

18844

fputc ('\n', (FILE)); \

18845

} while (0)

18846

18847

+#undef ASM_OUTPUT_FUNCTION_LABEL

18848

+#define ASM_OUTPUT_FUNCTION_LABEL(FILE, NAME, DECL) \

18849

+ s390_asm_output_function_label (FILE, NAME, DECL)

18850

18851

/* Miscellaneous parameters. */

18852

18853

Index: gcc/config/s390/s390.md

18854

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

18855

--- a/src/gcc/config/s390/s390.md (.../tags/gcc_4_8_2_release)

18856

+++ b/src/gcc/config/s390/s390.md (.../branches/gcc-4_8-branch)

18857

@@ -147,6 +147,7 @@

18858

18859

; Transactional Execution support

18860

UNSPECV_TBEGIN

18861

+ UNSPECV_TBEGIN_TDB

18862

UNSPECV_TBEGINC

18863

UNSPECV_TEND

18864

UNSPECV_TABORT

18865

@@ -9896,9 +9897,10 @@

18866

18867

(define_insn "tbegin_1"

18868

[(set (reg:CCRAW CC_REGNUM)

18869

- (unspec_volatile:CCRAW [(match_operand:BLK 0 "memory_operand" "=Q")

18870

- (match_operand 1 "const_int_operand" " D")]

18871

+ (unspec_volatile:CCRAW [(match_operand 0 "const_int_operand" "D")]

18872

UNSPECV_TBEGIN))

18873

+ (set (match_operand:BLK 1 "memory_operand" "=Q")

18874

+ (unspec_volatile:BLK [(match_dup 0)] UNSPECV_TBEGIN_TDB))

18875

(clobber (reg:DF 16))

18876

(clobber (reg:DF 17))

18877

(clobber (reg:DF 18))

18878

@@ -9917,18 +9919,19 @@

18879

(clobber (reg:DF 31))]

18880

; CONST_OK_FOR_CONSTRAINT_P does not work with D constraint since D is

18881

; not supposed to be used for immediates (see genpreds.c).

18882

- "TARGET_HTM && INTVAL (operands[1]) >= 0 && INTVAL (operands[1]) <= 0xffff"

18883

- "tbegin\t%0,%x1"

18884

+ "TARGET_HTM && INTVAL (operands[0]) >= 0 && INTVAL (operands[0]) <= 0xffff"

18885

+ "tbegin\t%1,%x0"

18886

[(set_attr "op_type" "SIL")])

18887

18888

; Same as above but without the FPR clobbers

18889

(define_insn "tbegin_nofloat_1"

18890

[(set (reg:CCRAW CC_REGNUM)

18891

- (unspec_volatile:CCRAW [(match_operand:BLK 0 "memory_operand" "=Q")

18892

- (match_operand 1 "const_int_operand" " D")]

18893

- UNSPECV_TBEGIN))]

18894

- "TARGET_HTM && INTVAL (operands[1]) >= 0 && INTVAL (operands[1]) <= 0xffff"

18895

- "tbegin\t%0,%x1"

18896

+ (unspec_volatile:CCRAW [(match_operand 0 "const_int_operand" "D")]

18897

+ UNSPECV_TBEGIN))

18898

+ (set (match_operand:BLK 1 "memory_operand" "=Q")

18899

+ (unspec_volatile:BLK [(match_dup 0)] UNSPECV_TBEGIN_TDB))]

18900

+ "TARGET_HTM && INTVAL (operands[0]) >= 0 && INTVAL (operands[0]) <= 0xffff"

18901

+ "tbegin\t%1,%x0"

18902

[(set_attr "op_type" "SIL")])

18903

18904

18905

@@ -10012,15 +10015,12 @@

18906

; Transaction perform processor assist

18907

18908

(define_expand "tx_assist"

18909

- [(set (match_dup 1) (const_int 0))

18910

- (unspec_volatile [(match_operand:SI 0 "register_operand" "")

18911

- (match_dup 1)

18912

+ [(unspec_volatile [(match_operand:SI 0 "register_operand" "")

18913

+ (reg:SI GPR0_REGNUM)

18914

(const_int 1)]

18915

UNSPECV_PPA)]

18916

"TARGET_HTM"

18917

-{

18918

- operands[1] = gen_reg_rtx (SImode);

18919

-})

18920

+ "")

18921

18922

(define_insn "*ppa"

18923

[(unspec_volatile [(match_operand:SI 0 "register_operand" "d")

18924

@@ -10028,5 +10028,5 @@

18925

(match_operand 2 "const_int_operand" "I")]

18926

UNSPECV_PPA)]

18927

"TARGET_HTM && INTVAL (operands[2]) < 16"

18928

- "ppa\t%0,%1,1"

18929

+ "ppa\t%0,%1,%2"

18930

[(set_attr "op_type" "RRF")])

18931

Index: gcc/config/s390/s390.opt

18932

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

18933

--- a/src/gcc/config/s390/s390.opt (.../tags/gcc_4_8_2_release)

18934

+++ b/src/gcc/config/s390/s390.opt (.../branches/gcc-4_8-branch)

18935

@@ -96,6 +96,14 @@

18936

Target Report RejectNegative Negative(msoft-float) InverseMask(SOFT_FLOAT, HARD_FLOAT)

18937

Enable hardware floating point

18938

18939

+mhotpatch

18940

+Target Report Var(s390_deferred_options) Defer

18941

+Prepend the function label with 12 two-byte Nop instructions, and add a four byte Nop instruction after the label for hotpatching.

18942

+

18943

+mhotpatch=

18944

+Target RejectNegative Report Joined Var(s390_deferred_options) Defer

18945

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

18946

+

18947

mlong-double-128

18948

Target Report RejectNegative Negative(mlong-double-64) Mask(LONG_DOUBLE_128)

18949

Use 128-bit long double

18950

Index: gcc/config/s390/htmxlintrin.h

18951

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

18952

--- a/src/gcc/config/s390/htmxlintrin.h (.../tags/gcc_4_8_2_release)

18953

+++ b/src/gcc/config/s390/htmxlintrin.h (.../branches/gcc-4_8-branch)

18954

@@ -33,13 +33,20 @@

18955

the IBM XL compiler. For documentation please see the "z/OS XL

18956

C/C++ Programming Guide" publically available on the web. */

18957

18958

-extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

18959

+/* FIXME: __TM_simple_begin and __TM_begin should be marked

18960

+ __always_inline__ as well but this currently produces an error

18961

+ since the tbegin builtins are "returns_twice" and setjmp_call_p

18962

+ (calls.c) therefore identifies the functions as calling setjmp.

18963

+ The tree inliner currently refuses to inline functions calling

18964

+ setjmp. */

18965

+

18966

+long

18967

__TM_simple_begin ()

18968

{

18969

return __builtin_tbegin_nofloat (0);

18970

}

18971

18972

-extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

18973

+long

18974

__TM_begin (void* const tdb)

18975

{

18976

return __builtin_tbegin_nofloat (tdb);

18977

@@ -78,7 +85,7 @@

18978

if (depth != 0)

18979

return depth;

18980

18981

- if (tdb->format == 0)

18982

+ if (tdb->format != 1)

18983

return 0;

18984

return tdb->nesting_depth;

18985

}

18986

@@ -90,7 +97,7 @@

18987

{

18988

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

18989

18990

- if (tdb->format == 0)

18991

+ if (tdb->format != 1)

18992

return 0;

18993

18994

return !!(tdb->abort_code >= _HTM_FIRST_USER_ABORT_CODE);

18995

@@ -101,7 +108,7 @@

18996

{

18997

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

18998

18999

- if (tdb->format == 0)

19000

+ if (tdb->format != 1)

19001

return 0;

19002

19003

if (tdb->abort_code >= _HTM_FIRST_USER_ABORT_CODE)

19004

@@ -117,7 +124,7 @@

19005

{

19006

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19007

19008

- return (tdb->format == 0

19009

+ return (tdb->format == 1

19010

&& (tdb->abort_code == 4 /* unfiltered program interruption */

19011

|| tdb->abort_code == 11 /* restricted instruction */));

19012

}

19013

@@ -127,7 +134,7 @@

19014

{

19015

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19016

19017

- return (tdb->format == 0

19018

+ return (tdb->format == 1

19019

&& (tdb->abort_code == 7 /* fetch overflow */

19020

|| tdb->abort_code == 8 /* store overflow */));

19021

}

19022

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

19023

{

19024

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19025

19026

- return tdb->format == 0 && tdb->abort_code == 13; /* depth exceeded */

19027

+ return tdb->format == 1 && tdb->abort_code == 13; /* depth exceeded */

19028

}

19029

19030

extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

19031

@@ -145,7 +152,7 @@

19032

{

19033

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

19034

19035

- return (tdb->format == 0

19036

+ return (tdb->format == 1

19037

&& (tdb->abort_code == 9 /* fetch conflict */

19038

|| tdb->abort_code == 10 /* store conflict */));

19039

}

19040

Index: gcc/config/s390/s390-protos.h

19041

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

19042

--- a/src/gcc/config/s390/s390-protos.h (.../tags/gcc_4_8_2_release)

19043

+++ b/src/gcc/config/s390/s390-protos.h (.../branches/gcc-4_8-branch)

19044

@@ -110,5 +110,6 @@

19045

extern int s390_branch_condition_mask (rtx);

19046

extern int s390_compare_and_branch_condition_mask (rtx);

19047

extern bool s390_extzv_shift_ok (int, int, unsigned HOST_WIDE_INT);

19048

+extern void s390_asm_output_function_label (FILE *, const char *, tree);

19049

19050

#endif /* RTX_CODE */

19051

Index: gcc/config/sparc/t-rtems

19052

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

19053

--- a/src/gcc/config/sparc/t-rtems (.../tags/gcc_4_8_2_release)

19054

+++ b/src/gcc/config/sparc/t-rtems (.../branches/gcc-4_8-branch)

19055

@@ -17,6 +17,6 @@

19056

# <http://www.gnu.org/licenses/>.

19057

#

19058

19059

-MULTILIB_OPTIONS = msoft-float mcpu=v8

19060

-MULTILIB_DIRNAMES = soft v8

19061

+MULTILIB_OPTIONS = msoft-float mcpu=v8/mcpu=leon3

19062

+MULTILIB_DIRNAMES = soft v8 leon3

19063

MULTILIB_MATCHES = msoft-float=mno-fpu

19064

Index: gcc/config/sparc/sparc.md

19065

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

19066

--- a/src/gcc/config/sparc/sparc.md (.../tags/gcc_4_8_2_release)

19067

+++ b/src/gcc/config/sparc/sparc.md (.../branches/gcc-4_8-branch)

19068

@@ -206,7 +206,7 @@

19069

;; 'f' for all DF/TFmode values, including those that are specific to the v8.

19070

19071

;; Attribute for cpu type.

19072

-;; These must match the values for enum processor_type in sparc.h.

19073

+;; These must match the values of the enum processor_type in sparc-opts.h.

19074

(define_attr "cpu"

19075

"v7,

19076

cypress,

19077

@@ -214,6 +214,7 @@

19078

supersparc,

19079

hypersparc,

19080

leon,

19081

+ leon3,

19082

sparclite,

19083

f930,

19084

f934,

19085

@@ -5548,7 +5549,7 @@

19086

[(set (match_operand:DF 0 "register_operand" "=e")

19087

(mult:DF (float_extend:DF (match_operand:SF 1 "register_operand" "f"))

19088

(float_extend:DF (match_operand:SF 2 "register_operand" "f"))))]

19089

- "(TARGET_V8 || TARGET_V9) && TARGET_FPU"

19090

+ "(TARGET_V8 || TARGET_V9) && TARGET_FPU && !sparc_fix_ut699"

19091

"fsmuld\t%1, %2, %0"

19092

[(set_attr "type" "fpmul")

19093

(set_attr "fptype" "double")])

19094

@@ -5577,20 +5578,37 @@

19095

"fdivq\t%1, %2, %0"

19096

[(set_attr "type" "fpdivd")])

19097

19098

-(define_insn "divdf3"

19099

+(define_expand "divdf3"

19100

[(set (match_operand:DF 0 "register_operand" "=e")

19101

(div:DF (match_operand:DF 1 "register_operand" "e")

19102

(match_operand:DF 2 "register_operand" "e")))]

19103

"TARGET_FPU"

19104

+ "")

19105

+

19106

+(define_insn "*divdf3_nofix"

19107

+ [(set (match_operand:DF 0 "register_operand" "=e")

19108

+ (div:DF (match_operand:DF 1 "register_operand" "e")

19109

+ (match_operand:DF 2 "register_operand" "e")))]

19110

+ "TARGET_FPU && !sparc_fix_ut699"

19111

"fdivd\t%1, %2, %0"

19112

[(set_attr "type" "fpdivd")

19113

(set_attr "fptype" "double")])

19114

19115

+(define_insn "*divdf3_fix"

19116

+ [(set (match_operand:DF 0 "register_operand" "=e")

19117

+ (div:DF (match_operand:DF 1 "register_operand" "e")

19118

+ (match_operand:DF 2 "register_operand" "e")))]

19119

+ "TARGET_FPU && sparc_fix_ut699"

19120

+ "fdivd\t%1, %2, %0\n\tstd\t%0, [%%sp-8]"

19121

+ [(set_attr "type" "fpdivd")

19122

+ (set_attr "fptype" "double")

19123

+ (set_attr "length" "2")])

19124

+

19125

(define_insn "divsf3"

19126

[(set (match_operand:SF 0 "register_operand" "=f")

19127

(div:SF (match_operand:SF 1 "register_operand" "f")

19128

(match_operand:SF 2 "register_operand" "f")))]

19129

- "TARGET_FPU"

19130

+ "TARGET_FPU && !sparc_fix_ut699"

19131

"fdivs\t%1, %2, %0"

19132

[(set_attr "type" "fpdivs")])

19133

19134

@@ -5791,18 +5809,33 @@

19135

"fsqrtq\t%1, %0"

19136

[(set_attr "type" "fpsqrtd")])

19137

19138

-(define_insn "sqrtdf2"

19139

+(define_expand "sqrtdf2"

19140

[(set (match_operand:DF 0 "register_operand" "=e")

19141

(sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

19142

"TARGET_FPU"

19143

+ "")

19144

+

19145

+(define_insn "*sqrtdf2_nofix"

19146

+ [(set (match_operand:DF 0 "register_operand" "=e")

19147

+ (sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

19148

+ "TARGET_FPU && !sparc_fix_ut699"

19149

"fsqrtd\t%1, %0"

19150

[(set_attr "type" "fpsqrtd")

19151

(set_attr "fptype" "double")])

19152

19153

+(define_insn "*sqrtdf2_fix"

19154

+ [(set (match_operand:DF 0 "register_operand" "=e")

19155

+ (sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

19156

+ "TARGET_FPU && sparc_fix_ut699"

19157

+ "fsqrtd\t%1, %0\n\tstd\t%0, [%%sp-8]"

19158

+ [(set_attr "type" "fpsqrtd")

19159

+ (set_attr "fptype" "double")

19160

+ (set_attr "length" "2")])

19161

+

19162

(define_insn "sqrtsf2"

19163

[(set (match_operand:SF 0 "register_operand" "=f")

19164

(sqrt:SF (match_operand:SF 1 "register_operand" "f")))]

19165

- "TARGET_FPU"

19166

+ "TARGET_FPU && !sparc_fix_ut699"

19167

"fsqrts\t%1, %0"

19168

[(set_attr "type" "fpsqrts")])

19169

19170

Index: gcc/config/sparc/t-sparc

19171

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

19172

--- a/src/gcc/config/sparc/t-sparc (.../tags/gcc_4_8_2_release)

19173

+++ b/src/gcc/config/sparc/t-sparc (.../branches/gcc-4_8-branch)

19174

@@ -23,7 +23,7 @@

19175

insn-codes.h conditions.h output.h $(INSN_ATTR_H) $(FLAGS_H) \

19176

$(FUNCTION_H) $(EXCEPT_H) $(EXPR_H) $(OPTABS_H) $(RECOG_H) \

19177

$(DIAGNOSTIC_CORE_H) $(GGC_H) $(TM_P_H) debug.h $(TARGET_H) \

19178

- $(TARGET_DEF_H) $(COMMON_TARGET_H) $(GIMPLE_H) \

19179

+ $(TARGET_DEF_H) $(COMMON_TARGET_H) $(GIMPLE_H) $(TREE_PASS_H) \

19180

langhooks.h reload.h $(PARAMS_H) $(DF_H) $(OPTS_H) \

19181

gt-sparc.h

19182

19183

Index: gcc/config/sparc/sparc.opt

19184

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

19185

--- a/src/gcc/config/sparc/sparc.opt (.../tags/gcc_4_8_2_release)

19186

+++ b/src/gcc/config/sparc/sparc.opt (.../branches/gcc-4_8-branch)

19187

@@ -146,6 +146,9 @@

19188

Enum(sparc_processor_type) String(leon) Value(PROCESSOR_LEON)

19189

19190

EnumValue

19191

+Enum(sparc_processor_type) String(leon3) Value(PROCESSOR_LEON3)

19192

+

19193

+EnumValue

19194

Enum(sparc_processor_type) String(sparclite) Value(PROCESSOR_SPARCLITE)

19195

19196

EnumValue

19197

@@ -201,9 +204,19 @@

19198

Enable workaround for single erratum of AT697F processor

19199

(corresponding to erratum #13 of AT697E processor)

19200

19201

+mfix-ut699

19202

+Target Report RejectNegative Var(sparc_fix_ut699)

19203

+Enable workarounds for the errata of the UT699 processor

19204

+

19205

Mask(LONG_DOUBLE_128)

19206

;; Use 128-bit long double

19207

19208

+Mask(LEON)

19209

+;; Generate code for LEON

19210

+

19211

+Mask(LEON3)

19212

+;; Generate code for LEON3

19213

+

19214

Mask(SPARCLITE)

19215

;; Generate code for SPARClite

19216

19217

Index: gcc/config/sparc/sync.md

19218

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

19219

--- a/src/gcc/config/sparc/sync.md (.../tags/gcc_4_8_2_release)

19220

+++ b/src/gcc/config/sparc/sync.md (.../branches/gcc-4_8-branch)

19221

@@ -161,7 +161,8 @@

19222

(match_operand:SI 5 "const_int_operand" "") ;; is_weak

19223

(match_operand:SI 6 "const_int_operand" "") ;; mod_s

19224

(match_operand:SI 7 "const_int_operand" "")] ;; mod_f

19225

- "TARGET_V9 && (<MODE>mode != DImode || TARGET_ARCH64 || TARGET_V8PLUS)"

19226

+ "(TARGET_V9 || TARGET_LEON3)

19227

+ && (<MODE>mode != DImode || TARGET_ARCH64 || TARGET_V8PLUS)"

19228

{

19229

sparc_expand_compare_and_swap (operands);

19230

DONE;

19231

@@ -176,7 +177,7 @@

19232

[(match_operand:I48MODE 2 "register_operand" "")

19233

(match_operand:I48MODE 3 "register_operand" "")]

19234

UNSPECV_CAS))])]

19235

- "TARGET_V9"

19236

+ "TARGET_V9 || TARGET_LEON3"

19237

"")

19238

19239

(define_insn "*atomic_compare_and_swap<mode>_1"

19240

@@ -187,7 +188,7 @@

19241

[(match_operand:I48MODE 2 "register_operand" "r")

19242

(match_operand:I48MODE 3 "register_operand" "0")]

19243

UNSPECV_CAS))]

19244

- "TARGET_V9 && (<MODE>mode == SImode || TARGET_ARCH64)"

19245

+ "(TARGET_V9 || TARGET_LEON3) && (<MODE>mode != DImode || TARGET_ARCH64)"

19246

"cas<modesuffix>\t%1, %2, %0"

19247

[(set_attr "type" "multi")])

19248

19249

@@ -220,7 +221,7 @@

19250

(match_operand:SI 1 "memory_operand" "")

19251

(match_operand:SI 2 "register_operand" "")

19252

(match_operand:SI 3 "const_int_operand" "")]

19253

- "TARGET_V8 || TARGET_V9"

19254

+ "(TARGET_V8 || TARGET_V9) && !sparc_fix_ut699"

19255

{

19256

enum memmodel model = (enum memmodel) INTVAL (operands[3]);

19257

19258

@@ -236,7 +237,7 @@

19259

UNSPECV_SWAP))

19260

(set (match_dup 1)

19261

(match_operand:SI 2 "register_operand" "0"))]

19262

- "TARGET_V8 || TARGET_V9"

19263

+ "(TARGET_V8 || TARGET_V9) && !sparc_fix_ut699"

19264

"swap\t%1, %0"

19265

[(set_attr "type" "multi")])

19266

19267

@@ -244,7 +245,7 @@

19268

[(match_operand:QI 0 "register_operand" "")

19269

(match_operand:QI 1 "memory_operand" "")

19270

(match_operand:SI 2 "const_int_operand" "")]

19271

- ""

19272

+ "!sparc_fix_ut699"

19273

{

19274

enum memmodel model = (enum memmodel) INTVAL (operands[2]);

19275

rtx ret;

19276

@@ -268,6 +269,6 @@

19277

(unspec_volatile:QI [(match_operand:QI 1 "memory_operand" "+m")]

19278

UNSPECV_LDSTUB))

19279

(set (match_dup 1) (const_int -1))]

19280

- ""

19281

+ "!sparc_fix_ut699"

19282

"ldstub\t%1, %0"

19283

[(set_attr "type" "multi")])

19284

Index: gcc/config/sparc/sparc-opts.h

19285

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

19286

--- a/src/gcc/config/sparc/sparc-opts.h (.../tags/gcc_4_8_2_release)

19287

+++ b/src/gcc/config/sparc/sparc-opts.h (.../branches/gcc-4_8-branch)

19288

@@ -30,6 +30,7 @@

19289

PROCESSOR_SUPERSPARC,

19290

PROCESSOR_HYPERSPARC,

19291

PROCESSOR_LEON,

19292

+ PROCESSOR_LEON3,

19293

PROCESSOR_SPARCLITE,

19294

PROCESSOR_F930,

19295

PROCESSOR_F934,

19296

Index: gcc/config/sparc/sparc.c

19297

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

19298

--- a/src/gcc/config/sparc/sparc.c (.../tags/gcc_4_8_2_release)

19299

+++ b/src/gcc/config/sparc/sparc.c (.../branches/gcc-4_8-branch)

19300

@@ -52,6 +52,7 @@

19301

#include "params.h"

19302

#include "df.h"

19303

#include "opts.h"

19304

+#include "tree-pass.h"

19305

19306

/* Processor costs */

19307

19308

@@ -226,6 +227,30 @@

19309

};

19310

19311

static const

19312

+struct processor_costs leon3_costs = {

19313

+ COSTS_N_INSNS (1), /* int load */

19314

+ COSTS_N_INSNS (1), /* int signed load */

19315

+ COSTS_N_INSNS (1), /* int zeroed load */

19316

+ COSTS_N_INSNS (1), /* float load */

19317

+ COSTS_N_INSNS (1), /* fmov, fneg, fabs */

19318

+ COSTS_N_INSNS (1), /* fadd, fsub */

19319

+ COSTS_N_INSNS (1), /* fcmp */

19320

+ COSTS_N_INSNS (1), /* fmov, fmovr */

19321

+ COSTS_N_INSNS (1), /* fmul */

19322

+ COSTS_N_INSNS (14), /* fdivs */

19323

+ COSTS_N_INSNS (15), /* fdivd */

19324

+ COSTS_N_INSNS (22), /* fsqrts */

19325

+ COSTS_N_INSNS (23), /* fsqrtd */

19326

+ COSTS_N_INSNS (5), /* imul */

19327

+ COSTS_N_INSNS (5), /* imulX */

19328

+ 0, /* imul bit factor */

19329

+ COSTS_N_INSNS (35), /* idiv */

19330

+ COSTS_N_INSNS (35), /* idivX */

19331

+ COSTS_N_INSNS (1), /* movcc/movr */

19332

+ 0, /* shift penalty */

19333

+};

19334

+

19335

+static const

19336

struct processor_costs sparclet_costs = {

19337

COSTS_N_INSNS (3), /* int load */

19338

COSTS_N_INSNS (3), /* int signed load */

19339

@@ -538,7 +563,6 @@

19340

HOST_WIDE_INT, tree);

19341

static bool sparc_can_output_mi_thunk (const_tree, HOST_WIDE_INT,

19342

HOST_WIDE_INT, const_tree);

19343

-static void sparc_reorg (void);

19344

static struct machine_function * sparc_init_machine_status (void);

19345

static bool sparc_cannot_force_const_mem (enum machine_mode, rtx);

19346

static rtx sparc_tls_get_addr (void);

19347

@@ -680,9 +704,6 @@

19348

#undef TARGET_ASM_CAN_OUTPUT_MI_THUNK

19349

#define TARGET_ASM_CAN_OUTPUT_MI_THUNK sparc_can_output_mi_thunk

19350

19351

-#undef TARGET_MACHINE_DEPENDENT_REORG

19352

-#define TARGET_MACHINE_DEPENDENT_REORG sparc_reorg

19353

-

19354

#undef TARGET_RTX_COSTS

19355

#define TARGET_RTX_COSTS sparc_rtx_costs

19356

#undef TARGET_ADDRESS_COST

19357

@@ -804,6 +825,206 @@

19358

19359

struct gcc_target targetm = TARGET_INITIALIZER;

19360

19361

+/* Return the memory reference contained in X if any, zero otherwise. */

19362

+

19363

+static rtx

19364

+mem_ref (rtx x)

19365

+{

19366

+ if (GET_CODE (x) == SIGN_EXTEND || GET_CODE (x) == ZERO_EXTEND)

19367

+ x = XEXP (x, 0);

19368

+

19369

+ if (MEM_P (x))

19370

+ return x;

19371

+

19372

+ return NULL_RTX;

19373

+}

19374

+

19375

+/* We use a machine specific pass to enable workarounds for errata.

19376

+ We need to have the (essentially) final form of the insn stream in order

19377

+ to properly detect the various hazards. Therefore, this machine specific

19378

+ pass runs as late as possible. The pass is inserted in the pass pipeline

19379

+ at the end of sparc_option_override. */

19380

+

19381

+static bool

19382

+sparc_gate_work_around_errata (void)

19383

+{

19384

+ /* The only errata we handle are those of the AT697F and UT699. */

19385

+ return sparc_fix_at697f != 0 || sparc_fix_ut699 != 0;

19386

+}

19387

+

19388

+static unsigned int

19389

+sparc_do_work_around_errata (void)

19390

+{

19391

+ rtx insn, next;

19392

+

19393

+ /* Force all instructions to be split into their final form. */

19394

+ split_all_insns_noflow ();

19395

+

19396

+ /* Now look for specific patterns in the insn stream. */

19397

+ for (insn = get_insns (); insn; insn = next)

19398

+ {

19399

+ bool insert_nop = false;

19400

+ rtx set;

19401

+

19402

+ /* Look into the instruction in a delay slot. */

19403

+ if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)

19404

+ insn = XVECEXP (PATTERN (insn), 0, 1);

19405

+

19406

+ /* Look for a single-word load into an odd-numbered FP register. */

19407

+ if (sparc_fix_at697f

19408

+ && NONJUMP_INSN_P (insn)

19409

+ && (set = single_set (insn)) != NULL_RTX

19410

+ && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) == 4

19411

+ && MEM_P (SET_SRC (set))

19412

+ && REG_P (SET_DEST (set))

19413

+ && REGNO (SET_DEST (set)) > 31

19414

+ && REGNO (SET_DEST (set)) % 2 != 0)

19415

+ {

19416

+ /* The wrong dependency is on the enclosing double register. */

19417

+ unsigned int x = REGNO (SET_DEST (set)) - 1;

19418

+ unsigned int src1, src2, dest;

19419

+ int code;

19420

+

19421

+ /* If the insn has a delay slot, then it cannot be problematic. */

19422

+ next = next_active_insn (insn);

19423

+ if (!next)

19424

+ break;

19425

+ if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

19426

+ continue;

19427

+

19428

+ extract_insn (next);

19429

+ code = INSN_CODE (next);

19430

+

19431

+ switch (code)

19432

+ {

19433

+ case CODE_FOR_adddf3:

19434

+ case CODE_FOR_subdf3:

19435

+ case CODE_FOR_muldf3:

19436

+ case CODE_FOR_divdf3:

19437

+ dest = REGNO (recog_data.operand[0]);

19438

+ src1 = REGNO (recog_data.operand[1]);

19439

+ src2 = REGNO (recog_data.operand[2]);

19440

+ if (src1 != src2)

19441

+ {

19442

+ /* Case [1-4]:

19443

+ ld [address], %fx+1

19444

+ FPOPd %f{x,y}, %f{y,x}, %f{x,y} */

19445

+ if ((src1 == x || src2 == x)

19446

+ && (dest == src1 || dest == src2))

19447

+ insert_nop = true;

19448

+ }

19449

+ else

19450

+ {

19451

+ /* Case 5:

19452

+ ld [address], %fx+1

19453

+ FPOPd %fx, %fx, %fx */

19454

+ if (src1 == x

19455

+ && dest == src1

19456

+ && (code == CODE_FOR_adddf3 || code == CODE_FOR_muldf3))

19457

+ insert_nop = true;

19458

+ }

19459

+ break;

19460

+

19461

+ case CODE_FOR_sqrtdf2:

19462

+ dest = REGNO (recog_data.operand[0]);

19463

+ src1 = REGNO (recog_data.operand[1]);

19464

+ /* Case 6:

19465

+ ld [address], %fx+1

19466

+ fsqrtd %fx, %fx */

19467

+ if (src1 == x && dest == src1)

19468

+ insert_nop = true;

19469

+ break;

19470

+

19471

+ default:

19472

+ break;

19473

+ }

19474

+ }

19475

+

19476

+ /* Look for a single-word load into an integer register. */

19477

+ else if (sparc_fix_ut699

19478

+ && NONJUMP_INSN_P (insn)

19479

+ && (set = single_set (insn)) != NULL_RTX

19480

+ && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) <= 4

19481

+ && mem_ref (SET_SRC (set)) != NULL_RTX

19482

+ && REG_P (SET_DEST (set))

19483

+ && REGNO (SET_DEST (set)) < 32)

19484

+ {

19485

+ /* There is no problem if the second memory access has a data

19486

+ dependency on the first single-cycle load. */

19487

+ rtx x = SET_DEST (set);

19488

+

19489

+ /* If the insn has a delay slot, then it cannot be problematic. */

19490

+ next = next_active_insn (insn);

19491

+ if (!next)

19492

+ break;

19493

+ if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

19494

+ continue;

19495

+

19496

+ /* Look for a second memory access to/from an integer register. */

19497

+ if ((set = single_set (next)) != NULL_RTX)

19498

+ {

19499

+ rtx src = SET_SRC (set);

19500

+ rtx dest = SET_DEST (set);

19501

+ rtx mem;

19502

+

19503

+ /* LDD is affected. */

19504

+ if ((mem = mem_ref (src)) != NULL_RTX

19505

+ && REG_P (dest)

19506

+ && REGNO (dest) < 32

19507

+ && !reg_mentioned_p (x, XEXP (mem, 0)))

19508

+ insert_nop = true;

19509

+

19510

+ /* STD is *not* affected. */

19511

+ else if ((mem = mem_ref (dest)) != NULL_RTX

19512

+ && GET_MODE_SIZE (GET_MODE (mem)) <= 4

19513

+ && (src == const0_rtx

19514

+ || (REG_P (src)

19515

+ && REGNO (src) < 32

19516

+ && REGNO (src) != REGNO (x)))

19517

+ && !reg_mentioned_p (x, XEXP (mem, 0)))

19518

+ insert_nop = true;

19519

+ }

19520

+ }

19521

+

19522

+ else

19523

+ next = NEXT_INSN (insn);

19524

+

19525

+ if (insert_nop)

19526

+ emit_insn_before (gen_nop (), next);

19527

+ }

19528

+

19529

+ return 0;

19530

+}

19531

+

19532

+struct rtl_opt_pass pass_work_around_errata =

19533

+{

19534

+ {

19535

+ RTL_PASS,

19536

+ "errata", /* name */

19537

+ OPTGROUP_NONE, /* optinfo_flags */

19538

+ sparc_gate_work_around_errata, /* gate */

19539

+ sparc_do_work_around_errata, /* execute */

19540

+ NULL, /* sub */

19541

+ NULL, /* next */

19542

+ 0, /* static_pass_number */

19543

+ TV_MACH_DEP, /* tv_id */

19544

+ 0, /* properties_required */

19545

+ 0, /* properties_provided */

19546

+ 0, /* properties_destroyed */

19547

+ 0, /* todo_flags_start */

19548

+ TODO_verify_rtl_sharing, /* todo_flags_finish */

19549

+ }

19550

+};

19551

+

19552

+struct register_pass_info insert_pass_work_around_errata =

19553

+{

19554

+ &pass_work_around_errata.pass, /* pass */

19555

+ "dbr", /* reference_pass_name */

19556

+ 1, /* ref_pass_instance_number */

19557

+ PASS_POS_INSERT_AFTER /* po_op */

19558

+};

19559

+

19560

+/* Helpers for TARGET_DEBUG_OPTIONS. */

19561

static void

19562

dump_target_flag_bits (const int flags)

19563

{

19564

@@ -888,6 +1109,7 @@

19565

{ TARGET_CPU_supersparc, PROCESSOR_SUPERSPARC },

19566

{ TARGET_CPU_hypersparc, PROCESSOR_HYPERSPARC },

19567

{ TARGET_CPU_leon, PROCESSOR_LEON },

19568

+ { TARGET_CPU_leon3, PROCESSOR_LEON3 },

19569

{ TARGET_CPU_sparclite, PROCESSOR_F930 },

19570

{ TARGET_CPU_sparclite86x, PROCESSOR_SPARCLITE86X },

19571

{ TARGET_CPU_sparclet, PROCESSOR_TSC701 },

19572

@@ -902,7 +1124,7 @@

19573

};

19574

const struct cpu_default *def;

19575

/* Table of values for -m{cpu,tune}=. This must match the order of

19576

- the PROCESSOR_* enumeration. */

19577

+ the enum processor_type in sparc-opts.h. */

19578

static struct cpu_table {

19579

const char *const name;

19580

const int disable;

19581

@@ -914,8 +1136,8 @@

19582

/* TI TMS390Z55 supersparc */

19583

{ "supersparc", MASK_ISA, MASK_V8 },

19584

{ "hypersparc", MASK_ISA, MASK_V8|MASK_FPU },

19585

- /* LEON */

19586

- { "leon", MASK_ISA, MASK_V8|MASK_FPU },

19587

+ { "leon", MASK_ISA, MASK_V8|MASK_LEON|MASK_FPU },

19588

+ { "leon3", MASK_ISA, MASK_V8|MASK_LEON3|MASK_FPU },

19589

{ "sparclite", MASK_ISA, MASK_SPARCLITE },

19590

/* The Fujitsu MB86930 is the original sparclite chip, with no FPU. */

19591

{ "f930", MASK_ISA|MASK_FPU, MASK_SPARCLITE },

19592

@@ -1075,6 +1297,9 @@

19593

#ifndef HAVE_AS_SPARC4

19594

& ~MASK_CBCOND

19595

#endif

19596

+#ifndef HAVE_AS_LEON

19597

+ & ~(MASK_LEON | MASK_LEON3)

19598

+#endif

19599

);

19600

19601

/* If -mfpu or -mno-fpu was explicitly used, don't override with

19602

@@ -1164,6 +1389,9 @@

19603

case PROCESSOR_LEON:

19604

sparc_costs = &leon_costs;

19605

break;

19606

+ case PROCESSOR_LEON3:

19607

+ sparc_costs = &leon3_costs;

19608

+ break;

19609

case PROCESSOR_SPARCLET:

19610

case PROCESSOR_TSC701:

19611

sparc_costs = &sparclet_costs;

19612

@@ -1200,6 +1428,10 @@

19613

/* Choose the most relaxed model for the processor. */

19614

else if (TARGET_V9)

19615

sparc_memory_model = SMM_RMO;

19616

+ else if (TARGET_LEON3)

19617

+ sparc_memory_model = SMM_TSO;

19618

+ else if (TARGET_LEON)

19619

+ sparc_memory_model = SMM_SC;

19620

else if (TARGET_V8)

19621

sparc_memory_model = SMM_PSO;

19622

else

19623

@@ -1241,6 +1473,13 @@

19624

pessimizes for double floating-point registers. */

19625

if (!global_options_set.x_flag_ira_share_save_slots)

19626

flag_ira_share_save_slots = 0;

19627

+

19628

+ /* We register a machine specific pass to work around errata, if any.

19629

+ The pass mut be scheduled as late as possible so that we have the

19630

+ (essentially) final form of the insn stream to work on.

19631

+ Registering the pass must be done at start up. It's convenient to

19632

+ do it here. */

19633

+ register_pass (&insert_pass_work_around_errata);

19634

}

19635

19636

/* Miscellaneous utilities. */

19637

@@ -10355,7 +10594,8 @@

19638

tmp = e0.add_with_sign (tmp, false, &add1_ovf);

19639

if (tmp.is_negative ())

19640

tmp = tmp.neg_with_overflow (&neg2_ovf);

19641

-

19642

+ else

19643

+ neg2_ovf = false;

19644

result = result.add_with_sign (tmp, false, &add2_ovf);

19645

overflow |= neg1_ovf | neg2_ovf | add1_ovf | add2_ovf;

19646

}

19647

@@ -10897,107 +11137,6 @@

19648

return (vcall_offset >= -32768 || ! fixed_regs[5]);

19649

}

19650

19651

-/* We use the machine specific reorg pass to enable workarounds for errata. */

19652

-

19653

-static void

19654

-sparc_reorg (void)

19655

-{

19656

- rtx insn, next;

19657

-

19658

- /* The only erratum we handle for now is that of the AT697F processor. */

19659

- if (!sparc_fix_at697f)

19660

- return;

19661

-

19662

- /* We need to have the (essentially) final form of the insn stream in order

19663

- to properly detect the various hazards. Run delay slot scheduling. */

19664

- if (optimize > 0 && flag_delayed_branch)

19665

- {

19666

- cleanup_barriers ();

19667

- dbr_schedule (get_insns ());

19668

- }

19669

-

19670

- /* Now look for specific patterns in the insn stream. */

19671

- for (insn = get_insns (); insn; insn = next)

19672

- {

19673

- bool insert_nop = false;

19674

- rtx set;

19675

-

19676

- /* Look for a single-word load into an odd-numbered FP register. */

19677

- if (NONJUMP_INSN_P (insn)

19678

- && (set = single_set (insn)) != NULL_RTX

19679

- && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) == 4

19680

- && MEM_P (SET_SRC (set))

19681

- && REG_P (SET_DEST (set))

19682

- && REGNO (SET_DEST (set)) > 31

19683

- && REGNO (SET_DEST (set)) % 2 != 0)

19684

- {

19685

- /* The wrong dependency is on the enclosing double register. */

19686

- unsigned int x = REGNO (SET_DEST (set)) - 1;

19687

- unsigned int src1, src2, dest;

19688

- int code;

19689

-

19690

- /* If the insn has a delay slot, then it cannot be problematic. */

19691

- next = next_active_insn (insn);

19692

- if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

19693

- code = -1;

19694

- else

19695

- {

19696

- extract_insn (next);

19697

- code = INSN_CODE (next);

19698

- }

19699

-

19700

- switch (code)

19701

- {

19702

- case CODE_FOR_adddf3:

19703

- case CODE_FOR_subdf3:

19704

- case CODE_FOR_muldf3:

19705

- case CODE_FOR_divdf3:

19706

- dest = REGNO (recog_data.operand[0]);

19707

- src1 = REGNO (recog_data.operand[1]);

19708

- src2 = REGNO (recog_data.operand[2]);

19709

- if (src1 != src2)

19710

- {

19711

- /* Case [1-4]:

19712

- ld [address], %fx+1

19713

- FPOPd %f{x,y}, %f{y,x}, %f{x,y} */

19714

- if ((src1 == x || src2 == x)

19715

- && (dest == src1 || dest == src2))

19716

- insert_nop = true;

19717

- }

19718

- else

19719

- {

19720

- /* Case 5:

19721

- ld [address], %fx+1

19722

- FPOPd %fx, %fx, %fx */

19723

- if (src1 == x

19724

- && dest == src1

19725

- && (code == CODE_FOR_adddf3 || code == CODE_FOR_muldf3))

19726

- insert_nop = true;

19727

- }

19728

- break;

19729

-

19730

- case CODE_FOR_sqrtdf2:

19731

- dest = REGNO (recog_data.operand[0]);

19732

- src1 = REGNO (recog_data.operand[1]);

19733

- /* Case 6:

19734

- ld [address], %fx+1

19735

- fsqrtd %fx, %fx */

19736

- if (src1 == x && dest == src1)

19737

- insert_nop = true;

19738

- break;

19739

-

19740

- default:

19741

- break;

19742

- }

19743

- }

19744

- else

19745

- next = NEXT_INSN (insn);

19746

-

19747

- if (insert_nop)

19748

- emit_insn_after (gen_nop (), insn);

19749

- }

19750

-}

19751

-

19752

/* How to allocate a 'struct machine_function'. */

19753

19754

static struct machine_function *

19755

Index: gcc/config/sparc/leon.md

19756

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

19757

--- a/src/gcc/config/sparc/leon.md (.../tags/gcc_4_8_2_release)

19758

+++ b/src/gcc/config/sparc/leon.md (.../branches/gcc-4_8-branch)

19759

@@ -17,40 +17,48 @@

19760

;; along with GCC; see the file COPYING3. If not see

19761

;; <http://www.gnu.org/licenses/>.

19762

19763

+;; Leon is a single-issue processor.

19764

19765

(define_automaton "leon")

19766

19767

-(define_cpu_unit "leon_memory, leon_fpalu" "leon")

19768

-(define_cpu_unit "leon_fpmds" "leon")

19769

-(define_cpu_unit "write_buf" "leon")

19770

+(define_cpu_unit "leon_memory" "leon")

19771

19772

(define_insn_reservation "leon_load" 1

19773

- (and (eq_attr "cpu" "leon")

19774

- (eq_attr "type" "load,sload,fpload"))

19775

+ (and (eq_attr "cpu" "leon") (eq_attr "type" "load,sload"))

19776

"leon_memory")

19777

19778

-(define_insn_reservation "leon_store" 1

19779

- (and (eq_attr "cpu" "leon")

19780

- (eq_attr "type" "store,fpstore"))

19781

- "leon_memory+write_buf")

19782

-

19783

-(define_insn_reservation "leon_fp_alu" 1

19784

- (and (eq_attr "cpu" "leon")

19785

- (eq_attr "type" "fp,fpmove"))

19786

- "leon_fpalu, nothing")

19787

+;; Use a double reservation to work around the load pipeline hazard on UT699.

19788

+(define_insn_reservation "leon3_load" 1

19789

+ (and (eq_attr "cpu" "leon3") (eq_attr "type" "load,sload"))

19790

+ "leon_memory*2")

19791

19792

-(define_insn_reservation "leon_fp_mult" 1

19793

- (and (eq_attr "cpu" "leon")

19794

- (eq_attr "type" "fpmul"))

19795

- "leon_fpmds, nothing")

19796

+(define_insn_reservation "leon_store" 2

19797

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "store"))

19798

+ "leon_memory*2")

19799

19800

-(define_insn_reservation "leon_fp_div" 16

19801

- (and (eq_attr "cpu" "leon")

19802

- (eq_attr "type" "fpdivs,fpdivd"))

19803

- "leon_fpmds, nothing*15")

19804

+;; This describes Gaisler Research's FPU

19805

19806

-(define_insn_reservation "leon_fp_sqrt" 23

19807

- (and (eq_attr "cpu" "leon")

19808

- (eq_attr "type" "fpsqrts,fpsqrtd"))

19809

- "leon_fpmds, nothing*21")

19810

+(define_automaton "grfpu")

19811

19812

+(define_cpu_unit "grfpu_alu" "grfpu")

19813

+(define_cpu_unit "grfpu_ds" "grfpu")

19814

+

19815

+(define_insn_reservation "leon_fp_alu" 4

19816

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fp,fpcmp,fpmul"))

19817

+ "grfpu_alu, nothing*3")

19818

+

19819

+(define_insn_reservation "leon_fp_divs" 16

19820

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpdivs"))

19821

+ "grfpu_ds*14, nothing*2")

19822

+

19823

+(define_insn_reservation "leon_fp_divd" 17

19824

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpdivd"))

19825

+ "grfpu_ds*15, nothing*2")

19826

+

19827

+(define_insn_reservation "leon_fp_sqrts" 24

19828

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpsqrts"))

19829

+ "grfpu_ds*22, nothing*2")

19830

+

19831

+(define_insn_reservation "leon_fp_sqrtd" 25

19832

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpsqrtd"))

19833

+ "grfpu_ds*23, nothing*2")

19834

Index: gcc/config/sparc/sparc.h

19835

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

19836

--- a/src/gcc/config/sparc/sparc.h (.../tags/gcc_4_8_2_release)

19837

+++ b/src/gcc/config/sparc/sparc.h (.../branches/gcc-4_8-branch)

19838

@@ -136,21 +136,22 @@

19839

#define TARGET_CPU_supersparc 2

19840

#define TARGET_CPU_hypersparc 3

19841

#define TARGET_CPU_leon 4

19842

-#define TARGET_CPU_sparclite 5

19843

-#define TARGET_CPU_f930 5 /* alias */

19844

-#define TARGET_CPU_f934 5 /* alias */

19845

-#define TARGET_CPU_sparclite86x 6

19846

-#define TARGET_CPU_sparclet 7

19847

-#define TARGET_CPU_tsc701 7 /* alias */

19848

-#define TARGET_CPU_v9 8 /* generic v9 implementation */

19849

-#define TARGET_CPU_sparcv9 8 /* alias */

19850

-#define TARGET_CPU_sparc64 8 /* alias */

19851

-#define TARGET_CPU_ultrasparc 9

19852

-#define TARGET_CPU_ultrasparc3 10

19853

-#define TARGET_CPU_niagara 11

19854

-#define TARGET_CPU_niagara2 12

19855

-#define TARGET_CPU_niagara3 13

19856

-#define TARGET_CPU_niagara4 14

19857

+#define TARGET_CPU_leon3 5

19858

+#define TARGET_CPU_sparclite 6

19859

+#define TARGET_CPU_f930 6 /* alias */

19860

+#define TARGET_CPU_f934 6 /* alias */

19861

+#define TARGET_CPU_sparclite86x 7

19862

+#define TARGET_CPU_sparclet 8

19863

+#define TARGET_CPU_tsc701 8 /* alias */

19864

+#define TARGET_CPU_v9 9 /* generic v9 implementation */

19865

+#define TARGET_CPU_sparcv9 9 /* alias */

19866

+#define TARGET_CPU_sparc64 9 /* alias */

19867

+#define TARGET_CPU_ultrasparc 10

19868

+#define TARGET_CPU_ultrasparc3 11

19869

+#define TARGET_CPU_niagara 12

19870

+#define TARGET_CPU_niagara2 13

19871

+#define TARGET_CPU_niagara3 14

19872

+#define TARGET_CPU_niagara4 15

19873

19874

#if TARGET_CPU_DEFAULT == TARGET_CPU_v9 \

19875

|| TARGET_CPU_DEFAULT == TARGET_CPU_ultrasparc \

19876

@@ -232,9 +233,10 @@

19877

#define ASM_CPU32_DEFAULT_SPEC ""

19878

#endif

19879

19880

-#if TARGET_CPU_DEFAULT == TARGET_CPU_leon

19881

+#if TARGET_CPU_DEFAULT == TARGET_CPU_leon \

19882

+ || TARGET_CPU_DEFAULT == TARGET_CPU_leon3

19883

#define CPP_CPU32_DEFAULT_SPEC "-D__leon__ -D__sparc_v8__"

19884

-#define ASM_CPU32_DEFAULT_SPEC ""

19885

+#define ASM_CPU32_DEFAULT_SPEC AS_LEON_FLAG

19886

#endif

19887

19888

#endif

19889

@@ -282,6 +284,7 @@

19890

%{mcpu=supersparc:-D__supersparc__ -D__sparc_v8__} \

19891

%{mcpu=hypersparc:-D__hypersparc__ -D__sparc_v8__} \

19892

%{mcpu=leon:-D__leon__ -D__sparc_v8__} \

19893

+%{mcpu=leon3:-D__leon__ -D__sparc_v8__} \

19894

%{mcpu=v9:-D__sparc_v9__} \

19895

%{mcpu=ultrasparc:-D__sparc_v9__} \

19896

%{mcpu=ultrasparc3:-D__sparc_v9__} \

19897

@@ -329,7 +332,8 @@

19898

%{mcpu=v8:-Av8} \

19899

%{mcpu=supersparc:-Av8} \

19900

%{mcpu=hypersparc:-Av8} \

19901

-%{mcpu=leon:-Av8} \

19902

+%{mcpu=leon:" AS_LEON_FLAG "} \

19903

+%{mcpu=leon3:" AS_LEON_FLAG "} \

19904

%{mv8plus:-Av8plus} \

19905

%{mcpu=v9:-Av9} \

19906

%{mcpu=ultrasparc:%{!mv8plus:-Av9a}} \

19907

@@ -1754,6 +1758,12 @@

19908

#define AS_NIAGARA4_FLAG "-Av9" AS_NIAGARA3_FLAG

19909

#endif

19910

19911

+#ifdef HAVE_AS_LEON

19912

+#define AS_LEON_FLAG "-Aleon"

19913

+#else

19914

+#define AS_LEON_FLAG "-Av8"

19915

+#endif

19916

+

19917

/* We use gcc _mcount for profiling. */

19918

#define NO_PROFILE_COUNTERS 0

19919

19920

Index: gcc/config/i386/i386.h

19921

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

19922

--- a/src/gcc/config/i386/i386.h (.../tags/gcc_4_8_2_release)

19923

+++ b/src/gcc/config/i386/i386.h (.../branches/gcc-4_8-branch)

19924

@@ -197,10 +197,10 @@

19925

19926

/* Macros used in the machine description to test the flags. */

19927

19928

-/* configure can arrange to make this 2, to force a 486. */

19929

+/* configure can arrange to change it. */

19930

19931

#ifndef TARGET_CPU_DEFAULT

19932

-#define TARGET_CPU_DEFAULT TARGET_CPU_DEFAULT_generic

19933

+#define TARGET_CPU_DEFAULT PROCESSOR_GENERIC32

19934

#endif

19935

19936

#ifndef TARGET_FPMATH_DEFAULT

19937

@@ -591,43 +591,6 @@

19938

/* Target Pragmas. */

19939

#define REGISTER_TARGET_PRAGMAS() ix86_register_pragmas ()

19940

19941

-enum target_cpu_default

19942

-{

19943

- TARGET_CPU_DEFAULT_generic = 0,

19944

-

19945

- TARGET_CPU_DEFAULT_i386,

19946

- TARGET_CPU_DEFAULT_i486,

19947

- TARGET_CPU_DEFAULT_pentium,

19948

- TARGET_CPU_DEFAULT_pentium_mmx,

19949

- TARGET_CPU_DEFAULT_pentiumpro,

19950

- TARGET_CPU_DEFAULT_pentium2,

19951

- TARGET_CPU_DEFAULT_pentium3,

19952

- TARGET_CPU_DEFAULT_pentium4,

19953

- TARGET_CPU_DEFAULT_pentium_m,

19954

- TARGET_CPU_DEFAULT_prescott,

19955

- TARGET_CPU_DEFAULT_nocona,

19956

- TARGET_CPU_DEFAULT_core2,

19957

- TARGET_CPU_DEFAULT_corei7,

19958

- TARGET_CPU_DEFAULT_haswell,

19959

- TARGET_CPU_DEFAULT_atom,

19960

-

19961

- TARGET_CPU_DEFAULT_geode,

19962

- TARGET_CPU_DEFAULT_k6,

19963

- TARGET_CPU_DEFAULT_k6_2,

19964

- TARGET_CPU_DEFAULT_k6_3,

19965

- TARGET_CPU_DEFAULT_athlon,

19966

- TARGET_CPU_DEFAULT_athlon_sse,

19967

- TARGET_CPU_DEFAULT_k8,

19968

- TARGET_CPU_DEFAULT_amdfam10,

19969

- TARGET_CPU_DEFAULT_bdver1,

19970

- TARGET_CPU_DEFAULT_bdver2,

19971

- TARGET_CPU_DEFAULT_bdver3,

19972

- TARGET_CPU_DEFAULT_btver1,

19973

- TARGET_CPU_DEFAULT_btver2,

19974

-

19975

- TARGET_CPU_DEFAULT_max

19976

-};

19977

-

19978

#ifndef CC1_SPEC

19979

#define CC1_SPEC "%(cc1_cpu) "

19980

#endif

19981

@@ -2089,32 +2052,33 @@

19982

with x86-64 medium memory model */

19983

#define DEFAULT_LARGE_SECTION_THRESHOLD 65536

19984

19985

-/* Which processor to tune code generation for. */

19986

+/* Which processor to tune code generation for. These must be in sync

19987

+ with processor_target_table in i386.c. */

19988

19989

enum processor_type

19990

{

19991

- PROCESSOR_I386 = 0, /* 80386 */

19992

+ PROCESSOR_GENERIC32 = 0,

19993

+ PROCESSOR_GENERIC64,

19994

+ PROCESSOR_I386, /* 80386 */

19995

PROCESSOR_I486, /* 80486DX, 80486SX, 80486DX[24] */

19996

PROCESSOR_PENTIUM,

19997

PROCESSOR_PENTIUMPRO,

19998

- PROCESSOR_GEODE,

19999

- PROCESSOR_K6,

20000

- PROCESSOR_ATHLON,

20001

PROCESSOR_PENTIUM4,

20002

- PROCESSOR_K8,

20003

PROCESSOR_NOCONA,

20004

PROCESSOR_CORE2,

20005

PROCESSOR_COREI7,

20006

PROCESSOR_HASWELL,

20007

- PROCESSOR_GENERIC32,

20008

- PROCESSOR_GENERIC64,

20009

+ PROCESSOR_ATOM,

20010

+ PROCESSOR_GEODE,

20011

+ PROCESSOR_K6,

20012

+ PROCESSOR_ATHLON,

20013

+ PROCESSOR_K8,

20014

PROCESSOR_AMDFAM10,

20015

PROCESSOR_BDVER1,

20016

PROCESSOR_BDVER2,

20017

PROCESSOR_BDVER3,

20018

PROCESSOR_BTVER1,

20019

PROCESSOR_BTVER2,

20020

- PROCESSOR_ATOM,

20021

PROCESSOR_max

20022

};

20023

20024

Index: gcc/config/i386/i386.md

20025

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

20026

--- a/src/gcc/config/i386/i386.md (.../tags/gcc_4_8_2_release)

20027

+++ b/src/gcc/config/i386/i386.md (.../branches/gcc-4_8-branch)

20028

@@ -363,6 +363,13 @@

20029

(const_string "unknown")]

20030

(const_string "integer")))

20031

20032

+;; The minimum required alignment of vector mode memory operands of the SSE

20033

+;; (non-VEX/EVEX) instruction in bits, if it is different from

20034

+;; GET_MODE_ALIGNMENT of the operand, otherwise 0. If an instruction has

20035

+;; multiple alternatives, this should be conservative maximum of those minimum

20036

+;; required alignments.

20037

+(define_attr "ssememalign" "" (const_int 0))

20038

+

20039

;; The (bounding maximum) length of an instruction immediate.

20040

(define_attr "length_immediate" ""

20041

(cond [(eq_attr "type" "incdec,setcc,icmov,str,lea,other,multi,idiv,leave,

20042

@@ -1570,7 +1577,7 @@

20043

split_double_mode (DImode, &operands[1], 1, &operands[2], &operands[3]);

20044

20045

operands[1] = gen_lowpart (DImode, operands[2]);

20046

- operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (DImode, stack_pointer_rtx,

20047

+ operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (Pmode, stack_pointer_rtx,

20048

GEN_INT (4)));

20049

})

20050

20051

@@ -1587,7 +1594,7 @@

20052

split_double_mode (DImode, &operands[1], 1, &operands[2], &operands[3]);

20053

20054

operands[1] = gen_lowpart (DImode, operands[2]);

20055

- operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (DImode, stack_pointer_rtx,

20056

+ operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (Pmode, stack_pointer_rtx,

20057

GEN_INT (4)));

20058

})

20059

20060

@@ -6589,7 +6596,7 @@

20061

(set_attr "use_carry" "1")

20062

(set_attr "mode" "<MODE>")])

20063

20064

-;; Overflow setting add and subtract instructions

20065

+;; Overflow setting add instructions

20066

20067

(define_insn "*add<mode>3_cconly_overflow"

20068

[(set (reg:CCC FLAGS_REG)

20069

@@ -6604,43 +6611,31 @@

20070

[(set_attr "type" "alu")

20071

(set_attr "mode" "<MODE>")])

20072

20073

-(define_insn "*sub<mode>3_cconly_overflow"

20074

+(define_insn "*add<mode>3_cc_overflow"

20075

[(set (reg:CCC FLAGS_REG)

20076

(compare:CCC

20077

- (minus:SWI

20078

- (match_operand:SWI 0 "nonimmediate_operand" "<r>m,<r>")

20079

- (match_operand:SWI 1 "<general_operand>" "<r><i>,<r>m"))

20080

- (match_dup 0)))]

20081

- ""

20082

- "cmp{<imodesuffix>}\t{%1, %0|%0, %1}"

20083

- [(set_attr "type" "icmp")

20084

- (set_attr "mode" "<MODE>")])

20085

-

20086

-(define_insn "*<plusminus_insn><mode>3_cc_overflow"

20087

- [(set (reg:CCC FLAGS_REG)

20088

- (compare:CCC

20089

- (plusminus:SWI

20090

- (match_operand:SWI 1 "nonimmediate_operand" "<comm>0,0")

20091

+ (plus:SWI

20092

+ (match_operand:SWI 1 "nonimmediate_operand" "%0,0")

20093

(match_operand:SWI 2 "<general_operand>" "<r><i>,<r>m"))

20094

(match_dup 1)))

20095

(set (match_operand:SWI 0 "nonimmediate_operand" "=<r>m,<r>")

20096

- (plusminus:SWI (match_dup 1) (match_dup 2)))]

20097

- "ix86_binary_operator_ok (<CODE>, <MODE>mode, operands)"

20098

- "<plusminus_mnemonic>{<imodesuffix>}\t{%2, %0|%0, %2}"

20099

+ (plus:SWI (match_dup 1) (match_dup 2)))]

20100

+ "ix86_binary_operator_ok (PLUS, <MODE>mode, operands)"

20101

+ "add{<imodesuffix>}\t{%2, %0|%0, %2}"

20102

[(set_attr "type" "alu")

20103

(set_attr "mode" "<MODE>")])

20104

20105

-(define_insn "*<plusminus_insn>si3_zext_cc_overflow"

20106

+(define_insn "*addsi3_zext_cc_overflow"

20107

[(set (reg:CCC FLAGS_REG)

20108

(compare:CCC

20109

- (plusminus:SI

20110

- (match_operand:SI 1 "nonimmediate_operand" "<comm>0")

20111

+ (plus:SI

20112

+ (match_operand:SI 1 "nonimmediate_operand" "%0")

20113

(match_operand:SI 2 "x86_64_general_operand" "rme"))

20114

(match_dup 1)))

20115

(set (match_operand:DI 0 "register_operand" "=r")

20116

- (zero_extend:DI (plusminus:SI (match_dup 1) (match_dup 2))))]

20117

- "TARGET_64BIT && ix86_binary_operator_ok (<CODE>, SImode, operands)"

20118

- "<plusminus_mnemonic>{l}\t{%2, %k0|%k0, %2}"

20119

+ (zero_extend:DI (plus:SI (match_dup 1) (match_dup 2))))]

20120

+ "TARGET_64BIT && ix86_binary_operator_ok (PLUS, SImode, operands)"

20121

+ "add{l}\t{%2, %k0|%k0, %2}"

20122

[(set_attr "type" "alu")

20123

(set_attr "mode" "SI")])

20124

20125

@@ -8012,7 +8007,18 @@

20126

(const_int 0)))

20127

(set (match_operand:DI 0 "nonimmediate_operand" "=r,r,rm")

20128

(and:DI (match_dup 1) (match_dup 2)))]

20129

- "TARGET_64BIT && ix86_match_ccmode (insn, CCNOmode)

20130

+ "TARGET_64BIT

20131

+ && ix86_match_ccmode

20132

+ (insn,

20133

+ /* If we are going to emit andl instead of andq, and the operands[2]

20134

+ constant might have the SImode sign bit set, make sure the sign

20135

+ flag isn't tested, because the instruction will set the sign flag

20136

+ based on bit 31 rather than bit 63. If it isn't CONST_INT,

20137

+ conservatively assume it might have bit 31 set. */

20138

+ (satisfies_constraint_Z (operands[2])

20139

+ && (!CONST_INT_P (operands[2])

20140

+ || val_signbit_known_set_p (SImode, INTVAL (operands[2]))))

20141

+ ? CCZmode : CCNOmode)

20142

&& ix86_binary_operator_ok (AND, DImode, operands)"

20143

"@

20144

and{l}\t{%k2, %k0|%k0, %k2}

20145

Index: gcc/config/i386/t-rtems

20146

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

20147

--- a/src/gcc/config/i386/t-rtems (.../tags/gcc_4_8_2_release)

20148

+++ b/src/gcc/config/i386/t-rtems (.../branches/gcc-4_8-branch)

20149

@@ -17,11 +17,10 @@

20150

# <http://www.gnu.org/licenses/>.

20151

#

20152

20153

-MULTILIB_OPTIONS = mtune=i486/mtune=pentium/mtune=pentiumpro \

20154

-msoft-float

20155

+MULTILIB_OPTIONS = mtune=i486/mtune=pentium/mtune=pentiumpro msoft-float

20156

MULTILIB_DIRNAMES= m486 mpentium mpentiumpro soft-float

20157

-MULTILIB_MATCHES = msoft-float=mno-m80387

20158

-MULTILIB_MATCHES += mtune?pentium=mtune?k6 mtune?pentiumpro=mtune?mathlon

20159

+MULTILIB_MATCHES = msoft-float=mno-80387

20160

+MULTILIB_MATCHES += mtune?pentium=mtune?k6 mtune?pentiumpro=mtune?athlon

20161

MULTILIB_EXCEPTIONS = \

20162

mtune=pentium/*msoft-float* \

20163

mtune=pentiumpro/*msoft-float*

20164

Index: gcc/config/i386/winnt.c

20165

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

20166

--- a/src/gcc/config/i386/winnt.c (.../tags/gcc_4_8_2_release)

20167

+++ b/src/gcc/config/i386/winnt.c (.../branches/gcc-4_8-branch)

20168

@@ -547,8 +547,9 @@

20169

sets 'discard' characteristic, rather than telling linker

20170

to warn of size or content mismatch, so do the same. */

20171

bool discard = (flags & SECTION_CODE)

20172

- || lookup_attribute ("selectany",

20173

- DECL_ATTRIBUTES (decl));

20174

+ || (TREE_CODE (decl) != IDENTIFIER_NODE

20175

+ && lookup_attribute ("selectany",

20176

+ DECL_ATTRIBUTES (decl)));

20177

fprintf (asm_out_file, "\t.linkonce %s\n",

20178

(discard ? "discard" : "same_size"));

20179

}

20180

Index: gcc/config/i386/sse.md

20181

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

20182

--- a/src/gcc/config/i386/sse.md (.../tags/gcc_4_8_2_release)

20183

+++ b/src/gcc/config/i386/sse.md (.../branches/gcc-4_8-branch)

20184

@@ -605,6 +605,7 @@

20185

}

20186

[(set_attr "type" "ssemov")

20187

(set_attr "movu" "1")

20188

+ (set_attr "ssememalign" "8")

20189

(set_attr "prefix" "maybe_vex")

20190

(set (attr "mode")

20191

(cond [(match_test "TARGET_SSE_PACKED_SINGLE_INSN_OPTIMAL")

20192

@@ -634,6 +635,7 @@

20193

}

20194

[(set_attr "type" "ssemov")

20195

(set_attr "movu" "1")

20196

+ (set_attr "ssememalign" "8")

20197

(set_attr "prefix" "maybe_vex")

20198

(set (attr "mode")

20199

(cond [(ior (match_test "TARGET_SSE_PACKED_SINGLE_INSN_OPTIMAL")

20200

@@ -663,6 +665,7 @@

20201

}

20202

[(set_attr "type" "ssemov")

20203

(set_attr "movu" "1")

20204

+ (set_attr "ssememalign" "8")

20205

(set (attr "prefix_data16")

20206

(if_then_else

20207

(match_test "TARGET_AVX")

20208

@@ -696,6 +699,7 @@

20209

}

20210

[(set_attr "type" "ssemov")

20211

(set_attr "movu" "1")

20212

+ (set_attr "ssememalign" "8")

20213

(set (attr "prefix_data16")

20214

(if_then_else

20215

(match_test "TARGET_AVX")

20216

@@ -721,6 +725,7 @@

20217

"%vlddqu\t{%1, %0|%0, %1}"

20218

[(set_attr "type" "ssemov")

20219

(set_attr "movu" "1")

20220

+ (set_attr "ssememalign" "8")

20221

(set (attr "prefix_data16")

20222

(if_then_else

20223

(match_test "TARGET_AVX")

20224

@@ -1001,6 +1006,7 @@

20225

vrcpss\t{%1, %2, %0|%0, %2, %1}"

20226

[(set_attr "isa" "noavx,avx")

20227

(set_attr "type" "sse")

20228

+ (set_attr "ssememalign" "32")

20229

(set_attr "atom_sse_attr" "rcp")

20230

(set_attr "btver2_sse_attr" "rcp")

20231

(set_attr "prefix" "orig,vex")

20232

@@ -1089,6 +1095,7 @@

20233

vrsqrtss\t{%1, %2, %0|%0, %2, %1}"

20234

[(set_attr "isa" "noavx,avx")

20235

(set_attr "type" "sse")

20236

+ (set_attr "ssememalign" "32")

20237

(set_attr "prefix" "orig,vex")

20238

(set_attr "mode" "SF")])

20239

20240

@@ -2844,6 +2851,7 @@

20241

"%vcvtdq2pd\t{%1, %0|%0, %q1}"

20242

[(set_attr "type" "ssecvt")

20243

(set_attr "prefix" "maybe_vex")

20244

+ (set_attr "ssememalign" "64")

20245

(set_attr "mode" "V2DF")])

20246

20247

(define_insn "avx_cvtpd2dq256"

20248

@@ -3572,6 +3580,7 @@

20249

%vmovhps\t{%2, %0|%0, %2}"

20250

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20251

(set_attr "type" "ssemov")

20252

+ (set_attr "ssememalign" "64")

20253

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20254

(set_attr "mode" "V4SF,V4SF,V2SF,V2SF,V2SF")])

20255

20256

@@ -3617,6 +3626,7 @@

20257

%vmovlps\t{%2, %H0|%H0, %2}"

20258

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20259

(set_attr "type" "ssemov")

20260

+ (set_attr "ssememalign" "64")

20261

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20262

(set_attr "mode" "V4SF,V4SF,V2SF,V2SF,V2SF")])

20263

20264

@@ -3941,6 +3951,7 @@

20265

%vmovhlps\t{%1, %d0|%d0, %1}

20266

%vmovlps\t{%H1, %d0|%d0, %H1}"

20267

[(set_attr "type" "ssemov")

20268

+ (set_attr "ssememalign" "64")

20269

(set_attr "prefix" "maybe_vex")

20270

(set_attr "mode" "V2SF,V4SF,V2SF")])

20271

20272

@@ -3980,6 +3991,7 @@

20273

%vmovlps\t{%2, %H0|%H0, %2}"

20274

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20275

(set_attr "type" "ssemov")

20276

+ (set_attr "ssememalign" "64")

20277

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20278

(set_attr "mode" "V2SF,V2SF,V4SF,V4SF,V2SF")])

20279

20280

@@ -4033,6 +4045,7 @@

20281

%vmovlps\t{%2, %0|%0, %2}"

20282

[(set_attr "isa" "noavx,avx,noavx,avx,*")

20283

(set_attr "type" "sseshuf,sseshuf,ssemov,ssemov,ssemov")

20284

+ (set_attr "ssememalign" "64")

20285

(set_attr "length_immediate" "1,1,*,*,*")

20286

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex")

20287

(set_attr "mode" "V4SF,V4SF,V2SF,V2SF,V2SF")])

20288

@@ -4642,7 +4655,8 @@

20289

vmovlpd\t{%H1, %2, %0|%0, %2, %H1}

20290

%vmovhpd\t{%1, %0|%0, %1}"

20291

[(set_attr "isa" "noavx,avx,sse3,noavx,avx,*")

20292

- (set_attr "type" "sselog,sselog,sselog,ssemov,ssemov,ssemov")

20293

+ (set_attr "type" "sselog,sselog,sselog,ssemov,ssemov,ssemov")

20294

+ (set_attr "ssememalign" "64")

20295

(set_attr "prefix_data16" "*,*,*,1,*,1")

20296

(set_attr "prefix" "orig,vex,maybe_vex,orig,vex,maybe_vex")

20297

(set_attr "mode" "V2DF,V2DF,DF,V1DF,V1DF,V1DF")])

20298

@@ -4744,6 +4758,7 @@

20299

%vmovlpd\t{%2, %H0|%H0, %2}"

20300

[(set_attr "isa" "noavx,avx,sse3,noavx,avx,*")

20301

(set_attr "type" "sselog,sselog,sselog,ssemov,ssemov,ssemov")

20302

+ (set_attr "ssememalign" "64")

20303

(set_attr "prefix_data16" "*,*,*,1,*,1")

20304

(set_attr "prefix" "orig,vex,maybe_vex,orig,vex,maybe_vex")

20305

(set_attr "mode" "V2DF,V2DF,DF,V1DF,V1DF,V1DF")])

20306

@@ -4982,6 +4997,7 @@

20307

movhlps\t{%1, %0|%0, %1}

20308

movlps\t{%H1, %0|%0, %H1}"

20309

[(set_attr "type" "ssemov")

20310

+ (set_attr "ssememalign" "64")

20311

(set_attr "mode" "V2SF,V4SF,V2SF")])

20312

20313

;; Avoid combining registers from different units in a single alternative,

20314

@@ -5077,6 +5093,7 @@

20315

#"

20316

[(set_attr "isa" "noavx,avx,noavx,avx,*,*,*")

20317

(set_attr "type" "ssemov,ssemov,sselog,sselog,ssemov,fmov,imov")

20318

+ (set_attr "ssememalign" "64")

20319

(set_attr "prefix_data16" "1,*,*,*,*,*,*")

20320

(set_attr "prefix" "orig,vex,orig,vex,*,*,*")

20321

(set_attr "mode" "V1DF,V1DF,V2DF,V2DF,DF,DF,DF")])

20322

@@ -5145,6 +5162,7 @@

20323

(const_string "imov")

20324

]

20325

(const_string "ssemov")))

20326

+ (set_attr "ssememalign" "64")

20327

(set_attr "prefix_data16" "*,1,*,*,*,*,1,*,*,*,*")

20328

(set_attr "length_immediate" "*,*,*,*,*,1,*,*,*,*,*")

20329

(set_attr "prefix" "maybe_vex,orig,vex,orig,vex,orig,orig,vex,*,*,*")

20330

@@ -5189,6 +5207,7 @@

20331

(const_string "1")

20332

(const_string "*")))

20333

(set_attr "length_immediate" "*,*,*,*,*,1,*,*,*")

20334

+ (set_attr "ssememalign" "64")

20335

(set_attr "prefix" "orig,vex,orig,vex,maybe_vex,orig,orig,vex,maybe_vex")

20336

(set_attr "mode" "DF,DF,V1DF,V1DF,V1DF,V2DF,V1DF,V1DF,V1DF")])

20337

20338

@@ -8736,6 +8755,7 @@

20339

"TARGET_SSE4_1"

20340

"%vpmov<extsuffix>bw\t{%1, %0|%0, %q1}"

20341

[(set_attr "type" "ssemov")

20342

+ (set_attr "ssememalign" "64")

20343

(set_attr "prefix_extra" "1")

20344

(set_attr "prefix" "maybe_vex")

20345

(set_attr "mode" "TI")])

20346

@@ -8766,6 +8786,7 @@

20347

"TARGET_SSE4_1"

20348

"%vpmov<extsuffix>bd\t{%1, %0|%0, %k1}"

20349

[(set_attr "type" "ssemov")

20350

+ (set_attr "ssememalign" "32")

20351

(set_attr "prefix_extra" "1")

20352

(set_attr "prefix" "maybe_vex")

20353

(set_attr "mode" "TI")])

20354

@@ -8791,6 +8812,7 @@

20355

"TARGET_SSE4_1"

20356

"%vpmov<extsuffix>wd\t{%1, %0|%0, %q1}"

20357

[(set_attr "type" "ssemov")

20358

+ (set_attr "ssememalign" "64")

20359

(set_attr "prefix_extra" "1")

20360

(set_attr "prefix" "maybe_vex")

20361

(set_attr "mode" "TI")])

20362

@@ -8818,6 +8840,7 @@

20363

"TARGET_SSE4_1"

20364

"%vpmov<extsuffix>bq\t{%1, %0|%0, %w1}"

20365

[(set_attr "type" "ssemov")

20366

+ (set_attr "ssememalign" "16")

20367

(set_attr "prefix_extra" "1")

20368

(set_attr "prefix" "maybe_vex")

20369

(set_attr "mode" "TI")])

20370

@@ -8845,6 +8868,7 @@

20371

"TARGET_SSE4_1"

20372

"%vpmov<extsuffix>wq\t{%1, %0|%0, %k1}"

20373

[(set_attr "type" "ssemov")

20374

+ (set_attr "ssememalign" "32")

20375

(set_attr "prefix_extra" "1")

20376

(set_attr "prefix" "maybe_vex")

20377

(set_attr "mode" "TI")])

20378

@@ -8868,6 +8892,7 @@

20379

"TARGET_SSE4_1"

20380

"%vpmov<extsuffix>dq\t{%1, %0|%0, %q1}"

20381

[(set_attr "type" "ssemov")

20382

+ (set_attr "ssememalign" "64")

20383

(set_attr "prefix_extra" "1")

20384

(set_attr "prefix" "maybe_vex")

20385

(set_attr "mode" "TI")])

20386

@@ -9151,6 +9176,7 @@

20387

[(set_attr "type" "sselog")

20388

(set_attr "prefix_data16" "1")

20389

(set_attr "prefix_extra" "1")

20390

+ (set_attr "ssememalign" "8")

20391

(set_attr "length_immediate" "1")

20392

(set_attr "memory" "none,load")

20393

(set_attr "mode" "TI")])

20394

@@ -9213,6 +9239,7 @@

20395

[(set_attr "type" "sselog")

20396

(set_attr "prefix_data16" "1")

20397

(set_attr "prefix_extra" "1")

20398

+ (set_attr "ssememalign" "8")

20399

(set_attr "length_immediate" "1")

20400

(set_attr "memory" "load")

20401

(set_attr "mode" "TI")])

20402

@@ -9240,6 +9267,7 @@

20403

(set_attr "prefix_data16" "1")

20404

(set_attr "prefix_extra" "1")

20405

(set_attr "prefix" "maybe_vex")

20406

+ (set_attr "ssememalign" "8")

20407

(set_attr "length_immediate" "1")

20408

(set_attr "btver2_decode" "vector")

20409

(set_attr "memory" "none,load")

20410

@@ -9267,6 +9295,7 @@

20411

[(set_attr "type" "sselog")

20412

(set_attr "prefix_data16" "1")

20413

(set_attr "prefix_extra" "1")

20414

+ (set_attr "ssememalign" "8")

20415

(set_attr "length_immediate" "1")

20416

(set_attr "prefix" "maybe_vex")

20417

(set_attr "btver2_decode" "vector")

20418

@@ -9293,6 +9322,7 @@

20419

[(set_attr "type" "sselog")

20420

(set_attr "prefix_data16" "1")

20421

(set_attr "prefix_extra" "1")

20422

+ (set_attr "ssememalign" "8")

20423

(set_attr "length_immediate" "1")

20424

(set_attr "memory" "none,load,none,load")

20425

(set_attr "btver2_decode" "vector,vector,vector,vector")

20426

@@ -9346,6 +9376,7 @@

20427

[(set_attr "type" "sselog")

20428

(set_attr "prefix_data16" "1")

20429

(set_attr "prefix_extra" "1")

20430

+ (set_attr "ssememalign" "8")

20431

(set_attr "length_immediate" "1")

20432

(set_attr "memory" "none,load")

20433

(set_attr "mode" "TI")])

20434

@@ -9399,6 +9430,7 @@

20435

[(set_attr "type" "sselog")

20436

(set_attr "prefix_data16" "1")

20437

(set_attr "prefix_extra" "1")

20438

+ (set_attr "ssememalign" "8")

20439

(set_attr "length_immediate" "1")

20440

(set_attr "memory" "load")

20441

(set_attr "mode" "TI")])

20442

@@ -9421,6 +9453,7 @@

20443

[(set_attr "type" "sselog")

20444

(set_attr "prefix_data16" "1")

20445

(set_attr "prefix_extra" "1")

20446

+ (set_attr "ssememalign" "8")

20447

(set_attr "length_immediate" "1")

20448

(set_attr "prefix" "maybe_vex")

20449

(set_attr "memory" "none,load")

20450

@@ -9445,6 +9478,7 @@

20451

[(set_attr "type" "sselog")

20452

(set_attr "prefix_data16" "1")

20453

(set_attr "prefix_extra" "1")

20454

+ (set_attr "ssememalign" "8")

20455

(set_attr "length_immediate" "1")

20456

(set_attr "prefix" "maybe_vex")

20457

(set_attr "memory" "none,load")

20458

@@ -9469,6 +9503,7 @@

20459

[(set_attr "type" "sselog")

20460

(set_attr "prefix_data16" "1")

20461

(set_attr "prefix_extra" "1")

20462

+ (set_attr "ssememalign" "8")

20463

(set_attr "length_immediate" "1")

20464

(set_attr "memory" "none,load,none,load")

20465

(set_attr "prefix" "maybe_vex")

20466

@@ -10213,7 +10248,6 @@

20467

[(set_attr "type" "ssecvt1")

20468

(set_attr "mode" "<MODE>")])

20469

20470

-;; scalar insns

20471

(define_expand "xop_vmfrcz<mode>2"

20472

[(set (match_operand:VF_128 0 "register_operand")

20473

(vec_merge:VF_128

20474

@@ -10223,11 +10257,9 @@

20475

(match_dup 3)

20476

(const_int 1)))]

20477

"TARGET_XOP"

20478

-{

20479

- operands[3] = CONST0_RTX (<MODE>mode);

20480

-})

20481

+ "operands[3] = CONST0_RTX (<MODE>mode);")

20482

20483

-(define_insn "*xop_vmfrcz_<mode>"

20484

+(define_insn "*xop_vmfrcz<mode>2"

20485

[(set (match_operand:VF_128 0 "register_operand" "=x")

20486

(vec_merge:VF_128

20487

(unspec:VF_128

20488

Index: gcc/config/i386/xopintrin.h

20489

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

20490

--- a/src/gcc/config/i386/xopintrin.h (.../tags/gcc_4_8_2_release)

20491

+++ b/src/gcc/config/i386/xopintrin.h (.../branches/gcc-4_8-branch)

20492

@@ -745,13 +745,17 @@

20493

extern __inline __m128 __attribute__((__gnu_inline__, __always_inline__, __artificial__))

20494

_mm_frcz_ss (__m128 __A, __m128 __B)

20495

{

20496

- return (__m128) __builtin_ia32_vfrczss ((__v4sf)__A, (__v4sf)__B);

20497

+ return (__m128) __builtin_ia32_movss ((__v4sf)__A,

20498

+ (__v4sf)

20499

+ __builtin_ia32_vfrczss ((__v4sf)__B));

20500

}

20501

20502

extern __inline __m128d __attribute__((__gnu_inline__, __always_inline__, __artificial__))

20503

_mm_frcz_sd (__m128d __A, __m128d __B)

20504

{

20505

- return (__m128d) __builtin_ia32_vfrczsd ((__v2df)__A, (__v2df)__B);

20506

+ return (__m128d) __builtin_ia32_movsd ((__v2df)__A,

20507

+ (__v2df)

20508

+ __builtin_ia32_vfrczsd ((__v2df)__B));

20509

}

20510

20511

extern __inline __m256 __attribute__((__gnu_inline__, __always_inline__, __artificial__))

20512

Index: gcc/config/i386/driver-i386.c

20513

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

20514

--- a/src/gcc/config/i386/driver-i386.c (.../tags/gcc_4_8_2_release)

20515

+++ b/src/gcc/config/i386/driver-i386.c (.../branches/gcc-4_8-branch)

20516

@@ -126,6 +126,18 @@

20517

case 0x0c:

20518

level1->sizekb = 16; level1->assoc = 4; level1->line = 32;

20519

break;

20520

+ case 0x0d:

20521

+ level1->sizekb = 16; level1->assoc = 4; level1->line = 64;

20522

+ break;

20523

+ case 0x0e:

20524

+ level1->sizekb = 24; level1->assoc = 6; level1->line = 64;

20525

+ break;

20526

+ case 0x21:

20527

+ level2->sizekb = 256; level2->assoc = 8; level2->line = 64;

20528

+ break;

20529

+ case 0x24:

20530

+ level2->sizekb = 1024; level2->assoc = 16; level2->line = 64;

20531

+ break;

20532

case 0x2c:

20533

level1->sizekb = 32; level1->assoc = 8; level1->line = 64;

20534

break;

20535

@@ -162,6 +174,9 @@

20536

case 0x45:

20537

level2->sizekb = 2048; level2->assoc = 4; level2->line = 32;

20538

break;

20539

+ case 0x48:

20540

+ level2->sizekb = 3072; level2->assoc = 12; level2->line = 64;

20541

+ break;

20542

case 0x49:

20543

if (xeon_mp)

20544

break;

20545

@@ -203,6 +218,9 @@

20546

case 0x7f:

20547

level2->sizekb = 512; level2->assoc = 2; level2->line = 64;

20548

break;

20549

+ case 0x80:

20550

+ level2->sizekb = 512; level2->assoc = 8; level2->line = 64;

20551

+ break;

20552

case 0x82:

20553

level2->sizekb = 256; level2->assoc = 8; level2->line = 32;

20554

break;

20555

Index: gcc/config/i386/i386.c

20556

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

20557

--- a/src/gcc/config/i386/i386.c (.../tags/gcc_4_8_2_release)

20558

+++ b/src/gcc/config/i386/i386.c (.../branches/gcc-4_8-branch)

20559

@@ -1378,7 +1378,7 @@

20560

8, /* MMX or SSE register to integer */

20561

8, /* size of l1 cache. */

20562

1024, /* size of l2 cache. */

20563

- 128, /* size of prefetch block */

20564

+ 64, /* size of prefetch block */

20565

8, /* number of parallel prefetches */

20566

1, /* Branch cost */

20567

COSTS_N_INSNS (6), /* cost of FADD and FSUB insns. */

20568

@@ -1894,10 +1894,10 @@

20569

20570

20571

/* X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL */

20572

- m_COREI7 | m_AMDFAM10 | m_BDVER | m_BTVER,

20573

+ m_COREI7 | m_HASWELL | m_AMDFAM10 | m_BDVER | m_BTVER,

20574

20575

/* X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL */

20576

- m_COREI7 | m_BDVER,

20577

+ m_COREI7 | m_HASWELL| m_BDVER,

20578

20579

/* X86_TUNE_SSE_PACKED_SINGLE_INSN_OPTIMAL */

20580

m_BDVER ,

20581

@@ -2409,6 +2409,7 @@

20582

/* Processor target table, indexed by processor number */

20583

struct ptt

20584

{

20585

+ const char *const name; /* processor name */

20586

const struct processor_costs *cost; /* Processor costs */

20587

const int align_loop; /* Default alignments. */

20588

const int align_loop_max_skip;

20589

@@ -2417,67 +2418,32 @@

20590

const int align_func;

20591

};

20592

20593

+/* This table must be in sync with enum processor_type in i386.h. */

20594

static const struct ptt processor_target_table[PROCESSOR_max] =

20595

{

20596

- {&i386_cost, 4, 3, 4, 3, 4},

20597

- {&i486_cost, 16, 15, 16, 15, 16},

20598

- {&pentium_cost, 16, 7, 16, 7, 16},

20599

- {&pentiumpro_cost, 16, 15, 16, 10, 16},

20600

- {&geode_cost, 0, 0, 0, 0, 0},

20601

- {&k6_cost, 32, 7, 32, 7, 32},

20602

- {&athlon_cost, 16, 7, 16, 7, 16},

20603

- {&pentium4_cost, 0, 0, 0, 0, 0},

20604

- {&k8_cost, 16, 7, 16, 7, 16},

20605

- {&nocona_cost, 0, 0, 0, 0, 0},

20606

- /* Core 2 */

20607

- {&core_cost, 16, 10, 16, 10, 16},

20608

- /* Core i7 */

20609

- {&core_cost, 16, 10, 16, 10, 16},

20610

- /* Core avx2 */

20611

- {&core_cost, 16, 10, 16, 10, 16},

20612

- {&generic32_cost, 16, 7, 16, 7, 16},

20613

- {&generic64_cost, 16, 10, 16, 10, 16},

20614

- {&amdfam10_cost, 32, 24, 32, 7, 32},

20615

- {&bdver1_cost, 16, 10, 16, 7, 11},

20616

- {&bdver2_cost, 16, 10, 16, 7, 11},

20617

- {&bdver3_cost, 16, 10, 16, 7, 11},

20618

- {&btver1_cost, 16, 10, 16, 7, 11},

20619

- {&btver2_cost, 16, 10, 16, 7, 11},

20620

- {&atom_cost, 16, 15, 16, 7, 16}

20621

+ {"generic", &generic32_cost, 16, 7, 16, 7, 16},

20622

+ {"generic", &generic64_cost, 16, 10, 16, 10, 16},

20623

+ {"i386", &i386_cost, 4, 3, 4, 3, 4},

20624

+ {"i486", &i486_cost, 16, 15, 16, 15, 16},

20625

+ {"pentium", &pentium_cost, 16, 7, 16, 7, 16},

20626

+ {"pentiumpro", &pentiumpro_cost, 16, 15, 16, 10, 16},

20627

+ {"pentium4", &pentium4_cost, 0, 0, 0, 0, 0},

20628

+ {"nocona", &nocona_cost, 0, 0, 0, 0, 0},

20629

+ {"core2", &core_cost, 16, 10, 16, 10, 16},

20630

+ {"corei7", &core_cost, 16, 10, 16, 10, 16},

20631

+ {"core-avx2", &core_cost, 16, 10, 16, 10, 16},

20632

+ {"atom", &atom_cost, 16, 15, 16, 7, 16},

20633

+ {"geode", &geode_cost, 0, 0, 0, 0, 0},

20634

+ {"k6", &k6_cost, 32, 7, 32, 7, 32},

20635

+ {"athlon", &athlon_cost, 16, 7, 16, 7, 16},

20636

+ {"k8", &k8_cost, 16, 7, 16, 7, 16},

20637

+ {"amdfam10", &amdfam10_cost, 32, 24, 32, 7, 32},

20638

+ {"bdver1", &bdver1_cost, 16, 10, 16, 7, 11},

20639

+ {"bdver2", &bdver2_cost, 16, 10, 16, 7, 11},

20640

+ {"bdver3", &bdver3_cost, 16, 10, 16, 7, 11},

20641

+ {"btver1", &btver1_cost, 16, 10, 16, 7, 11},

20642

+ {"btver2", &btver2_cost, 16, 10, 16, 7, 11}

20643

};

20644

-

20645

-static const char *const cpu_names[TARGET_CPU_DEFAULT_max] =

20646

-{

20647

- "generic",

20648

- "i386",

20649

- "i486",

20650

- "pentium",

20651

- "pentium-mmx",

20652

- "pentiumpro",

20653

- "pentium2",

20654

- "pentium3",

20655

- "pentium4",

20656

- "pentium-m",

20657

- "prescott",

20658

- "nocona",

20659

- "core2",

20660

- "corei7",

20661

- "core-avx2",

20662

- "atom",

20663

- "geode",

20664

- "k6",

20665

- "k6-2",

20666

- "k6-3",

20667

- "athlon",

20668

- "athlon-4",

20669

- "k8",

20670

- "amdfam10",

20671

- "bdver1",

20672

- "bdver2",

20673

- "bdver3",

20674

- "btver1",

20675

- "btver2"

20676

-};

20677

20678

static bool

20679

gate_insert_vzeroupper (void)

20680

@@ -2983,7 +2949,7 @@

20681

{"bdver3", PROCESSOR_BDVER3, CPU_BDVER3,

20682

PTA_64BIT | PTA_MMX | PTA_SSE | PTA_SSE2 | PTA_SSE3

20683

20684

- | PTA_SSE4_2 | PTA_AES | PTA_PCLMUL | PTA_AVX

20685

20686

20687

| PTA_FMA | PTA_PRFCHW | PTA_FXSR | PTA_XSAVE

20688

| PTA_XSAVEOPT},

20689

@@ -3125,7 +3091,8 @@

20690

ix86_tune_string = ix86_arch_string;

20691

if (!ix86_tune_string)

20692

{

20693

- ix86_tune_string = cpu_names[TARGET_CPU_DEFAULT];

20694

+ ix86_tune_string

20695

+ = processor_target_table[TARGET_CPU_DEFAULT].name;

20696

ix86_tune_defaulted = 1;

20697

}

20698

20699

@@ -4078,19 +4045,15 @@

20700

= ix86_target_string (ptr->x_ix86_isa_flags, ptr->x_target_flags,

20701

NULL, NULL, ptr->x_ix86_fpmath, false);

20702

20703

+ gcc_assert (ptr->arch < PROCESSOR_max);

20704

fprintf (file, "%*sarch = %d (%s)\n",

20705

indent, "",

20706

- ptr->arch,

20707

- ((ptr->arch < TARGET_CPU_DEFAULT_max)

20708

- ? cpu_names[ptr->arch]

20709

- : "<unknown>"));

20710

+ ptr->arch, processor_target_table[ptr->arch].name);

20711

20712

+ gcc_assert (ptr->tune < PROCESSOR_max);

20713

fprintf (file, "%*stune = %d (%s)\n",

20714

indent, "",

20715

- ptr->tune,

20716

- ((ptr->tune < TARGET_CPU_DEFAULT_max)

20717

- ? cpu_names[ptr->tune]

20718

- : "<unknown>"));

20719

+ ptr->tune, processor_target_table[ptr->tune].name);

20720

20721

fprintf (file, "%*sbranch_cost = %d\n", indent, "", ptr->branch_cost);

20722

20723

@@ -5409,6 +5372,17 @@

20724

bool win;

20725

int j;

20726

20727

+ /* For pre-AVX disallow unaligned loads/stores where the

20728

+ instructions don't support it. */

20729

+ if (!TARGET_AVX

20730

+ && VECTOR_MODE_P (GET_MODE (op))

20731

+ && misaligned_operand (op, GET_MODE (op)))

20732

+ {

20733

+ int min_align = get_attr_ssememalign (insn);

20734

+ if (min_align == 0)

20735

+ return false;

20736

+ }

20737

+

20738

/* A unary operator may be accepted by the predicate, but it

20739

is irrelevant for matching constraints. */

20740

if (UNARY_P (op))

20741

@@ -5830,7 +5804,8 @@

20742

}

20743

return TYPE_MODE (type);

20744

}

20745

- else if ((size == 8 || size == 16) && !TARGET_SSE)

20746

+ else if (((size == 8 && TARGET_64BIT) || size == 16)

20747

+ && !TARGET_SSE)

20748

{

20749

static bool warnedsse;

20750

20751

@@ -5842,10 +5817,21 @@

20752

warning (0, "SSE vector argument without SSE "

20753

"enabled changes the ABI");

20754

}

20755

- return mode;

20756

}

20757

- else

20758

- return mode;

20759

+ else if ((size == 8 && !TARGET_64BIT) && !TARGET_MMX)

20760

+ {

20761

+ static bool warnedmmx;

20762

+

20763

+ if (cum

20764

+ && !warnedmmx

20765

+ && cum->warn_mmx)

20766

+ {

20767

+ warnedmmx = true;

20768

+ warning (0, "MMX vector argument without MMX "

20769

+ "enabled changes the ABI");

20770

+ }

20771

+ }

20772

+ return mode;

20773

}

20774

20775

gcc_unreachable ();

20776

@@ -7235,9 +7221,15 @@

20777

switch (regno)

20778

{

20779

case AX_REG:

20780

+ case DX_REG:

20781

return true;

20782

+ case DI_REG:

20783

+ case SI_REG:

20784

+ return TARGET_64BIT && ix86_abi != MS_ABI;

20785

20786

- case FIRST_FLOAT_REG:

20787

+ /* Complex values are returned in %st(0)/%st(1) pair. */

20788

+ case ST0_REG:

20789

+ case ST1_REG:

20790

/* TODO: The function should depend on current function ABI but

20791

builtins.c would need updating then. Therefore we use the

20792

default ABI. */

20793

@@ -7245,10 +7237,12 @@

20794

return false;

20795

return TARGET_FLOAT_RETURNS_IN_80387;

20796

20797

- case FIRST_SSE_REG:

20798

+ /* Complex values are returned in %xmm0/%xmm1 pair. */

20799

+ case XMM0_REG:

20800

+ case XMM1_REG:

20801

return TARGET_SSE;

20802

20803

- case FIRST_MMX_REG:

20804

+ case MM0_REG:

20805

if (TARGET_MACHO || TARGET_64BIT)

20806

return false;

20807

return TARGET_MMX;

20808

@@ -10560,18 +10554,21 @@

20809

}

20810

m->fs.sp_offset += allocate;

20811

20812

+ /* Use stack_pointer_rtx for relative addressing so that code

20813

+ works for realigned stack, too. */

20814

if (r10_live && eax_live)

20815

{

20816

- t = choose_baseaddr (m->fs.sp_offset - allocate);

20817

+ t = plus_constant (Pmode, stack_pointer_rtx, allocate);

20818

emit_move_insn (gen_rtx_REG (word_mode, R10_REG),

20819

gen_frame_mem (word_mode, t));

20820

- t = choose_baseaddr (m->fs.sp_offset - allocate - UNITS_PER_WORD);

20821

+ t = plus_constant (Pmode, stack_pointer_rtx,

20822

+ allocate - UNITS_PER_WORD);

20823

emit_move_insn (gen_rtx_REG (word_mode, AX_REG),

20824

gen_frame_mem (word_mode, t));

20825

}

20826

else if (eax_live || r10_live)

20827

{

20828

- t = choose_baseaddr (m->fs.sp_offset - allocate);

20829

+ t = plus_constant (Pmode, stack_pointer_rtx, allocate);

20830

emit_move_insn (gen_rtx_REG (word_mode,

20831

(eax_live ? AX_REG : R10_REG)),

20832

gen_frame_mem (word_mode, t));

20833

@@ -11561,30 +11558,6 @@

20834

}

20835

}

20836

20837

-/* Determine if op is suitable SUBREG RTX for address. */

20838

-

20839

-static bool

20840

-ix86_address_subreg_operand (rtx op)

20841

-{

20842

- enum machine_mode mode;

20843

-

20844

- if (!REG_P (op))

20845

- return false;

20846

-

20847

- mode = GET_MODE (op);

20848

-

20849

- if (GET_MODE_CLASS (mode) != MODE_INT)

20850

- return false;

20851

-

20852

- /* Don't allow SUBREGs that span more than a word. It can lead to spill

20853

- failures when the register is one word out of a two word structure. */

20854

- if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)

20855

- return false;

20856

-

20857

- /* Allow only SUBREGs of non-eliminable hard registers. */

20858

- return register_no_elim_operand (op, mode);

20859

-}

20860

-

20861

/* Extract the parts of an RTL expression that is a valid memory address

20862

for an instruction. Return 0 if the structure of the address is

20863

grossly off. Return -1 if the address contains ASHIFT, so it is not

20864

@@ -11641,7 +11614,7 @@

20865

base = addr;

20866

else if (GET_CODE (addr) == SUBREG)

20867

{

20868

- if (ix86_address_subreg_operand (SUBREG_REG (addr)))

20869

+ if (REG_P (SUBREG_REG (addr)))

20870

base = addr;

20871

else

20872

return 0;

20873

@@ -11705,7 +11678,7 @@

20874

break;

20875

20876

case SUBREG:

20877

- if (!ix86_address_subreg_operand (SUBREG_REG (op)))

20878

+ if (!REG_P (SUBREG_REG (op)))

20879

return 0;

20880

/* FALLTHRU */

20881

20882

@@ -11750,19 +11723,6 @@

20883

scale = 1 << scale;

20884

retval = -1;

20885

}

20886

- else if (CONST_INT_P (addr))

20887

- {

20888

- if (!x86_64_immediate_operand (addr, VOIDmode))

20889

- return 0;

20890

-

20891

- /* Constant addresses are sign extended to 64bit, we have to

20892

- prevent addresses from 0x80000000 to 0xffffffff in x32 mode. */

20893

- if (TARGET_X32

20894

- && val_signbit_known_set_p (SImode, INTVAL (addr)))

20895

- return 0;

20896

-

20897

- disp = addr;

20898

- }

20899

else

20900

disp = addr; /* displacement */

20901

20902

@@ -11771,18 +11731,12 @@

20903

if (REG_P (index))

20904

;

20905

else if (GET_CODE (index) == SUBREG

20906

- && ix86_address_subreg_operand (SUBREG_REG (index)))

20907

+ && REG_P (SUBREG_REG (index)))

20908

;

20909

else

20910

return 0;

20911

}

20912

20913

-/* Address override works only on the (%reg) part of %fs:(%reg). */

20914

- if (seg != SEG_DEFAULT

20915

- && ((base && GET_MODE (base) != word_mode)

20916

- || (index && GET_MODE (index) != word_mode)))

20917

- return 0;

20918

-

20919

/* Extract the integral value of scale. */

20920

if (scale_rtx)

20921

{

20922

@@ -12258,6 +12212,45 @@

20923

return false;

20924

}

20925

20926

+/* Determine if op is suitable RTX for an address register.

20927

+ Return naked register if a register or a register subreg is

20928

+ found, otherwise return NULL_RTX. */

20929

+

20930

+static rtx

20931

+ix86_validate_address_register (rtx op)

20932

+{

20933

+ enum machine_mode mode = GET_MODE (op);

20934

+

20935

+ /* Only SImode or DImode registers can form the address. */

20936

+ if (mode != SImode && mode != DImode)

20937

+ return NULL_RTX;

20938

+

20939

+ if (REG_P (op))

20940

+ return op;

20941

+ else if (GET_CODE (op) == SUBREG)

20942

+ {

20943

+ rtx reg = SUBREG_REG (op);

20944

+

20945

+ if (!REG_P (reg))

20946

+ return NULL_RTX;

20947

+

20948

+ mode = GET_MODE (reg);

20949

+

20950

+ /* Don't allow SUBREGs that span more than a word. It can

20951

+ lead to spill failures when the register is one word out

20952

+ of a two word structure. */

20953

+ if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)

20954

+ return NULL_RTX;

20955

+

20956

+ /* Allow only SUBREGs of non-eliminable hard registers. */

20957

+ if (register_no_elim_operand (reg, mode))

20958

+ return reg;

20959

+ }

20960

+

20961

+ /* Op is not a register. */

20962

+ return NULL_RTX;

20963

+}

20964

+

20965

/* Recognizes RTL expressions that are valid memory addresses for an

20966

instruction. The MODE argument is the machine mode for the MEM

20967

expression that wants to use this address.

20968

@@ -12273,6 +12266,7 @@

20969

struct ix86_address parts;

20970

rtx base, index, disp;

20971

HOST_WIDE_INT scale;

20972

+ enum ix86_address_seg seg;

20973

20974

if (ix86_decompose_address (addr, &parts) <= 0)

20975

/* Decomposition failed. */

20976

@@ -12282,23 +12276,16 @@

20977

index = parts.index;

20978

disp = parts.disp;

20979

scale = parts.scale;

20980

+ seg = parts.seg;

20981

20982

/* Validate base register. */

20983

if (base)

20984

{

20985

- rtx reg;

20986

+ rtx reg = ix86_validate_address_register (base);

20987

20988

- if (REG_P (base))

20989

- reg = base;

20990

- else if (GET_CODE (base) == SUBREG && REG_P (SUBREG_REG (base)))

20991

- reg = SUBREG_REG (base);

20992

- else

20993

- /* Base is not a register. */

20994

+ if (reg == NULL_RTX)

20995

return false;

20996

20997

- if (GET_MODE (base) != SImode && GET_MODE (base) != DImode)

20998

- return false;

20999

-

21000

if ((strict && ! REG_OK_FOR_BASE_STRICT_P (reg))

21001

|| (! strict && ! REG_OK_FOR_BASE_NONSTRICT_P (reg)))

21002

/* Base is not valid. */

21003

@@ -12308,19 +12295,11 @@

21004

/* Validate index register. */

21005

if (index)

21006

{

21007

- rtx reg;

21008

+ rtx reg = ix86_validate_address_register (index);

21009

21010

- if (REG_P (index))

21011

- reg = index;

21012

- else if (GET_CODE (index) == SUBREG && REG_P (SUBREG_REG (index)))

21013

- reg = SUBREG_REG (index);

21014

- else

21015

- /* Index is not a register. */

21016

+ if (reg == NULL_RTX)

21017

return false;

21018

21019

- if (GET_MODE (index) != SImode && GET_MODE (index) != DImode)

21020

- return false;

21021

-

21022

if ((strict && ! REG_OK_FOR_INDEX_STRICT_P (reg))

21023

|| (! strict && ! REG_OK_FOR_INDEX_NONSTRICT_P (reg)))

21024

/* Index is not valid. */

21025

@@ -12332,6 +12311,12 @@

21026

&& GET_MODE (base) != GET_MODE (index))

21027

return false;

21028

21029

+ /* Address override works only on the (%reg) part of %fs:(%reg). */

21030

+ if (seg != SEG_DEFAULT

21031

+ && ((base && GET_MODE (base) != word_mode)

21032

+ || (index && GET_MODE (index) != word_mode)))

21033

+ return false;

21034

+

21035

/* Validate scale factor. */

21036

if (scale != 1)

21037

{

21038

@@ -12453,6 +12438,12 @@

21039

&& !x86_64_immediate_operand (disp, VOIDmode))

21040

/* Displacement is out of range. */

21041

return false;

21042

+ /* In x32 mode, constant addresses are sign extended to 64bit, so

21043

+ we have to prevent addresses from 0x80000000 to 0xffffffff. */

21044

+ else if (TARGET_X32 && !(index || base)

21045

+ && CONST_INT_P (disp)

21046

+ && val_signbit_known_set_p (SImode, INTVAL (disp)))

21047

+ return false;

21048

}

21049

21050

/* Everything looks valid. */

21051

@@ -13817,8 +13808,6 @@

21052

Those same assemblers have the same but opposite lossage on cmov. */

21053

if (mode == CCmode)

21054

suffix = fp ? "nbe" : "a";

21055

- else if (mode == CCCmode)

21056

- suffix = "b";

21057

else

21058

gcc_unreachable ();

21059

break;

21060

@@ -13840,8 +13829,12 @@

21061

}

21062

break;

21063

case LTU:

21064

- gcc_assert (mode == CCmode || mode == CCCmode);

21065

- suffix = "b";

21066

+ if (mode == CCmode)

21067

+ suffix = "b";

21068

+ else if (mode == CCCmode)

21069

+ suffix = "c";

21070

+ else

21071

+ gcc_unreachable ();

21072

break;

21073

case GE:

21074

switch (mode)

21075

@@ -13861,20 +13854,20 @@

21076

}

21077

break;

21078

case GEU:

21079

- /* ??? As above. */

21080

- gcc_assert (mode == CCmode || mode == CCCmode);

21081

- suffix = fp ? "nb" : "ae";

21082

+ if (mode == CCmode)

21083

+ suffix = fp ? "nb" : "ae";

21084

+ else if (mode == CCCmode)

21085

+ suffix = "nc";

21086

+ else

21087

+ gcc_unreachable ();

21088

break;

21089

case LE:

21090

gcc_assert (mode == CCmode || mode == CCGCmode || mode == CCNOmode);

21091

suffix = "le";

21092

break;

21093

case LEU:

21094

- /* ??? As above. */

21095

if (mode == CCmode)

21096

suffix = "be";

21097

- else if (mode == CCCmode)

21098

- suffix = fp ? "nb" : "ae";

21099

else

21100

gcc_unreachable ();

21101

break;

21102

@@ -15340,7 +15333,7 @@

21103

rtx arg = XEXP (XEXP (link, 0), 0);

21104

21105

if (ix86_check_avx256_register (&arg, NULL))

21106

- return AVX_U128_ANY;

21107

+ return AVX_U128_DIRTY;

21108

}

21109

}

21110

21111

@@ -15460,8 +15453,8 @@

21112

{

21113

bool avx_reg256_found = false;

21114

note_stores (pat, ix86_check_avx256_stores, &avx_reg256_found);

21115

- if (!avx_reg256_found)

21116

- return AVX_U128_CLEAN;

21117

+

21118

+ return avx_reg256_found ? AVX_U128_DIRTY : AVX_U128_CLEAN;

21119

}

21120

21121

/* Otherwise, return current mode. Remember that if insn

21122

@@ -18486,12 +18479,7 @@

21123

return CCmode;

21124

case GTU: /* CF=0 & ZF=0 */

21125

case LEU: /* CF=1 | ZF=1 */

21126

- /* Detect overflow checks. They need just the carry flag. */

21127

- if (GET_CODE (op0) == MINUS

21128

- && rtx_equal_p (op1, XEXP (op0, 0)))

21129

- return CCCmode;

21130

- else

21131

- return CCmode;

21132

+ return CCmode;

21133

/* Codes possibly doable only with sign flag when

21134

comparing against zero. */

21135

case GE: /* SF=OF or SF=0 */

21136

@@ -21740,6 +21728,21 @@

21137

return SImode;

21138

}

21139

21140

+/* Copy the address to a Pmode register. This is used for x32 to

21141

+ truncate DImode TLS address to a SImode register. */

21142

+

21143

+static rtx

21144

+ix86_copy_addr_to_reg (rtx addr)

21145

+{

21146

+ if (GET_MODE (addr) == Pmode)

21147

+ return copy_addr_to_reg (addr);

21148

+ else

21149

+ {

21150

+ gcc_assert (GET_MODE (addr) == DImode && Pmode == SImode);

21151

+ return gen_rtx_SUBREG (SImode, copy_to_mode_reg (DImode, addr), 0);

21152

+ }

21153

+}

21154

+

21155

/* When SRCPTR is non-NULL, output simple loop to move memory

21156

pointer to SRCPTR to DESTPTR via chunks of MODE unrolled UNROLL times,

21157

overall size is COUNT specified in bytes. When SRCPTR is NULL, output the

21158

@@ -22728,8 +22731,8 @@

21159

gcc_assert (alg != no_stringop);

21160

if (!count)

21161

count_exp = copy_to_mode_reg (GET_MODE (count_exp), count_exp);

21162

- destreg = copy_addr_to_reg (XEXP (dst, 0));

21163

- srcreg = copy_addr_to_reg (XEXP (src, 0));

21164

+ destreg = ix86_copy_addr_to_reg (XEXP (dst, 0));

21165

+ srcreg = ix86_copy_addr_to_reg (XEXP (src, 0));

21166

switch (alg)

21167

{

21168

case libcall:

21169

@@ -23119,7 +23122,7 @@

21170

gcc_assert (alg != no_stringop);

21171

if (!count)

21172

count_exp = copy_to_mode_reg (counter_mode (count_exp), count_exp);

21173

- destreg = copy_addr_to_reg (XEXP (dst, 0));

21174

+ destreg = ix86_copy_addr_to_reg (XEXP (dst, 0));

21175

switch (alg)

21176

{

21177

case libcall:

21178

@@ -24988,8 +24991,17 @@

21179

int

21180

ix86_data_alignment (tree type, int align)

21181

{

21182

- int max_align = optimize_size ? BITS_PER_WORD : MIN (256, MAX_OFILE_ALIGNMENT);

21183

+ /* A data structure, equal or greater than the size of a cache line

21184

+ (64 bytes in the Pentium 4 and other recent Intel processors, including

21185

+ processors based on Intel Core microarchitecture) should be aligned

21186

+ so that its base address is a multiple of a cache line size. */

21187

21188

+ int max_align

21189

+ = MIN ((unsigned) ix86_tune_cost->prefetch_block * 8, MAX_OFILE_ALIGNMENT);

21190

+

21191

+ if (max_align < BITS_PER_WORD)

21192

+ max_align = BITS_PER_WORD;

21193

+

21194

if (AGGREGATE_TYPE_P (type)

21195

&& TYPE_SIZE (type)

21196

&& TREE_CODE (TYPE_SIZE (type)) == INTEGER_CST

21197

@@ -27984,8 +27996,8 @@

21198

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_shlv8hi3, "__builtin_ia32_vpshlw", IX86_BUILTIN_VPSHLW, UNKNOWN, (int)MULTI_ARG_2_HI },

21199

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_shlv16qi3, "__builtin_ia32_vpshlb", IX86_BUILTIN_VPSHLB, UNKNOWN, (int)MULTI_ARG_2_QI },

21200

21201

- { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv4sf2, "__builtin_ia32_vfrczss", IX86_BUILTIN_VFRCZSS, UNKNOWN, (int)MULTI_ARG_2_SF },

21202

- { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv2df2, "__builtin_ia32_vfrczsd", IX86_BUILTIN_VFRCZSD, UNKNOWN, (int)MULTI_ARG_2_DF },

21203

+ { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv4sf2, "__builtin_ia32_vfrczss", IX86_BUILTIN_VFRCZSS, UNKNOWN, (int)MULTI_ARG_1_SF },

21204

+ { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv2df2, "__builtin_ia32_vfrczsd", IX86_BUILTIN_VFRCZSD, UNKNOWN, (int)MULTI_ARG_1_DF },

21205

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv4sf2, "__builtin_ia32_vfrczps", IX86_BUILTIN_VFRCZPS, UNKNOWN, (int)MULTI_ARG_1_SF },

21206

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv2df2, "__builtin_ia32_vfrczpd", IX86_BUILTIN_VFRCZPD, UNKNOWN, (int)MULTI_ARG_1_DF },

21207

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv8sf2, "__builtin_ia32_vfrczps256", IX86_BUILTIN_VFRCZPS256, UNKNOWN, (int)MULTI_ARG_1_SF2 },

21208

@@ -31245,11 +31257,12 @@

21209

21210

static rtx

21211

ix86_expand_special_args_builtin (const struct builtin_description *d,

21212

- tree exp, rtx target)

21213

+ tree exp, rtx target)

21214

{

21215

tree arg;

21216

rtx pat, op;

21217

unsigned int i, nargs, arg_adjust, memory;

21218

+ bool aligned_mem = false;

21219

struct

21220

{

21221

rtx op;

21222

@@ -31295,6 +31308,15 @@

21223

nargs = 1;

21224

klass = load;

21225

memory = 0;

21226

+ switch (icode)

21227

+ {

21228

+ case CODE_FOR_sse4_1_movntdqa:

21229

+ case CODE_FOR_avx2_movntdqa:

21230

+ aligned_mem = true;

21231

+ break;

21232

+ default:

21233

+ break;

21234

+ }

21235

break;

21236

case VOID_FTYPE_PV2SF_V4SF:

21237

case VOID_FTYPE_PV4DI_V4DI:

21238

@@ -31312,6 +31334,26 @@

21239

klass = store;

21240

/* Reserve memory operand for target. */

21241

memory = ARRAY_SIZE (args);

21242

+ switch (icode)

21243

+ {

21244

+ /* These builtins and instructions require the memory

21245

+ to be properly aligned. */

21246

+ case CODE_FOR_avx_movntv4di:

21247

+ case CODE_FOR_sse2_movntv2di:

21248

+ case CODE_FOR_avx_movntv8sf:

21249

+ case CODE_FOR_sse_movntv4sf:

21250

+ case CODE_FOR_sse4a_vmmovntv4sf:

21251

+ case CODE_FOR_avx_movntv4df:

21252

+ case CODE_FOR_sse2_movntv2df:

21253

+ case CODE_FOR_sse4a_vmmovntv2df:

21254

+ case CODE_FOR_sse2_movntidi:

21255

+ case CODE_FOR_sse_movntq:

21256

+ case CODE_FOR_sse2_movntisi:

21257

+ aligned_mem = true;

21258

+ break;

21259

+ default:

21260

+ break;

21261

+ }

21262

break;

21263

case V4SF_FTYPE_V4SF_PCV2SF:

21264

case V2DF_FTYPE_V2DF_PCDOUBLE:

21265

@@ -31368,6 +31410,17 @@

21266

{

21267

op = force_reg (Pmode, convert_to_mode (Pmode, op, 1));

21268

target = gen_rtx_MEM (tmode, op);

21269

+ /* target at this point has just BITS_PER_UNIT MEM_ALIGN

21270

+ on it. Try to improve it using get_pointer_alignment,

21271

+ and if the special builtin is one that requires strict

21272

+ mode alignment, also from it's GET_MODE_ALIGNMENT.

21273

+ Failure to do so could lead to ix86_legitimate_combined_insn

21274

+ rejecting all changes to such insns. */

21275

+ unsigned int align = get_pointer_alignment (arg);

21276

+ if (aligned_mem && align < GET_MODE_ALIGNMENT (tmode))

21277

+ align = GET_MODE_ALIGNMENT (tmode);

21278

+ if (MEM_ALIGN (target) < align)

21279

+ set_mem_align (target, align);

21280

}

21281

else

21282

target = force_reg (tmode, op);

21283

@@ -31413,8 +31466,17 @@

21284

/* This must be the memory operand. */

21285

op = force_reg (Pmode, convert_to_mode (Pmode, op, 1));

21286

op = gen_rtx_MEM (mode, op);

21287

- gcc_assert (GET_MODE (op) == mode

21288

- || GET_MODE (op) == VOIDmode);

21289

+ /* op at this point has just BITS_PER_UNIT MEM_ALIGN

21290

+ on it. Try to improve it using get_pointer_alignment,

21291

+ and if the special builtin is one that requires strict

21292

+ mode alignment, also from it's GET_MODE_ALIGNMENT.

21293

+ Failure to do so could lead to ix86_legitimate_combined_insn

21294

+ rejecting all changes to such insns. */

21295

+ unsigned int align = get_pointer_alignment (arg);

21296

+ if (aligned_mem && align < GET_MODE_ALIGNMENT (mode))

21297

+ align = GET_MODE_ALIGNMENT (mode);

21298

+ if (MEM_ALIGN (op) < align)

21299

+ set_mem_align (op, align);

21300

}

21301

else

21302

{

21303

@@ -35232,7 +35294,10 @@

21304

The smallest offset in the page INSN can start is the case where START

21305

ends on the offset 0. Offset of INSN is then NBYTES - sizeof (INSN).

21306

We add p2align to 16byte window with maxskip 15 - NBYTES + sizeof (INSN).

21307

- */

21308

+

21309

+ Don't consider asm goto as jump, while it can contain a jump, it doesn't

21310

+ have to, control transfer to label(s) can be performed through other

21311

+ means, and also we estimate minimum length of all asm stmts as 0. */

21312

for (insn = start; insn; insn = NEXT_INSN (insn))

21313

{

21314

int min_size;

21315

@@ -35260,6 +35325,7 @@

21316

{

21317

start = NEXT_INSN (start);

21318

if ((JUMP_P (start)

21319

+ && asm_noperands (PATTERN (start)) < 0

21320

&& GET_CODE (PATTERN (start)) != ADDR_VEC

21321

&& GET_CODE (PATTERN (start)) != ADDR_DIFF_VEC)

21322

|| CALL_P (start))

21323

@@ -35278,6 +35344,7 @@

21324

fprintf (dump_file, "Insn %i estimated to %i bytes\n",

21325

INSN_UID (insn), min_size);

21326

if ((JUMP_P (insn)

21327

+ && asm_noperands (PATTERN (insn)) < 0

21328

&& GET_CODE (PATTERN (insn)) != ADDR_VEC

21329

&& GET_CODE (PATTERN (insn)) != ADDR_DIFF_VEC)

21330

|| CALL_P (insn))

21331

@@ -35289,6 +35356,7 @@

21332

{

21333

start = NEXT_INSN (start);

21334

if ((JUMP_P (start)

21335

+ && asm_noperands (PATTERN (start)) < 0

21336

&& GET_CODE (PATTERN (start)) != ADDR_VEC

21337

&& GET_CODE (PATTERN (start)) != ADDR_DIFF_VEC)

21338

|| CALL_P (start))

21339

Index: gcc/config/sh/predicates.md

21340

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

21341

--- a/src/gcc/config/sh/predicates.md (.../tags/gcc_4_8_2_release)

21342

+++ b/src/gcc/config/sh/predicates.md (.../branches/gcc-4_8-branch)

21343

@@ -389,6 +389,12 @@

21344

XEXP (XEXP (op, 0), 1),

21345

TARGET_SH2A, true)")))

21346

21347

+;; Returns true if OP is a displacement address that can fit into a

21348

+;; 16 bit (non-SH2A) memory load / store insn.

21349

+(define_predicate "short_displacement_mem_operand"

21350

+ (match_test "sh_disp_addr_displacement (op)

21351

+ <= sh_max_mov_insn_displacement (GET_MODE (op), false)"))

21352

+

21353

;; Returns 1 if the operand can be used in an SH2A movu.{b|w} insn.

21354

(define_predicate "zero_extend_movu_operand"

21355

(and (match_operand 0 "displacement_mem_operand")

21356

@@ -413,6 +419,11 @@

21357

if (t_reg_operand (op, mode))

21358

return 0;

21359

21360

+ /* Disallow PC relative QImode loads, since these is no insn to do that

21361

+ and an imm8 load should be used instead. */

21362

+ if (IS_PC_RELATIVE_LOAD_ADDR_P (op) && GET_MODE (op) == QImode)

21363

+ return false;

21364

+

21365

if (MEM_P (op))

21366

{

21367

rtx inside = XEXP (op, 0);

21368

Index: gcc/config/sh/sh-protos.h

21369

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

21370

--- a/src/gcc/config/sh/sh-protos.h (.../tags/gcc_4_8_2_release)

21371

+++ b/src/gcc/config/sh/sh-protos.h (.../branches/gcc-4_8-branch)

21372

@@ -159,6 +159,8 @@

21373

extern bool sh_cfun_trap_exit_p (void);

21374

extern rtx sh_find_equiv_gbr_addr (rtx cur_insn, rtx mem);

21375

extern int sh_eval_treg_value (rtx op);

21376

+extern HOST_WIDE_INT sh_disp_addr_displacement (rtx mem_op);

21377

+extern int sh_max_mov_insn_displacement (machine_mode mode, bool consider_sh2a);

21378

21379

/* Result value of sh_find_set_of_reg. */

21380

struct set_of_reg

21381

Index: gcc/config/sh/sh.c

21382

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

21383

--- a/src/gcc/config/sh/sh.c (.../tags/gcc_4_8_2_release)

21384

+++ b/src/gcc/config/sh/sh.c (.../branches/gcc-4_8-branch)

21385

@@ -310,9 +310,7 @@

21386

static void sh_conditional_register_usage (void);

21387

static bool sh_legitimate_constant_p (enum machine_mode, rtx);

21388

static int mov_insn_size (enum machine_mode, bool);

21389

-static int max_mov_insn_displacement (enum machine_mode, bool);

21390

static int mov_insn_alignment_mask (enum machine_mode, bool);

21391

-static HOST_WIDE_INT disp_addr_displacement (rtx);

21392

static bool sequence_insn_p (rtx);

21393

static void sh_canonicalize_comparison (int *, rtx *, rtx *, bool);

21394

static void sh_canonicalize_comparison (enum rtx_code&, rtx&, rtx&,

21395

@@ -3628,8 +3626,8 @@

21396

21397

/* Determine the maximum possible displacement for a move insn for the

21398

specified mode. */

21399

-static int

21400

-max_mov_insn_displacement (enum machine_mode mode, bool consider_sh2a)

21401

+int

21402

+sh_max_mov_insn_displacement (machine_mode mode, bool consider_sh2a)

21403

{

21404

/* The 4 byte displacement move insns are the same as the 2 byte

21405

versions but take a 12 bit displacement. All we need to do is to

21406

@@ -3665,8 +3663,8 @@

21407

}

21408

21409

/* Return the displacement value of a displacement address. */

21410

-static inline HOST_WIDE_INT

21411

-disp_addr_displacement (rtx x)

21412

+HOST_WIDE_INT

21413

+sh_disp_addr_displacement (rtx x)

21414

{

21415

gcc_assert (satisfies_constraint_Sdd (x));

21416

return INTVAL (XEXP (XEXP (x, 0), 1));

21417

@@ -3703,12 +3701,12 @@

21418

HImode and QImode loads/stores with displacement put pressure on

21419

R0 which will most likely require another reg copy. Thus account

21420

a higher cost for that. */

21421

- if (offset > 0 && offset <= max_mov_insn_displacement (mode, false))

21422

+ if (offset > 0 && offset <= sh_max_mov_insn_displacement (mode, false))

21423

return (mode == HImode || mode == QImode) ? 2 : 1;

21424

21425

/* The displacement would fit into a 4 byte move insn (SH2A). */

21426

if (TARGET_SH2A

21427

- && offset > 0 && offset <= max_mov_insn_displacement (mode, true))

21428

+ && offset > 0 && offset <= sh_max_mov_insn_displacement (mode, true))

21429

return 2;

21430

21431

/* The displacement is probably out of range and will require extra

21432

@@ -10218,7 +10216,7 @@

21433

else

21434

{

21435

const HOST_WIDE_INT offset = INTVAL (op);

21436

- const int max_disp = max_mov_insn_displacement (mode, consider_sh2a);

21437

+ const int max_disp = sh_max_mov_insn_displacement (mode, consider_sh2a);

21438

const int align_mask = mov_insn_alignment_mask (mode, consider_sh2a);

21439

21440

/* If the mode does not support any displacement always return false.

21441

@@ -10404,7 +10402,7 @@

21442

effectively disable the small displacement insns. */

21443

const int mode_sz = GET_MODE_SIZE (mode);

21444

const int mov_insn_sz = mov_insn_size (mode, false);

21445

- const int max_disp = max_mov_insn_displacement (mode, false);

21446

+ const int max_disp = sh_max_mov_insn_displacement (mode, false);

21447

const int max_disp_next = max_disp + mov_insn_sz;

21448

HOST_WIDE_INT align_modifier = offset > 127 ? mov_insn_sz : 0;

21449

HOST_WIDE_INT offset_adjust;

21450

@@ -13165,7 +13163,8 @@

21451

the insns must have the appropriate alternatives. */

21452

if ((mode == QImode || mode == HImode) && rclass != R0_REGS

21453

&& satisfies_constraint_Sdd (x)

21454

- && disp_addr_displacement (x) <= max_mov_insn_displacement (mode, false))

21455

+ && sh_disp_addr_displacement (x)

21456

+ <= sh_max_mov_insn_displacement (mode, false))

21457

return R0_REGS;

21458

21459

/* When reload is trying to address a QImode or HImode subreg on the stack,

21460

Index: gcc/config/sh/constraints.md

21461

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

21462

--- a/src/gcc/config/sh/constraints.md (.../tags/gcc_4_8_2_release)

21463

+++ b/src/gcc/config/sh/constraints.md (.../branches/gcc-4_8-branch)

21464

@@ -221,6 +221,7 @@

21465

(define_constraint "Q"

21466

"A pc relative load operand."

21467

(and (match_code "mem")

21468

+ (match_test "GET_MODE (op) != QImode")

21469

(match_test "IS_PC_RELATIVE_LOAD_ADDR_P (XEXP (op, 0))")))

21470

21471

(define_constraint "Bsc"

21472

@@ -295,13 +296,15 @@

21473

21474

(define_memory_constraint "Sdd"

21475

"A memory reference that uses displacement addressing."

21476

- (and (match_test "MEM_P (op) && GET_CODE (XEXP (op, 0)) == PLUS")

21477

+ (and (match_code "mem")

21478

+ (match_test "GET_CODE (XEXP (op, 0)) == PLUS")

21479

(match_test "REG_P (XEXP (XEXP (op, 0), 0))")

21480

(match_test "CONST_INT_P (XEXP (XEXP (op, 0), 1))")))

21481

21482

(define_memory_constraint "Snd"

21483

"A memory reference that excludes displacement addressing."

21484

- (match_test "! satisfies_constraint_Sdd (op)"))

21485

+ (and (match_code "mem")

21486

+ (match_test "! satisfies_constraint_Sdd (op)")))

21487

21488

(define_memory_constraint "Sbv"

21489

"A memory reference, as used in SH2A bclr.b, bset.b, etc."

21490

Index: gcc/config/sh/sh.md

21491

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

21492

--- a/src/gcc/config/sh/sh.md (.../tags/gcc_4_8_2_release)

21493

+++ b/src/gcc/config/sh/sh.md (.../branches/gcc-4_8-branch)

21494

@@ -6831,34 +6831,9 @@

21495

prepare_move_operands (operands, QImode);

21496

})

21497

21498

-;; If movqi_reg_reg is specified as an alternative of movqi, movqi will be

21499

-;; selected to copy QImode regs. If one of them happens to be allocated

21500

-;; on the stack, reload will stick to movqi insn and generate wrong

21501

-;; displacement addressing because of the generic m alternatives.

21502

-;; With the movqi_reg_reg being specified before movqi it will be initially

21503

-;; picked to load/store regs. If the regs regs are on the stack reload

21504

-;; try other insns and not stick to movqi_reg_reg, unless there were spilled

21505

-;; pseudos in which case 'm' constraints pertain.

21506

-;; The same applies to the movhi variants.

21507

-;;

21508

-;; Notice, that T bit is not allowed as a mov src operand here. This is to

21509

-;; avoid things like (set (reg:QI) (subreg:QI (reg:SI T_REG) 0)), which

21510

-;; introduces zero extensions after T bit stores and redundant reg copies.

21511

-;;

21512

-;; FIXME: We can't use 'arith_reg_operand' (which disallows T_REG) as a

21513

-;; predicate for the mov src operand because reload will have trouble

21514

-;; reloading MAC subregs otherwise. For that probably special patterns

21515

-;; would be required.

21516

-(define_insn "*mov<mode>_reg_reg"

21517

- [(set (match_operand:QIHI 0 "arith_reg_dest" "=r,m,*z")

21518

- (match_operand:QIHI 1 "register_operand" "r,*z,m"))]

21519

- "TARGET_SH1 && !t_reg_operand (operands[1], VOIDmode)"

21520

- "@

21521

- mov %1,%0

21522

- mov.<bw> %1,%0

21523

- mov.<bw> %1,%0"

21524

- [(set_attr "type" "move,store,load")])

21525

-

21526

+;; Specifying the displacement addressing load / store patterns separately

21527

+;; before the generic movqi / movhi pattern allows controlling the order

21528

+;; in which load / store insns are selected in a more fine grained way.

21529

;; FIXME: The non-SH2A and SH2A variants should be combined by adding

21530

;; "enabled" attribute as it is done in other targets.

21531

(define_insn "*mov<mode>_store_mem_disp04"

21532

@@ -6908,38 +6883,44 @@

21533

[(set_attr "type" "load")

21534

(set_attr "length" "2,2,4")])

21535

21536

-;; The m constraints basically allow any kind of addresses to be used with any

21537

-;; source/target register as the other operand. This is not true for

21538

-;; displacement addressing modes on anything but SH2A. That's why the

21539

-;; specialized load/store insns are specified above.

21540

-(define_insn "*movqi"

21541

- [(set (match_operand:QI 0 "general_movdst_operand" "=r,r,m,r,l")

21542

- (match_operand:QI 1 "general_movsrc_operand" "i,m,r,l,r"))]

21543

+;; The order of the constraint alternatives is important here.

21544

+;; Q/r has to come first, otherwise PC relative loads might wrongly get

21545

+;; placed into delay slots. Since there is no QImode PC relative load, the

21546

+;; Q constraint and general_movsrc_operand will reject it for QImode.

21547

+;; The Snd alternatives should come before Sdd in order to avoid a preference

21548

+;; of using r0 als the register operand for addressing modes other than

21549

+;; displacement addressing.

21550

+;; The Sdd alternatives allow only r0 as register operand, even though on

21551

+;; SH2A any register could be allowed by switching to a 32 bit insn.

21552

+;; Generally sticking to the r0 is preferrable, since it generates smaller

21553

+;; code. Obvious r0 reloads can then be eliminated with a peephole on SH2A.

21554

+(define_insn "*mov<mode>"

21555

+ [(set (match_operand:QIHI 0 "general_movdst_operand"

21556

+ "=r,r,r,Snd,r, Sdd,z, r,l")

21557

+ (match_operand:QIHI 1 "general_movsrc_operand"

21558

+ "Q,r,i,r, Snd,z, Sdd,l,r"))]

21559

"TARGET_SH1

21560

- && (arith_reg_operand (operands[0], QImode)

21561

- || arith_reg_operand (operands[1], QImode))"

21562

+ && (arith_reg_operand (operands[0], <MODE>mode)

21563

+ || arith_reg_operand (operands[1], <MODE>mode))"

21564

"@

21565

+ mov.<bw> %1,%0

21566

mov %1,%0

21567

- mov.b %1,%0

21568

- mov.b %1,%0

21569

- sts %1,%0

21570

- lds %1,%0"

21571

- [(set_attr "type" "movi8,load,store,prget,prset")])

21572

-

21573

-(define_insn "*movhi"

21574

- [(set (match_operand:HI 0 "general_movdst_operand" "=r,r,r,m,r,l")

21575

- (match_operand:HI 1 "general_movsrc_operand" "Q,i,m,r,l,r"))]

21576

- "TARGET_SH1

21577

- && (arith_reg_operand (operands[0], HImode)

21578

- || arith_reg_operand (operands[1], HImode))"

21579

- "@

21580

- mov.w %1,%0

21581

mov %1,%0

21582

- mov.w %1,%0

21583

- mov.w %1,%0

21584

+ mov.<bw> %1,%0

21585

+ mov.<bw> %1,%0

21586

+ mov.<bw> %1,%0

21587

+ mov.<bw> %1,%0

21588

sts %1,%0

21589

lds %1,%0"

21590

- [(set_attr "type" "pcload,movi8,load,store,prget,prset")])

21591

+ [(set_attr "type" "pcload,move,movi8,store,load,store,load,prget,prset")

21592

+ (set (attr "length")

21593

+ (cond [(and (match_operand 0 "displacement_mem_operand")

21594

+ (not (match_operand 0 "short_displacement_mem_operand")))

21595

+ (const_int 4)

21596

+ (and (match_operand 1 "displacement_mem_operand")

21597

+ (not (match_operand 1 "short_displacement_mem_operand")))

21598

+ (const_int 4)]

21599

+ (const_int 2)))])

21600

21601

(define_insn "*movqi_media"

21602

[(set (match_operand:QI 0 "general_movdst_operand" "=r,r,r,m")

21603

@@ -8427,11 +8408,9 @@

21604

21605

while (true)

21606

{

21607

- /* It's not safe to go beyond the current basic block after reload. */

21608

set_of_reg s1 = sh_find_set_of_reg (tested_reg, s0.insn,

21609

- reload_completed

21610

- ? prev_nonnote_insn_bb

21611

- : prev_nonnote_insn);

21612

+ prev_nonnote_insn);

21613

+

21614

if (s1.set_src == NULL_RTX)

21615

break;

21616

21617

@@ -8449,15 +8428,25 @@

21618

continue;

21619

}

21620

21621

- /* It's only safe to remove the testing insn if the T bit is not

21622

- modified between the testing insn and the insn that stores the

21623

- T bit. Notice that some T bit stores such as negc also modify

21624

- the T bit. */

21625

- if (modified_between_p (get_t_reg_rtx (), s1.insn, testing_insn)

21626

- || modified_in_p (get_t_reg_rtx (), s1.insn))

21627

- operands[2] = NULL_RTX;

21628

+ /* It's only safe to remove the testing insn if the T bit is not

21629

+ modified between the testing insn and the insn that stores the

21630

+ T bit. Notice that some T bit stores such as negc also modify

21631

+ the T bit. */

21632

+ if (modified_between_p (get_t_reg_rtx (), s1.insn, testing_insn)

21633

+ || modified_in_p (get_t_reg_rtx (), s1.insn)

21634

+ || !no_labels_between_p (s1.insn, testing_insn))

21635

+ operands[2] = NULL_RTX;

21636

+ else

21637

+ {

21638

+ /* If the insn that sets the tested reg has a REG_DEAD note on

21639

+ the T bit remove that note since we're extending the usage

21640

+ of the T bit. */

21641

+ rtx n = find_regno_note (s1.insn, REG_DEAD, T_REG);

21642

+ if (n != NULL_RTX)

21643

+ remove_note (s1.insn, n);

21644

+ }

21645

21646

- break;

21647

+ break;

21648

}

21649

21650

if (operands[2] == NULL_RTX)

21651

Index: gcc/config/sh/sh.opt

21652

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

21653

--- a/src/gcc/config/sh/sh.opt (.../tags/gcc_4_8_2_release)

21654

+++ b/src/gcc/config/sh/sh.opt (.../branches/gcc-4_8-branch)

21655

@@ -21,7 +21,7 @@

21656

;; Used for various architecture options.

21657

Mask(SH_E)

21658

21659

-;; Set if the default precision of th FPU is single.

21660

+;; Set if the default precision of the FPU is single.

21661

Mask(FPU_SINGLE)

21662

21663

;; Set if the a double-precision FPU is present but is restricted to

21664

Index: gcc/config/cris/cris.md

21665

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

21666

--- a/src/gcc/config/cris/cris.md (.../tags/gcc_4_8_2_release)

21667

+++ b/src/gcc/config/cris/cris.md (.../branches/gcc-4_8-branch)

21668

@@ -758,7 +758,7 @@

21669

(match_operand:SI 1 "const_int_operand" ""))

21670

(match_operand:SI 2 "register_operand" ""))])

21671

(match_operand 3 "register_operand" ""))

21672

- (set (match_operand:SI 4 "register_operand" "")

21673

+ (set (match_operand:SI 4 "cris_nonsp_register_operand" "")

21674

(plus:SI (mult:SI (match_dup 0)

21675

(match_dup 1))

21676

(match_dup 2)))])]

21677

@@ -859,7 +859,7 @@

21678

(match_operand:SI 0 "cris_bdap_operand" "")

21679

(match_operand:SI 1 "cris_bdap_operand" ""))])

21680

(match_operand 2 "register_operand" ""))

21681

- (set (match_operand:SI 3 "register_operand" "")

21682

+ (set (match_operand:SI 3 "cris_nonsp_register_operand" "")

21683

(plus:SI (match_dup 0) (match_dup 1)))])]

21684

"reload_completed && reg_overlap_mentioned_p (operands[3], operands[2])"

21685

[(set (match_dup 4) (match_dup 2))

21686

@@ -3960,7 +3960,7 @@

21687

;; up.

21688

21689

(define_split

21690

- [(set (match_operand 0 "register_operand" "")

21691

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21692

(match_operator

21693

4 "cris_operand_extend_operator"

21694

[(match_operand 1 "register_operand" "")

21695

@@ -3990,7 +3990,7 @@

21696

;; Call this op-extend-split-rx=rz

21697

21698

(define_split

21699

- [(set (match_operand 0 "register_operand" "")

21700

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21701

(match_operator

21702

4 "cris_plus_or_bound_operator"

21703

[(match_operand 1 "register_operand" "")

21704

@@ -4018,7 +4018,7 @@

21705

;; Call this op-extend-split-swapped

21706

21707

(define_split

21708

- [(set (match_operand 0 "register_operand" "")

21709

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21710

(match_operator

21711

4 "cris_plus_or_bound_operator"

21712

[(match_operator

21713

@@ -4044,7 +4044,7 @@

21714

;; bound. Call this op-extend-split-swapped-rx=rz.

21715

21716

(define_split

21717

- [(set (match_operand 0 "register_operand" "")

21718

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21719

(match_operator

21720

4 "cris_plus_or_bound_operator"

21721

[(match_operator

21722

@@ -4075,7 +4075,7 @@

21723

;; Call this op-extend.

21724

21725

(define_split

21726

- [(set (match_operand 0 "register_operand" "")

21727

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21728

(match_operator

21729

3 "cris_orthogonal_operator"

21730

[(match_operand 1 "register_operand" "")

21731

@@ -4099,7 +4099,7 @@

21732

;; Call this op-split-rx=rz

21733

21734

(define_split

21735

- [(set (match_operand 0 "register_operand" "")

21736

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21737

(match_operator

21738

3 "cris_commutative_orth_op"

21739

[(match_operand 2 "memory_operand" "")

21740

@@ -4123,7 +4123,7 @@

21741

;; Call this op-split-swapped.

21742

21743

(define_split

21744

- [(set (match_operand 0 "register_operand" "")

21745

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21746

(match_operator

21747

3 "cris_commutative_orth_op"

21748

[(match_operand 1 "register_operand" "")

21749

@@ -4146,7 +4146,7 @@

21750

;; Call this op-split-swapped-rx=rz.

21751

21752

(define_split

21753

- [(set (match_operand 0 "register_operand" "")

21754

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21755

(match_operator

21756

3 "cris_orthogonal_operator"

21757

[(match_operand 2 "memory_operand" "")

21758

@@ -4555,10 +4555,11 @@

21759

;; We're not allowed to generate copies of registers with different mode

21760

;; until after reload; copying pseudos upsets reload. CVS as of

21761

;; 2001-08-24, unwind-dw2-fde.c, _Unwind_Find_FDE ICE in

21762

-;; cselib_invalidate_regno.

21763

+;; cselib_invalidate_regno. Also, don't do this for the stack-pointer,

21764

+;; as we don't want it set temporarily to an invalid value.

21765

21766

(define_split ; indir_to_reg_split

21767

- [(set (match_operand 0 "register_operand" "")

21768

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21769

(match_operand 1 "indirect_operand" ""))]

21770

"reload_completed

21771

&& REG_P (operands[0])

21772

@@ -4574,7 +4575,7 @@

21773

;; As the above, but MOVS and MOVU.

21774

21775

(define_split

21776

- [(set (match_operand 0 "register_operand" "")

21777

+ [(set (match_operand 0 "cris_nonsp_register_operand" "")

21778

(match_operator

21779

4 "cris_extend_operator"

21780

[(match_operand 1 "indirect_operand" "")]))]

21781

Index: gcc/config/cris/predicates.md

21782

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

21783

--- a/src/gcc/config/cris/predicates.md (.../tags/gcc_4_8_2_release)

21784

+++ b/src/gcc/config/cris/predicates.md (.../branches/gcc-4_8-branch)

21785

@@ -76,6 +76,10 @@

21786

(match_test "cris_simple_address_operand (XEXP (op, 0),

21787

Pmode)"))))

21788

21789

+(define_predicate "cris_nonsp_register_operand"

21790

+ (and (match_operand 0 "register_operand")

21791

+ (match_test "op != stack_pointer_rtx")))

21792

+

21793

;; The caller needs to use :SI.

21794

(define_predicate "cris_bdap_sign_extend_operand"

21795

; Disabled until <URL:http://gcc.gnu.org/ml/gcc-patches/2005-10/msg01376.html>

21796

Index: gcc/config/m68k/m68k.c

21797

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

21798

--- a/src/gcc/config/m68k/m68k.c (.../tags/gcc_4_8_2_release)

21799

+++ b/src/gcc/config/m68k/m68k.c (.../branches/gcc-4_8-branch)

21800

@@ -3325,12 +3325,12 @@

21801

latehalf[1] = adjust_address (operands[1], SImode, 0);

21802

}

21803

21804

- /* If insn is effectively movd N(sp),-(sp) then we will do the

21805

- high word first. We should use the adjusted operand 1 (which is N+4(sp))

21806

- for the low word as well, to compensate for the first decrement of sp. */

21807

+ /* If insn is effectively movd N(REG),-(REG) then we will do the high

21808

+ word first. We should use the adjusted operand 1 (which is N+4(REG))

21809

+ for the low word as well, to compensate for the first decrement of

21810

+ REG. */

21811

if (optype0 == PUSHOP

21812

- && REGNO (XEXP (XEXP (operands[0], 0), 0)) == STACK_POINTER_REGNUM

21813

- && reg_overlap_mentioned_p (stack_pointer_rtx, operands[1]))

21814

+ && reg_overlap_mentioned_p (XEXP (XEXP (operands[0], 0), 0), operands[1]))

21815

operands[1] = middlehalf[1] = latehalf[1];

21816

21817

/* For (set (reg:DI N) (mem:DI ... (reg:SI N) ...)),

21818

Index: gcc/config/aarch64/aarch64-simd.md

21819

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

21820

--- a/src/gcc/config/aarch64/aarch64-simd.md (.../tags/gcc_4_8_2_release)

21821

+++ b/src/gcc/config/aarch64/aarch64-simd.md (.../branches/gcc-4_8-branch)

21822

@@ -21,7 +21,7 @@

21823

21824

; Main data types used by the insntructions

21825

21826

-(define_attr "simd_mode" "unknown,none,V8QI,V16QI,V4HI,V8HI,V2SI,V4SI,V2DI,V2SF,V4SF,V2DF,OI,CI,XI,DI,DF,SI,HI,QI"

21827

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

21828

(const_string "unknown"))

21829

21830

21831

@@ -1548,12 +1548,12 @@

21832

21833

case LTU:

21834

case GEU:

21835

- emit_insn (gen_aarch64_cmhs<mode> (mask, operands[4], operands[5]));

21836

+ emit_insn (gen_aarch64_cmgeu<mode> (mask, operands[4], operands[5]));

21837

break;

21838

21839

case LEU:

21840

case GTU:

21841

- emit_insn (gen_aarch64_cmhi<mode> (mask, operands[4], operands[5]));

21842

+ emit_insn (gen_aarch64_cmgtu<mode> (mask, operands[4], operands[5]));

21843

break;

21844

21845

case NE:

21846

@@ -3034,48 +3034,181 @@

21847

)

21848

21849

21850

-;; cm(eq|ge|le|lt|gt)

21851

+;; cm(eq|ge|gt|lt|le)

21852

+;; Note, we have constraints for Dz and Z as different expanders

21853

+;; have different ideas of what should be passed to this pattern.

21854

21855

-(define_insn "aarch64_cm<cmp><mode>"

21856

+(define_insn "aarch64_cm<optab><mode>"

21857

[(set (match_operand:<V_cmp_result> 0 "register_operand" "=w,w")

21858

- (unspec:<V_cmp_result>

21859

- [(match_operand:VSDQ_I_DI 1 "register_operand" "w,w")

21860

- (match_operand:VSDQ_I_DI 2 "aarch64_simd_reg_or_zero" "w,Z")]

21861

- VCMP_S))]

21862

+ (neg:<V_cmp_result>

21863

+ (COMPARISONS:<V_cmp_result>

21864

+ (match_operand:VDQ 1 "register_operand" "w,w")

21865

+ (match_operand:VDQ 2 "aarch64_simd_reg_or_zero" "w,ZDz")

21866

+ )))]

21867

"TARGET_SIMD"

21868

"@

21869

- cm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>

21870

- cm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, #0"

21871

+ cm<n_optab>\t%<v>0<Vmtype>, %<v><cmp_1><Vmtype>, %<v><cmp_2><Vmtype>

21872

+ cm<optab>\t%<v>0<Vmtype>, %<v>1<Vmtype>, #0"

21873

[(set_attr "simd_type" "simd_cmp")

21874

(set_attr "simd_mode" "<MODE>")]

21875

)

21876

21877

-;; cm(hs|hi|tst)

21878

+(define_insn_and_split "aarch64_cm<optab>di"

21879

+ [(set (match_operand:DI 0 "register_operand" "=w,w,r")

21880

+ (neg:DI

21881

+ (COMPARISONS:DI

21882

+ (match_operand:DI 1 "register_operand" "w,w,r")

21883

+ (match_operand:DI 2 "aarch64_simd_reg_or_zero" "w,ZDz,r")

21884

+ )))]

21885

+ "TARGET_SIMD"

21886

+ "@

21887

+ cm<n_optab>\t%d0, %d<cmp_1>, %d<cmp_2>

21888

+ cm<optab>\t%d0, %d1, #0

21889

+ #"

21890

+ "reload_completed

21891

+ /* We need to prevent the split from

21892

+ happening in the 'w' constraint cases. */

21893

+ && GP_REGNUM_P (REGNO (operands[0]))

21894

+ && GP_REGNUM_P (REGNO (operands[1]))"

21895

+ [(set (reg:CC CC_REGNUM)

21896

+ (compare:CC

21897

+ (match_dup 1)

21898

+ (match_dup 2)))

21899

+ (set (match_dup 0)

21900

+ (neg:DI

21901

+ (COMPARISONS:DI

21902

+ (match_operand 3 "cc_register" "")

21903

+ (const_int 0))))]

21904

+ {

21905

+ enum machine_mode mode = SELECT_CC_MODE (<CMP>, operands[1], operands[2]);

21906

+ rtx cc_reg = aarch64_gen_compare_reg (<CMP>, operands[1], operands[2]);

21907

+ rtx comparison = gen_rtx_<CMP> (mode, operands[1], operands[2]);

21908

+ emit_insn (gen_cstoredi_neg (operands[0], comparison, cc_reg));

21909

+ DONE;

21910

+ }

21911

+ [(set_attr "simd_type" "simd_cmp")

21912

+ (set_attr "simd_mode" "DI")]

21913

+)

21914

21915

-(define_insn "aarch64_cm<cmp><mode>"

21916

+;; cm(hs|hi)

21917

+

21918

+(define_insn "aarch64_cm<optab><mode>"

21919

[(set (match_operand:<V_cmp_result> 0 "register_operand" "=w")

21920

- (unspec:<V_cmp_result>

21921

- [(match_operand:VSDQ_I_DI 1 "register_operand" "w")

21922

- (match_operand:VSDQ_I_DI 2 "register_operand" "w")]

21923

- VCMP_U))]

21924

+ (neg:<V_cmp_result>

21925

+ (UCOMPARISONS:<V_cmp_result>

21926

+ (match_operand:VDQ 1 "register_operand" "w")

21927

+ (match_operand:VDQ 2 "register_operand" "w")

21928

+ )))]

21929

"TARGET_SIMD"

21930

- "cm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>"

21931

+ "cm<n_optab>\t%<v>0<Vmtype>, %<v><cmp_1><Vmtype>, %<v><cmp_2><Vmtype>"

21932

[(set_attr "simd_type" "simd_cmp")

21933

(set_attr "simd_mode" "<MODE>")]

21934

)

21935

21936

-;; fcm(eq|ge|le|lt|gt)

21937

+(define_insn_and_split "aarch64_cm<optab>di"

21938

+ [(set (match_operand:DI 0 "register_operand" "=w,r")

21939

+ (neg:DI

21940

+ (UCOMPARISONS:DI

21941

+ (match_operand:DI 1 "register_operand" "w,r")

21942

+ (match_operand:DI 2 "aarch64_simd_reg_or_zero" "w,r")

21943

+ )))]

21944

+ "TARGET_SIMD"

21945

+ "@

21946

+ cm<n_optab>\t%d0, %d<cmp_1>, %d<cmp_2>

21947

+ #"

21948

+ "reload_completed

21949

+ /* We need to prevent the split from

21950

+ happening in the 'w' constraint cases. */

21951

+ && GP_REGNUM_P (REGNO (operands[0]))

21952

+ && GP_REGNUM_P (REGNO (operands[1]))"

21953

+ [(set (reg:CC CC_REGNUM)

21954

+ (compare:CC

21955

+ (match_dup 1)

21956

+ (match_dup 2)))

21957

+ (set (match_dup 0)

21958

+ (neg:DI

21959

+ (UCOMPARISONS:DI

21960

+ (match_operand 3 "cc_register" "")

21961

+ (const_int 0))))]

21962

+ {

21963

+ enum machine_mode mode = SELECT_CC_MODE (<CMP>, operands[1], operands[2]);

21964

+ rtx cc_reg = aarch64_gen_compare_reg (<CMP>, operands[1], operands[2]);

21965

+ rtx comparison = gen_rtx_<CMP> (mode, operands[1], operands[2]);

21966

+ emit_insn (gen_cstoredi_neg (operands[0], comparison, cc_reg));

21967

+ DONE;

21968

+ }

21969

+ [(set_attr "simd_type" "simd_cmp")

21970

+ (set_attr "simd_mode" "DI")]

21971

+)

21972

21973

-(define_insn "aarch64_cm<cmp><mode>"

21974

+;; cmtst

21975

+

21976

+(define_insn "aarch64_cmtst<mode>"

21977

+ [(set (match_operand:<V_cmp_result> 0 "register_operand" "=w")

21978

+ (neg:<V_cmp_result>

21979

+ (ne:<V_cmp_result>

21980

+ (and:VDQ

21981

+ (match_operand:VDQ 1 "register_operand" "w")

21982

+ (match_operand:VDQ 2 "register_operand" "w"))

21983

+ (vec_duplicate:<V_cmp_result> (const_int 0)))))]

21984

+ "TARGET_SIMD"

21985

+ "cmtst\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>"

21986

+ [(set_attr "simd_type" "simd_cmp")

21987

+ (set_attr "simd_mode" "<MODE>")]

21988

+)

21989

+

21990

+(define_insn_and_split "aarch64_cmtstdi"

21991

+ [(set (match_operand:DI 0 "register_operand" "=w,r")

21992

+ (neg:DI

21993

+ (ne:DI

21994

+ (and:DI

21995

+ (match_operand:DI 1 "register_operand" "w,r")

21996

+ (match_operand:DI 2 "register_operand" "w,r"))

21997

+ (const_int 0))))]

21998

+ "TARGET_SIMD"

21999

+ "@

22000

+ cmtst\t%d0, %d1, %d2

22001

+ #"

22002

+ "reload_completed

22003

+ /* We need to prevent the split from

22004

+ happening in the 'w' constraint cases. */

22005

+ && GP_REGNUM_P (REGNO (operands[0]))

22006

+ && GP_REGNUM_P (REGNO (operands[1]))"

22007

+ [(set (reg:CC_NZ CC_REGNUM)

22008

+ (compare:CC_NZ

22009

+ (and:DI (match_dup 1)

22010

+ (match_dup 2))

22011

+ (const_int 0)))

22012

+ (set (match_dup 0)

22013

+ (neg:DI

22014

+ (ne:DI

22015

+ (match_operand 3 "cc_register" "")

22016

+ (const_int 0))))]

22017

+ {

22018

+ rtx and_tree = gen_rtx_AND (DImode, operands[1], operands[2]);

22019

+ enum machine_mode mode = SELECT_CC_MODE (NE, and_tree, const0_rtx);

22020

+ rtx cc_reg = aarch64_gen_compare_reg (NE, and_tree, const0_rtx);

22021

+ rtx comparison = gen_rtx_NE (mode, and_tree, const0_rtx);

22022

+ emit_insn (gen_cstoredi_neg (operands[0], comparison, cc_reg));

22023

+ DONE;

22024

+ }

22025

+ [(set_attr "simd_type" "simd_cmp")

22026

+ (set_attr "simd_mode" "DI")]

22027

+)

22028

+

22029

+;; fcm(eq|ge|gt|le|lt)

22030

+

22031

+(define_insn "aarch64_cm<optab><mode>"

22032

[(set (match_operand:<V_cmp_result> 0 "register_operand" "=w,w")

22033

- (unspec:<V_cmp_result>

22034

- [(match_operand:VDQF 1 "register_operand" "w,w")

22035

- (match_operand:VDQF 2 "aarch64_simd_reg_or_zero" "w,Dz")]

22036

- VCMP_S))]

22037

+ (neg:<V_cmp_result>

22038

+ (COMPARISONS:<V_cmp_result>

22039

+ (match_operand:VALLF 1 "register_operand" "w,w")

22040

+ (match_operand:VALLF 2 "aarch64_simd_reg_or_zero" "w,YDz")

22041

+ )))]

22042

"TARGET_SIMD"

22043

"@

22044

- fcm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, %<v>2<Vmtype>

22045

- fcm<cmp>\t%<v>0<Vmtype>, %<v>1<Vmtype>, 0"

22046

+ fcm<n_optab>\t%<v>0<Vmtype>, %<v><cmp_1><Vmtype>, %<v><cmp_2><Vmtype>

22047

+ fcm<optab>\t%<v>0<Vmtype>, %<v>1<Vmtype>, 0"

22048

[(set_attr "simd_type" "simd_fcmp")

22049

(set_attr "simd_mode" "<MODE>")]

22050

)

22051

Index: gcc/config/aarch64/predicates.md

22052

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

22053

--- a/src/gcc/config/aarch64/predicates.md (.../tags/gcc_4_8_2_release)

22054

+++ b/src/gcc/config/aarch64/predicates.md (.../branches/gcc-4_8-branch)

22055

@@ -31,6 +31,11 @@

22056

(ior (match_operand 0 "register_operand")

22057

(match_test "op == const0_rtx"))))

22058

22059

+(define_predicate "aarch64_reg_or_fp_zero"

22060

+ (and (match_code "reg,subreg,const_double")

22061

+ (ior (match_operand 0 "register_operand")

22062

+ (match_test "aarch64_float_const_zero_rtx_p (op)"))))

22063

+

22064

(define_predicate "aarch64_reg_zero_or_m1_or_1"

22065

(and (match_code "reg,subreg,const_int")

22066

(ior (match_operand 0 "register_operand")

22067

Index: gcc/config/aarch64/arm_neon.h

22068

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

22069

--- a/src/gcc/config/aarch64/arm_neon.h (.../tags/gcc_4_8_2_release)

22070

+++ b/src/gcc/config/aarch64/arm_neon.h (.../branches/gcc-4_8-branch)

22071

@@ -19551,28 +19551,28 @@

22072

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22073

vcge_u8 (uint8x8_t __a, uint8x8_t __b)

22074

{

22075

- return (uint8x8_t) __builtin_aarch64_cmhsv8qi ((int8x8_t) __a,

22076

+ return (uint8x8_t) __builtin_aarch64_cmgeuv8qi ((int8x8_t) __a,

22077

(int8x8_t) __b);

22078

}

22079

22080

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22081

vcge_u16 (uint16x4_t __a, uint16x4_t __b)

22082

{

22083

- return (uint16x4_t) __builtin_aarch64_cmhsv4hi ((int16x4_t) __a,

22084

+ return (uint16x4_t) __builtin_aarch64_cmgeuv4hi ((int16x4_t) __a,

22085

(int16x4_t) __b);

22086

}

22087

22088

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22089

vcge_u32 (uint32x2_t __a, uint32x2_t __b)

22090

{

22091

- return (uint32x2_t) __builtin_aarch64_cmhsv2si ((int32x2_t) __a,

22092

+ return (uint32x2_t) __builtin_aarch64_cmgeuv2si ((int32x2_t) __a,

22093

(int32x2_t) __b);

22094

}

22095

22096

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22097

vcge_u64 (uint64x1_t __a, uint64x1_t __b)

22098

{

22099

- return (uint64x1_t) __builtin_aarch64_cmhsdi ((int64x1_t) __a,

22100

+ return (uint64x1_t) __builtin_aarch64_cmgeudi ((int64x1_t) __a,

22101

(int64x1_t) __b);

22102

}

22103

22104

@@ -19603,28 +19603,28 @@

22105

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22106

vcgeq_u8 (uint8x16_t __a, uint8x16_t __b)

22107

{

22108

- return (uint8x16_t) __builtin_aarch64_cmhsv16qi ((int8x16_t) __a,

22109

+ return (uint8x16_t) __builtin_aarch64_cmgeuv16qi ((int8x16_t) __a,

22110

(int8x16_t) __b);

22111

}

22112

22113

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22114

vcgeq_u16 (uint16x8_t __a, uint16x8_t __b)

22115

{

22116

- return (uint16x8_t) __builtin_aarch64_cmhsv8hi ((int16x8_t) __a,

22117

+ return (uint16x8_t) __builtin_aarch64_cmgeuv8hi ((int16x8_t) __a,

22118

(int16x8_t) __b);

22119

}

22120

22121

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22122

vcgeq_u32 (uint32x4_t __a, uint32x4_t __b)

22123

{

22124

- return (uint32x4_t) __builtin_aarch64_cmhsv4si ((int32x4_t) __a,

22125

+ return (uint32x4_t) __builtin_aarch64_cmgeuv4si ((int32x4_t) __a,

22126

(int32x4_t) __b);

22127

}

22128

22129

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22130

vcgeq_u64 (uint64x2_t __a, uint64x2_t __b)

22131

{

22132

- return (uint64x2_t) __builtin_aarch64_cmhsv2di ((int64x2_t) __a,

22133

+ return (uint64x2_t) __builtin_aarch64_cmgeuv2di ((int64x2_t) __a,

22134

(int64x2_t) __b);

22135

}

22136

22137

@@ -19637,7 +19637,7 @@

22138

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22139

vcged_u64 (uint64x1_t __a, uint64x1_t __b)

22140

{

22141

- return (uint64x1_t) __builtin_aarch64_cmhsdi ((int64x1_t) __a,

22142

+ return (uint64x1_t) __builtin_aarch64_cmgeudi ((int64x1_t) __a,

22143

(int64x1_t) __b);

22144

}

22145

22146

@@ -19676,28 +19676,28 @@

22147

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22148

vcgt_u8 (uint8x8_t __a, uint8x8_t __b)

22149

{

22150

- return (uint8x8_t) __builtin_aarch64_cmhiv8qi ((int8x8_t) __a,

22151

+ return (uint8x8_t) __builtin_aarch64_cmgtuv8qi ((int8x8_t) __a,

22152

(int8x8_t) __b);

22153

}

22154

22155

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22156

vcgt_u16 (uint16x4_t __a, uint16x4_t __b)

22157

{

22158

- return (uint16x4_t) __builtin_aarch64_cmhiv4hi ((int16x4_t) __a,

22159

+ return (uint16x4_t) __builtin_aarch64_cmgtuv4hi ((int16x4_t) __a,

22160

(int16x4_t) __b);

22161

}

22162

22163

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22164

vcgt_u32 (uint32x2_t __a, uint32x2_t __b)

22165

{

22166

- return (uint32x2_t) __builtin_aarch64_cmhiv2si ((int32x2_t) __a,

22167

+ return (uint32x2_t) __builtin_aarch64_cmgtuv2si ((int32x2_t) __a,

22168

(int32x2_t) __b);

22169

}

22170

22171

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22172

vcgt_u64 (uint64x1_t __a, uint64x1_t __b)

22173

{

22174

- return (uint64x1_t) __builtin_aarch64_cmhidi ((int64x1_t) __a,

22175

+ return (uint64x1_t) __builtin_aarch64_cmgtudi ((int64x1_t) __a,

22176

(int64x1_t) __b);

22177

}

22178

22179

@@ -19728,28 +19728,28 @@

22180

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22181

vcgtq_u8 (uint8x16_t __a, uint8x16_t __b)

22182

{

22183

- return (uint8x16_t) __builtin_aarch64_cmhiv16qi ((int8x16_t) __a,

22184

+ return (uint8x16_t) __builtin_aarch64_cmgtuv16qi ((int8x16_t) __a,

22185

(int8x16_t) __b);

22186

}

22187

22188

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22189

vcgtq_u16 (uint16x8_t __a, uint16x8_t __b)

22190

{

22191

- return (uint16x8_t) __builtin_aarch64_cmhiv8hi ((int16x8_t) __a,

22192

+ return (uint16x8_t) __builtin_aarch64_cmgtuv8hi ((int16x8_t) __a,

22193

(int16x8_t) __b);

22194

}

22195

22196

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22197

vcgtq_u32 (uint32x4_t __a, uint32x4_t __b)

22198

{

22199

- return (uint32x4_t) __builtin_aarch64_cmhiv4si ((int32x4_t) __a,

22200

+ return (uint32x4_t) __builtin_aarch64_cmgtuv4si ((int32x4_t) __a,

22201

(int32x4_t) __b);

22202

}

22203

22204

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22205

vcgtq_u64 (uint64x2_t __a, uint64x2_t __b)

22206

{

22207

- return (uint64x2_t) __builtin_aarch64_cmhiv2di ((int64x2_t) __a,

22208

+ return (uint64x2_t) __builtin_aarch64_cmgtuv2di ((int64x2_t) __a,

22209

(int64x2_t) __b);

22210

}

22211

22212

@@ -19762,7 +19762,7 @@

22213

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22214

vcgtd_u64 (uint64x1_t __a, uint64x1_t __b)

22215

{

22216

- return (uint64x1_t) __builtin_aarch64_cmhidi ((int64x1_t) __a,

22217

+ return (uint64x1_t) __builtin_aarch64_cmgtudi ((int64x1_t) __a,

22218

(int64x1_t) __b);

22219

}

22220

22221

@@ -19801,28 +19801,28 @@

22222

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22223

vcle_u8 (uint8x8_t __a, uint8x8_t __b)

22224

{

22225

- return (uint8x8_t) __builtin_aarch64_cmhsv8qi ((int8x8_t) __b,

22226

+ return (uint8x8_t) __builtin_aarch64_cmgeuv8qi ((int8x8_t) __b,

22227

(int8x8_t) __a);

22228

}

22229

22230

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22231

vcle_u16 (uint16x4_t __a, uint16x4_t __b)

22232

{

22233

- return (uint16x4_t) __builtin_aarch64_cmhsv4hi ((int16x4_t) __b,

22234

+ return (uint16x4_t) __builtin_aarch64_cmgeuv4hi ((int16x4_t) __b,

22235

(int16x4_t) __a);

22236

}

22237

22238

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22239

vcle_u32 (uint32x2_t __a, uint32x2_t __b)

22240

{

22241

- return (uint32x2_t) __builtin_aarch64_cmhsv2si ((int32x2_t) __b,

22242

+ return (uint32x2_t) __builtin_aarch64_cmgeuv2si ((int32x2_t) __b,

22243

(int32x2_t) __a);

22244

}

22245

22246

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22247

vcle_u64 (uint64x1_t __a, uint64x1_t __b)

22248

{

22249

- return (uint64x1_t) __builtin_aarch64_cmhsdi ((int64x1_t) __b,

22250

+ return (uint64x1_t) __builtin_aarch64_cmgeudi ((int64x1_t) __b,

22251

(int64x1_t) __a);

22252

}

22253

22254

@@ -19853,28 +19853,28 @@

22255

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22256

vcleq_u8 (uint8x16_t __a, uint8x16_t __b)

22257

{

22258

- return (uint8x16_t) __builtin_aarch64_cmhsv16qi ((int8x16_t) __b,

22259

+ return (uint8x16_t) __builtin_aarch64_cmgeuv16qi ((int8x16_t) __b,

22260

(int8x16_t) __a);

22261

}

22262

22263

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22264

vcleq_u16 (uint16x8_t __a, uint16x8_t __b)

22265

{

22266

- return (uint16x8_t) __builtin_aarch64_cmhsv8hi ((int16x8_t) __b,

22267

+ return (uint16x8_t) __builtin_aarch64_cmgeuv8hi ((int16x8_t) __b,

22268

(int16x8_t) __a);

22269

}

22270

22271

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22272

vcleq_u32 (uint32x4_t __a, uint32x4_t __b)

22273

{

22274

- return (uint32x4_t) __builtin_aarch64_cmhsv4si ((int32x4_t) __b,

22275

+ return (uint32x4_t) __builtin_aarch64_cmgeuv4si ((int32x4_t) __b,

22276

(int32x4_t) __a);

22277

}

22278

22279

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22280

vcleq_u64 (uint64x2_t __a, uint64x2_t __b)

22281

{

22282

- return (uint64x2_t) __builtin_aarch64_cmhsv2di ((int64x2_t) __b,

22283

+ return (uint64x2_t) __builtin_aarch64_cmgeuv2di ((int64x2_t) __b,

22284

(int64x2_t) __a);

22285

}

22286

22287

@@ -19919,28 +19919,28 @@

22288

__extension__ static __inline uint8x8_t __attribute__ ((__always_inline__))

22289

vclt_u8 (uint8x8_t __a, uint8x8_t __b)

22290

{

22291

- return (uint8x8_t) __builtin_aarch64_cmhiv8qi ((int8x8_t) __b,

22292

+ return (uint8x8_t) __builtin_aarch64_cmgtuv8qi ((int8x8_t) __b,

22293

(int8x8_t) __a);

22294

}

22295

22296

__extension__ static __inline uint16x4_t __attribute__ ((__always_inline__))

22297

vclt_u16 (uint16x4_t __a, uint16x4_t __b)

22298

{

22299

- return (uint16x4_t) __builtin_aarch64_cmhiv4hi ((int16x4_t) __b,

22300

+ return (uint16x4_t) __builtin_aarch64_cmgtuv4hi ((int16x4_t) __b,

22301

(int16x4_t) __a);

22302

}

22303

22304

__extension__ static __inline uint32x2_t __attribute__ ((__always_inline__))

22305

vclt_u32 (uint32x2_t __a, uint32x2_t __b)

22306

{

22307

- return (uint32x2_t) __builtin_aarch64_cmhiv2si ((int32x2_t) __b,

22308

+ return (uint32x2_t) __builtin_aarch64_cmgtuv2si ((int32x2_t) __b,

22309

(int32x2_t) __a);

22310

}

22311

22312

__extension__ static __inline uint64x1_t __attribute__ ((__always_inline__))

22313

vclt_u64 (uint64x1_t __a, uint64x1_t __b)

22314

{

22315

- return (uint64x1_t) __builtin_aarch64_cmhidi ((int64x1_t) __b,

22316

+ return (uint64x1_t) __builtin_aarch64_cmgtudi ((int64x1_t) __b,

22317

(int64x1_t) __a);

22318

}

22319

22320

@@ -19971,28 +19971,28 @@

22321

__extension__ static __inline uint8x16_t __attribute__ ((__always_inline__))

22322

vcltq_u8 (uint8x16_t __a, uint8x16_t __b)

22323

{

22324

- return (uint8x16_t) __builtin_aarch64_cmhiv16qi ((int8x16_t) __b,

22325

+ return (uint8x16_t) __builtin_aarch64_cmgtuv16qi ((int8x16_t) __b,

22326

(int8x16_t) __a);

22327

}

22328

22329

__extension__ static __inline uint16x8_t __attribute__ ((__always_inline__))

22330

vcltq_u16 (uint16x8_t __a, uint16x8_t __b)

22331

{

22332

- return (uint16x8_t) __builtin_aarch64_cmhiv8hi ((int16x8_t) __b,

22333

+ return (uint16x8_t) __builtin_aarch64_cmgtuv8hi ((int16x8_t) __b,

22334

(int16x8_t) __a);

22335

}

22336

22337

__extension__ static __inline uint32x4_t __attribute__ ((__always_inline__))

22338

vcltq_u32 (uint32x4_t __a, uint32x4_t __b)

22339

{

22340

- return (uint32x4_t) __builtin_aarch64_cmhiv4si ((int32x4_t) __b,

22341

+ return (uint32x4_t) __builtin_aarch64_cmgtuv4si ((int32x4_t) __b,

22342

(int32x4_t) __a);

22343

}

22344

22345

__extension__ static __inline uint64x2_t __attribute__ ((__always_inline__))

22346

vcltq_u64 (uint64x2_t __a, uint64x2_t __b)

22347

{

22348

- return (uint64x2_t) __builtin_aarch64_cmhiv2di ((int64x2_t) __b,

22349

+ return (uint64x2_t) __builtin_aarch64_cmgtuv2di ((int64x2_t) __b,

22350

(int64x2_t) __a);

22351

}

22352

22353

Index: gcc/config/aarch64/aarch64.md

22354

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

22355

--- a/src/gcc/config/aarch64/aarch64.md (.../tags/gcc_4_8_2_release)

22356

+++ b/src/gcc/config/aarch64/aarch64.md (.../branches/gcc-4_8-branch)

22357

@@ -2211,7 +2211,7 @@

22358

(set_attr "mode" "SI")]

22359

)

22360

22361

-(define_insn "*cstore<mode>_neg"

22362

+(define_insn "cstore<mode>_neg"

22363

[(set (match_operand:ALLI 0 "register_operand" "=r")

22364

(neg:ALLI (match_operator:ALLI 1 "aarch64_comparison_operator"

22365

[(match_operand 2 "cc_register" "") (const_int 0)])))]

22366

Index: gcc/config/aarch64/aarch64-simd-builtins.def

22367

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

22368

--- a/src/gcc/config/aarch64/aarch64-simd-builtins.def (.../tags/gcc_4_8_2_release)

22369

+++ b/src/gcc/config/aarch64/aarch64-simd-builtins.def (.../branches/gcc-4_8-branch)

22370

@@ -217,8 +217,8 @@

22371

BUILTIN_VSDQ_I_DI (BINOP, cmle)

22372

BUILTIN_VSDQ_I_DI (BINOP, cmlt)

22373

/* Implemented by aarch64_cm<cmp><mode>. */

22374

- BUILTIN_VSDQ_I_DI (BINOP, cmhs)

22375

- BUILTIN_VSDQ_I_DI (BINOP, cmhi)

22376

+ BUILTIN_VSDQ_I_DI (BINOP, cmgeu)

22377

+ BUILTIN_VSDQ_I_DI (BINOP, cmgtu)

22378

BUILTIN_VSDQ_I_DI (BINOP, cmtst)

22379

22380

/* Implemented by aarch64_<fmaxmin><mode>. */

22381

Index: gcc/config/aarch64/iterators.md

22382

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

22383

--- a/src/gcc/config/aarch64/iterators.md (.../tags/gcc_4_8_2_release)

22384

+++ b/src/gcc/config/aarch64/iterators.md (.../branches/gcc-4_8-branch)

22385

@@ -83,6 +83,9 @@

22386

;; Vector Float modes.

22387

(define_mode_iterator VDQF [V2SF V4SF V2DF])

22388

22389

+;; All Float modes.

22390

+(define_mode_iterator VALLF [V2SF V4SF V2DF SF DF])

22391

+

22392

;; Vector Float modes with 2 elements.

22393

(define_mode_iterator V2F [V2SF V2DF])

22394

22395

@@ -213,13 +216,6 @@

22396

UNSPEC_URSHL ; Used in aarch64-simd.md.

22397

UNSPEC_SQRSHL ; Used in aarch64-simd.md.

22398

UNSPEC_UQRSHL ; Used in aarch64-simd.md.

22399

- UNSPEC_CMEQ ; Used in aarch64-simd.md.

22400

- UNSPEC_CMLE ; Used in aarch64-simd.md.

22401

- UNSPEC_CMLT ; Used in aarch64-simd.md.

22402

- UNSPEC_CMGE ; Used in aarch64-simd.md.

22403

- UNSPEC_CMGT ; Used in aarch64-simd.md.

22404

- UNSPEC_CMHS ; Used in aarch64-simd.md.

22405

- UNSPEC_CMHI ; Used in aarch64-simd.md.

22406

UNSPEC_SSLI ; Used in aarch64-simd.md.

22407

UNSPEC_USLI ; Used in aarch64-simd.md.

22408

UNSPEC_SSRI ; Used in aarch64-simd.md.

22409

@@ -227,7 +223,6 @@

22410

UNSPEC_SSHLL ; Used in aarch64-simd.md.

22411

UNSPEC_USHLL ; Used in aarch64-simd.md.

22412

UNSPEC_ADDP ; Used in aarch64-simd.md.

22413

- UNSPEC_CMTST ; Used in aarch64-simd.md.

22414

UNSPEC_FMAX ; Used in aarch64-simd.md.

22415

UNSPEC_FMIN ; Used in aarch64-simd.md.

22416

UNSPEC_BSL ; Used in aarch64-simd.md.

22417

@@ -251,6 +246,7 @@

22418

22419

;; For scalar usage of vector/FP registers

22420

(define_mode_attr v [(QI "b") (HI "h") (SI "s") (DI "d")

22421

+ (SF "s") (DF "d")

22422

(V8QI "") (V16QI "")

22423

(V4HI "") (V8HI "")

22424

(V2SI "") (V4SI "")

22425

@@ -305,7 +301,8 @@

22426

(V4SF ".4s") (V2DF ".2d")

22427

(DI "") (SI "")

22428

(HI "") (QI "")

22429

- (TI "")])

22430

+ (TI "") (SF "")

22431

+ (DF "")])

22432

22433

;; Register suffix narrowed modes for VQN.

22434

(define_mode_attr Vmntype [(V8HI ".8b") (V4SI ".4h")

22435

@@ -444,7 +441,8 @@

22436

(V2SI "V2SI") (V4SI "V4SI")

22437

(DI "DI") (V2DI "V2DI")

22438

(V2SF "V2SI") (V4SF "V4SI")

22439

- (V2DF "V2DI")])

22440

+ (V2DF "V2DI") (DF "DI")

22441

+ (SF "SI")])

22442

22443

;; Lower case mode of results of comparison operations.

22444

(define_mode_attr v_cmp_result [(V8QI "v8qi") (V16QI "v16qi")

22445

@@ -452,7 +450,8 @@

22446

(V2SI "v2si") (V4SI "v4si")

22447

(DI "di") (V2DI "v2di")

22448

(V2SF "v2si") (V4SF "v4si")

22449

- (V2DF "v2di")])

22450

+ (V2DF "v2di") (DF "di")

22451

+ (SF "si")])

22452

22453

;; Vm for lane instructions is restricted to FP_LO_REGS.

22454

(define_mode_attr vwx [(V4HI "x") (V8HI "x") (HI "x")

22455

@@ -543,6 +542,12 @@

22456

;; Code iterator for signed variants of vector saturating binary ops.

22457

(define_code_iterator SBINQOPS [ss_plus ss_minus])

22458

22459

+;; Comparison operators for <F>CM.

22460

+(define_code_iterator COMPARISONS [lt le eq ge gt])

22461

+

22462

+;; Unsigned comparison operators.

22463

+(define_code_iterator UCOMPARISONS [ltu leu geu gtu])

22464

+

22465

;; -------------------------------------------------------------------

22466

;; Code Attributes

22467

;; -------------------------------------------------------------------

22468

@@ -571,8 +576,29 @@

22469

(eq "eq")

22470

(ne "ne")

22471

(lt "lt")

22472

- (ge "ge")])

22473

+ (ge "ge")

22474

+ (le "le")

22475

+ (gt "gt")

22476

+ (ltu "ltu")

22477

+ (leu "leu")

22478

+ (geu "geu")

22479

+ (gtu "gtu")])

22480

22481

+;; For comparison operators we use the FCM* and CM* instructions.

22482

+;; As there are no CMLE or CMLT instructions which act on 3 vector

22483

+;; operands, we must use CMGE or CMGT and swap the order of the

22484

+;; source operands.

22485

+

22486

+(define_code_attr n_optab [(lt "gt") (le "ge") (eq "eq") (ge "ge") (gt "gt")

22487

+ (ltu "hi") (leu "hs") (geu "hs") (gtu "hi")])

22488

+(define_code_attr cmp_1 [(lt "2") (le "2") (eq "1") (ge "1") (gt "1")

22489

+ (ltu "2") (leu "2") (geu "1") (gtu "1")])

22490

+(define_code_attr cmp_2 [(lt "1") (le "1") (eq "2") (ge "2") (gt "2")

22491

+ (ltu "1") (leu "1") (geu "2") (gtu "2")])

22492

+

22493

+(define_code_attr CMP [(lt "LT") (le "LE") (eq "EQ") (ge "GE") (gt "GT")

22494

+ (ltu "LTU") (leu "LEU") (geu "GEU") (gtu "GTU")])

22495

+

22496

;; Optab prefix for sign/zero-extending operations

22497

(define_code_attr su_optab [(sign_extend "") (zero_extend "u")

22498

(div "") (udiv "u")

22499

@@ -680,11 +706,6 @@

22500

UNSPEC_SQSHRN UNSPEC_UQSHRN

22501

UNSPEC_SQRSHRN UNSPEC_UQRSHRN])

22502

22503

-(define_int_iterator VCMP_S [UNSPEC_CMEQ UNSPEC_CMGE UNSPEC_CMGT

22504

- UNSPEC_CMLE UNSPEC_CMLT])

22505

-

22506

-(define_int_iterator VCMP_U [UNSPEC_CMHS UNSPEC_CMHI UNSPEC_CMTST])

22507

-

22508

(define_int_iterator PERMUTE [UNSPEC_ZIP1 UNSPEC_ZIP2

22509

UNSPEC_TRN1 UNSPEC_TRN2

22510

UNSPEC_UZP1 UNSPEC_UZP2])

22511

@@ -768,12 +789,6 @@

22512

(UNSPEC_RADDHN2 "add")

22513

(UNSPEC_RSUBHN2 "sub")])

22514

22515

-(define_int_attr cmp [(UNSPEC_CMGE "ge") (UNSPEC_CMGT "gt")

22516

- (UNSPEC_CMLE "le") (UNSPEC_CMLT "lt")

22517

- (UNSPEC_CMEQ "eq")

22518

- (UNSPEC_CMHS "hs") (UNSPEC_CMHI "hi")

22519

- (UNSPEC_CMTST "tst")])

22520

-

22521

(define_int_attr offsetlr [(UNSPEC_SSLI "1") (UNSPEC_USLI "1")

22522

(UNSPEC_SSRI "0") (UNSPEC_USRI "0")])

22523

22524

Index: gcc/config/rs6000/rs6000.c

22525

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

22526

--- a/src/gcc/config/rs6000/rs6000.c (.../tags/gcc_4_8_2_release)

22527

+++ b/src/gcc/config/rs6000/rs6000.c (.../branches/gcc-4_8-branch)

22528

@@ -5428,12 +5428,13 @@

22529

break;

22530

22531

case TFmode:

22532

- case TDmode:

22533

- case TImode:

22534

if (TARGET_E500_DOUBLE)

22535

return (SPE_CONST_OFFSET_OK (offset)

22536

&& SPE_CONST_OFFSET_OK (offset + 8));

22537

+ /* fall through */

22538

22539

+ case TDmode:

22540

+ case TImode:

22541

extra = 8;

22542

if (!worst_case)

22543

break;

22544

Index: gcc/config/rs6000/rs6000.md

22545

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

22546

--- a/src/gcc/config/rs6000/rs6000.md (.../tags/gcc_4_8_2_release)

22547

+++ b/src/gcc/config/rs6000/rs6000.md (.../branches/gcc-4_8-branch)

22548

@@ -2412,7 +2412,7 @@

22549

(match_operand:SI 2 "gpc_reg_operand" "r,r"))

22550

(const_int 0)))

22551

(clobber (match_scratch:SI 3 "=r,r"))]

22552

- ""

22553

+ "TARGET_32BIT"

22554

"@

22555

mullw. %3,%1,%2

22556

#"

22557

@@ -2425,7 +2425,7 @@

22558

(match_operand:SI 2 "gpc_reg_operand" ""))

22559

(const_int 0)))

22560

(clobber (match_scratch:SI 3 ""))]

22561

- "reload_completed"

22562

+ "TARGET_32BIT && reload_completed"

22563

[(set (match_dup 3)

22564

(mult:SI (match_dup 1) (match_dup 2)))

22565

(set (match_dup 0)

22566

@@ -2440,7 +2440,7 @@

22567

(const_int 0)))

22568

(set (match_operand:SI 0 "gpc_reg_operand" "=r,r")

22569

(mult:SI (match_dup 1) (match_dup 2)))]

22570

- ""

22571

+ "TARGET_32BIT"

22572

"@

22573

mullw. %0,%1,%2

22574

#"

22575

@@ -2454,7 +2454,7 @@

22576

(const_int 0)))

22577

(set (match_operand:SI 0 "gpc_reg_operand" "")

22578

(mult:SI (match_dup 1) (match_dup 2)))]

22579

- "reload_completed"

22580

+ "TARGET_32BIT && reload_completed"

22581

[(set (match_dup 0)

22582

(mult:SI (match_dup 1) (match_dup 2)))

22583

(set (match_dup 3)

22584

Index: gcc/config/arm/arm.c

22585

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

22586

--- a/src/gcc/config/arm/arm.c (.../tags/gcc_4_8_2_release)

22587

+++ b/src/gcc/config/arm/arm.c (.../branches/gcc-4_8-branch)

22588

@@ -5425,7 +5425,8 @@

22589

if (!crtl->uses_pic_offset_table)

22590

{

22591

gcc_assert (can_create_pseudo_p ());

22592

- if (arm_pic_register != INVALID_REGNUM)

22593

+ if (arm_pic_register != INVALID_REGNUM

22594

+ && !(TARGET_THUMB1 && arm_pic_register > LAST_LO_REGNUM))

22595

{

22596

if (!cfun->machine->pic_reg)

22597

cfun->machine->pic_reg = gen_rtx_REG (Pmode, arm_pic_register);

22598

@@ -5451,7 +5452,12 @@

22599

crtl->uses_pic_offset_table = 1;

22600

start_sequence ();

22601

22602

- arm_load_pic_register (0UL);

22603

+ if (TARGET_THUMB1 && arm_pic_register != INVALID_REGNUM

22604

+ && arm_pic_register > LAST_LO_REGNUM)

22605

+ emit_move_insn (cfun->machine->pic_reg,

22606

+ gen_rtx_REG (Pmode, arm_pic_register));

22607

+ else

22608

+ arm_load_pic_register (0UL);

22609

22610

seq = get_insns ();

22611

end_sequence ();

22612

@@ -5709,6 +5715,14 @@

22613

emit_insn (gen_movsi (pic_offset_table_rtx, pic_tmp));

22614

emit_insn (gen_pic_add_dot_plus_four (pic_reg, pic_reg, labelno));

22615

}

22616

+ else if (arm_pic_register != INVALID_REGNUM

22617

+ && arm_pic_register > LAST_LO_REGNUM

22618

+ && REGNO (pic_reg) <= LAST_LO_REGNUM)

22619

+ {

22620

+ emit_insn (gen_pic_load_addr_unified (pic_reg, pic_rtx, labelno));

22621

+ emit_move_insn (gen_rtx_REG (Pmode, arm_pic_register), pic_reg);

22622

+ emit_use (gen_rtx_REG (Pmode, arm_pic_register));

22623

+ }

22624

else

22625

emit_insn (gen_pic_load_addr_unified (pic_reg, pic_rtx, labelno));

22626

}

22627

@@ -23555,6 +23569,7 @@

22628

num_regs = bit_count (saved_regs_mask);

22629

if ((offsets->outgoing_args != (1 + num_regs)) || cfun->calls_alloca)

22630

{

22631

+ emit_insn (gen_blockage ());

22632

/* Unwind the stack to just below the saved registers. */

22633

emit_insn (gen_addsi3 (stack_pointer_rtx,

22634

hard_frame_pointer_rtx,

22635

@@ -23583,8 +23598,8 @@

22636

22637

if (crtl->calls_eh_return)

22638

emit_insn (gen_addsi3 (stack_pointer_rtx,

22639

- stack_pointer_rtx,

22640

- GEN_INT (ARM_EH_STACKADJ_REGNUM)));

22641

+ stack_pointer_rtx,

22642

+ gen_rtx_REG (SImode, ARM_EH_STACKADJ_REGNUM)));

22643

22644

if (IS_STACKALIGN (func_type))

22645

/* Restore the original stack pointer. Before prologue, the stack was

22646

Index: gcc/config/arm/vfp.md

22647

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

22648

--- a/src/gcc/config/arm/vfp.md (.../tags/gcc_4_8_2_release)

22649

+++ b/src/gcc/config/arm/vfp.md (.../branches/gcc-4_8-branch)

22650

@@ -1264,6 +1264,7 @@

22651

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

22652

"vrint<vrint_variant>%?.<V_if_elem>\\t%<V_reg>0, %<V_reg>1"

22653

[(set_attr "predicable" "<vrint_predicable>")

22654

+ (set_attr "conds" "<vrint_conds>")

22655

(set_attr "type" "f_rint<vfp_type>")]

22656

)

22657

22658

@@ -1280,7 +1281,8 @@

22659

(match_operand:SDF 2 "register_operand" "<F_constraint>")))]

22660

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

22661

"vmaxnm.<V_if_elem>\\t%<V_reg>0, %<V_reg>1, %<V_reg>2"

22662

- [(set_attr "type" "f_minmax<vfp_type>")]

22663

+ [(set_attr "type" "f_minmax<vfp_type>")

22664

+ (set_attr "conds" "unconditional")]

22665

)

22666

22667

(define_insn "smin<mode>3"

22668

@@ -1289,7 +1291,8 @@

22669

(match_operand:SDF 2 "register_operand" "<F_constraint>")))]

22670

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

22671

"vminnm.<V_if_elem>\\t%<V_reg>0, %<V_reg>1, %<V_reg>2"

22672

- [(set_attr "type" "f_minmax<vfp_type>")]

22673

+ [(set_attr "type" "f_minmax<vfp_type>")

22674

+ (set_attr "conds" "unconditional")]

22675

)

22676

22677

;; Unimplemented insns:

22678

Index: gcc/config/arm/iterators.md

22679

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

22680

--- a/src/gcc/config/arm/iterators.md (.../tags/gcc_4_8_2_release)

22681

+++ b/src/gcc/config/arm/iterators.md (.../branches/gcc-4_8-branch)

22682

@@ -493,6 +493,10 @@

22683

(UNSPEC_VRINTA "no") (UNSPEC_VRINTM "no")

22684

(UNSPEC_VRINTR "yes") (UNSPEC_VRINTX "yes")])

22685

22686

+(define_int_attr vrint_conds [(UNSPEC_VRINTZ "nocond") (UNSPEC_VRINTP "unconditional")

22687

+ (UNSPEC_VRINTA "unconditional") (UNSPEC_VRINTM "unconditional")

22688

+ (UNSPEC_VRINTR "nocond") (UNSPEC_VRINTX "nocond")])

22689

+

22690

(define_int_attr nvrint_variant [(UNSPEC_NVRINTZ "z") (UNSPEC_NVRINTP "p")

22691

(UNSPEC_NVRINTA "a") (UNSPEC_NVRINTM "m")

22692

(UNSPEC_NVRINTX "x") (UNSPEC_NVRINTN "n")])

22693

Index: gcc/config/pa/pa.c

22694

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

22695

--- a/src/gcc/config/pa/pa.c (.../tags/gcc_4_8_2_release)

22696

+++ b/src/gcc/config/pa/pa.c (.../branches/gcc-4_8-branch)

22697

@@ -10522,13 +10522,13 @@

22698

22699

/* When INT14_OK_STRICT is false, a secondary reload is needed

22700

to adjust the displacement of SImode and DImode floating point

22701

- instructions. So, we return false when STRICT is true. We

22702

+ instructions but this may fail when the register also needs

22703

+ reloading. So, we return false when STRICT is true. We

22704

also reject long displacements for float mode addresses since

22705

the majority of accesses will use floating point instructions

22706

that don't support 14-bit offsets. */

22707

if (!INT14_OK_STRICT

22708

- && reload_in_progress

22709

- && strict

22710

+ && (strict || !(reload_in_progress || reload_completed))

22711

&& mode != QImode

22712

&& mode != HImode)

22713

return false;

22714

@@ -10588,8 +10588,7 @@

22715

return true;

22716

22717

if (!INT14_OK_STRICT

22718

- && reload_in_progress

22719

- && strict

22720

+ && (strict || !(reload_in_progress || reload_completed))

22721

&& mode != QImode

22722

&& mode != HImode)

22723

return false;

22724

Index: gcc/config/mips/driver-native.c

22725

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

22726

--- a/src/gcc/config/mips/driver-native.c (.../tags/gcc_4_8_2_release)

22727

+++ b/src/gcc/config/mips/driver-native.c (.../branches/gcc-4_8-branch)

22728

@@ -58,11 +58,17 @@

22729

if (strncmp (buf, "cpu model", sizeof ("cpu model") - 1) == 0)

22730

{

22731

if (strstr (buf, "Godson2 V0.2") != NULL

22732

- || strstr (buf, "Loongson-2 V0.2") != NULL)

22733

+ || strstr (buf, "Loongson-2 V0.2") != NULL

22734

+ || strstr (buf, "Loongson-2E") != NULL)

22735

cpu = "loongson2e";

22736

else if (strstr (buf, "Godson2 V0.3") != NULL

22737

- || strstr (buf, "Loongson-2 V0.3") != NULL)

22738

+ || strstr (buf, "Loongson-2 V0.3") != NULL

22739

+ || strstr (buf, "Loongson-2F") != NULL)

22740

cpu = "loongson2f";

22741

+ else if (strstr (buf, "Godson3 V0.5") != NULL

22742

+ || strstr (buf, "Loongson-3 V0.5") != NULL

22743

+ || strstr (buf, "Loongson-3A") != NULL)

22744

+ cpu = "loongson3a";

22745

else if (strstr (buf, "SiByte SB1") != NULL)

22746

cpu = "sb1";

22747

else if (strstr (buf, "R5000") != NULL)

22748

Index: gcc/config/mips/mips.md

22749

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

22750

--- a/src/gcc/config/mips/mips.md (.../tags/gcc_4_8_2_release)

22751

+++ b/src/gcc/config/mips/mips.md (.../branches/gcc-4_8-branch)

22752

@@ -73,6 +73,11 @@

22753

UNSPEC_STORE_LEFT

22754

UNSPEC_STORE_RIGHT

22755

22756

+ ;; Integer operations that are too cumbersome to describe directly.

22757

+ UNSPEC_WSBH

22758

+ UNSPEC_DSBH

22759

+ UNSPEC_DSHD

22760

+

22761

;; Floating-point moves.

22762

UNSPEC_LOAD_LOW

22763

UNSPEC_LOAD_HIGH

22764

@@ -1294,20 +1299,32 @@

22765

22766

;; Combiner patterns for unsigned byte-add.

22767

22768

-(define_insn "*baddu_si"

22769

+(define_insn "*baddu_si_eb"

22770

[(set (match_operand:SI 0 "register_operand" "=d")

22771

(zero_extend:SI

22772

- (plus:QI (match_operand:QI 1 "register_operand" "d")

22773

- (match_operand:QI 2 "register_operand" "d"))))]

22774

- "ISA_HAS_BADDU"

22775

+ (subreg:QI

22776

+ (plus:SI (match_operand:SI 1 "register_operand" "d")

22777

+ (match_operand:SI 2 "register_operand" "d")) 3)))]

22778

+ "ISA_HAS_BADDU && BYTES_BIG_ENDIAN"

22779

"baddu\\t%0,%1,%2"

22780

[(set_attr "alu_type" "add")])

22781

22782

+(define_insn "*baddu_si_el"

22783

+ [(set (match_operand:SI 0 "register_operand" "=d")

22784

+ (zero_extend:SI

22785

+ (subreg:QI

22786

+ (plus:SI (match_operand:SI 1 "register_operand" "d")

22787

+ (match_operand:SI 2 "register_operand" "d")) 0)))]

22788

+ "ISA_HAS_BADDU && !BYTES_BIG_ENDIAN"

22789

+ "baddu\\t%0,%1,%2"

22790

+ [(set_attr "alu_type" "add")])

22791

+

22792

(define_insn "*baddu_di<mode>"

22793

[(set (match_operand:GPR 0 "register_operand" "=d")

22794

(zero_extend:GPR

22795

- (plus:QI (truncate:QI (match_operand:DI 1 "register_operand" "d"))

22796

- (truncate:QI (match_operand:DI 2 "register_operand" "d")))))]

22797

+ (truncate:QI

22798

+ (plus:DI (match_operand:DI 1 "register_operand" "d")

22799

+ (match_operand:DI 2 "register_operand" "d")))))]

22800

"ISA_HAS_BADDU && TARGET_64BIT"

22801

"baddu\\t%0,%1,%2"

22802

[(set_attr "alu_type" "add")])

22803

@@ -5367,6 +5384,56 @@

22804

}

22805

[(set_attr "type" "shift")

22806

(set_attr "mode" "<MODE>")])

22807

+

22808

+(define_insn "bswaphi2"

22809

+ [(set (match_operand:HI 0 "register_operand" "=d")

22810

+ (bswap:HI (match_operand:HI 1 "register_operand" "d")))]

22811

+ "ISA_HAS_WSBH"

22812

+ "wsbh\t%0,%1"

22813

+ [(set_attr "type" "shift")])

22814

+

22815

+(define_insn_and_split "bswapsi2"

22816

+ [(set (match_operand:SI 0 "register_operand" "=d")

22817

+ (bswap:SI (match_operand:SI 1 "register_operand" "d")))]

22818

+ "ISA_HAS_WSBH && ISA_HAS_ROR"

22819

+ "#"

22820

+ ""

22821

+ [(set (match_dup 0) (unspec:SI [(match_dup 1)] UNSPEC_WSBH))

22822

+ (set (match_dup 0) (rotatert:SI (match_dup 0) (const_int 16)))]

22823

+ ""

22824

+ [(set_attr "length" "8")])

22825

+

22826

+(define_insn_and_split "bswapdi2"

22827

+ [(set (match_operand:DI 0 "register_operand" "=d")

22828

+ (bswap:DI (match_operand:DI 1 "register_operand" "d")))]

22829

+ "TARGET_64BIT && ISA_HAS_WSBH"

22830

+ "#"

22831

+ ""

22832

+ [(set (match_dup 0) (unspec:DI [(match_dup 1)] UNSPEC_DSBH))

22833

+ (set (match_dup 0) (unspec:DI [(match_dup 0)] UNSPEC_DSHD))]

22834

+ ""

22835

+ [(set_attr "length" "8")])

22836

+

22837

+(define_insn "wsbh"

22838

+ [(set (match_operand:SI 0 "register_operand" "=d")

22839

+ (unspec:SI [(match_operand:SI 1 "register_operand" "d")] UNSPEC_WSBH))]

22840

+ "ISA_HAS_WSBH"

22841

+ "wsbh\t%0,%1"

22842

+ [(set_attr "type" "shift")])

22843

+

22844

+(define_insn "dsbh"

22845

+ [(set (match_operand:DI 0 "register_operand" "=d")

22846

+ (unspec:DI [(match_operand:DI 1 "register_operand" "d")] UNSPEC_DSBH))]

22847

+ "TARGET_64BIT && ISA_HAS_WSBH"

22848

+ "dsbh\t%0,%1"

22849

+ [(set_attr "type" "shift")])

22850

+

22851

+(define_insn "dshd"

22852

+ [(set (match_operand:DI 0 "register_operand" "=d")

22853

+ (unspec:DI [(match_operand:DI 1 "register_operand" "d")] UNSPEC_DSHD))]

22854

+ "TARGET_64BIT && ISA_HAS_WSBH"

22855

+ "dshd\t%0,%1"

22856

+ [(set_attr "type" "shift")])

22857

22858

;;

22859

;; ....................

22860

Index: gcc/config/mips/mips.c

22861

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

22862

--- a/src/gcc/config/mips/mips.c (.../tags/gcc_4_8_2_release)

22863

+++ b/src/gcc/config/mips/mips.c (.../branches/gcc-4_8-branch)

22864

@@ -3560,17 +3560,6 @@

22865

}

22866

}

22867

22868

-/* Return the cost of an operand X that can be trucated for free.

22869

- SPEED says whether we're optimizing for size or speed. */

22870

-

22871

-static int

22872

-mips_truncated_op_cost (rtx x, bool speed)

22873

-{

22874

- if (GET_CODE (x) == TRUNCATE)

22875

- x = XEXP (x, 0);

22876

- return set_src_cost (x, speed);

22877

-}

22878

-

22879

/* Implement TARGET_RTX_COSTS. */

22880

22881

static bool

22882

@@ -3951,13 +3940,12 @@

22883

case ZERO_EXTEND:

22884

if (outer_code == SET

22885

&& ISA_HAS_BADDU

22886

+ && (GET_CODE (XEXP (x, 0)) == TRUNCATE

22887

+ || GET_CODE (XEXP (x, 0)) == SUBREG)

22888

&& GET_MODE (XEXP (x, 0)) == QImode

22889

- && GET_CODE (XEXP (x, 0)) == PLUS)

22890

+ && GET_CODE (XEXP (XEXP (x, 0), 0)) == PLUS)

22891

{

22892

- rtx plus = XEXP (x, 0);

22893

- *total = (COSTS_N_INSNS (1)

22894

- + mips_truncated_op_cost (XEXP (plus, 0), speed)

22895

- + mips_truncated_op_cost (XEXP (plus, 1), speed));

22896

+ *total = set_src_cost (XEXP (XEXP (x, 0), 0), speed);

22897

return true;

22898

}

22899

*total = mips_zero_extend_cost (mode, XEXP (x, 0));

22900

Index: gcc/config/mips/mips.h

22901

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

22902

--- a/src/gcc/config/mips/mips.h (.../tags/gcc_4_8_2_release)

22903

+++ b/src/gcc/config/mips/mips.h (.../branches/gcc-4_8-branch)

22904

@@ -949,6 +949,11 @@

22905

|| TARGET_SMARTMIPS) \

22906

&& !TARGET_MIPS16)

22907

22908

+/* ISA has the WSBH (word swap bytes within halfwords) instruction.

22909

+ 64-bit targets also provide DSBH and DSHD. */

22910

+#define ISA_HAS_WSBH ((ISA_MIPS32R2 || ISA_MIPS64R2) \

22911

+ && !TARGET_MIPS16)

22912

+

22913

/* ISA has data prefetch instructions. This controls use of 'pref'. */

22914

#define ISA_HAS_PREFETCH ((ISA_MIPS4 \

22915

|| TARGET_LOONGSON_2EF \

22916

Index: gcc/regcprop.c

22917

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

22918

--- a/src/gcc/regcprop.c (.../tags/gcc_4_8_2_release)

22919

+++ b/src/gcc/regcprop.c (.../branches/gcc-4_8-branch)

22920

@@ -747,6 +747,7 @@

22921

int n_ops, i, alt, predicated;

22922

bool is_asm, any_replacements;

22923

rtx set;

22924

+ rtx link;

22925

bool replaced[MAX_RECOG_OPERANDS];

22926

bool changed = false;

22927

struct kill_set_value_data ksvd;

22928

@@ -815,6 +816,23 @@

22929

if (recog_op_alt[i][alt].earlyclobber)

22930

kill_value (recog_data.operand[i], vd);

22931

22932

+ /* If we have dead sets in the insn, then we need to note these as we

22933

+ would clobbers. */

22934

+ for (link = REG_NOTES (insn); link; link = XEXP (link, 1))

22935

+ {

22936

+ if (REG_NOTE_KIND (link) == REG_UNUSED)

22937

+ {

22938

+ kill_value (XEXP (link, 0), vd);

22939

+ /* Furthermore, if the insn looked like a single-set,

22940

+ but the dead store kills the source value of that

22941

+ set, then we can no-longer use the plain move

22942

+ special case below. */

22943

+ if (set

22944

+ && reg_overlap_mentioned_p (XEXP (link, 0), SET_SRC (set)))

22945

+ set = NULL;

22946

+ }

22947

+ }

22948

+

22949

/* Special-case plain move instructions, since we may well

22950

be able to do the move from a different register class. */

22951

if (set && REG_P (SET_SRC (set)))

22952

Index: libgo/configure

22953

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

22954

--- a/src/libgo/configure (.../tags/gcc_4_8_2_release)

22955

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

22956

@@ -14700,7 +14700,7 @@

22957

fi

22958

22959

22960

-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

22961

+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

22962

do :

22963

as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh`

22964

ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var"

22965

Index: libgo/Makefile.in

22966

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

22967

--- a/src/libgo/Makefile.in (.../tags/gcc_4_8_2_release)

22968

+++ b/src/libgo/Makefile.in (.../branches/gcc-4_8-branch)

22969

@@ -195,7 +195,7 @@

22970

@LIBGO_IS_LINUX_TRUE@am__objects_5 = getncpu-linux.lo

22971

am__objects_6 = go-append.lo go-assert.lo go-assert-interface.lo \

22972

go-byte-array-to-string.lo go-breakpoint.lo go-caller.lo \

22973

- go-callers.lo go-can-convert-interface.lo go-cgo.lo \

22974

+ go-callers.lo go-can-convert-interface.lo go-cdiv.lo go-cgo.lo \

22975

go-check-interface.lo go-construct-map.lo \

22976

go-convert-interface.lo go-copy.lo go-defer.lo \

22977

go-deferred-recover.lo go-eface-compare.lo \

22978

@@ -757,6 +757,7 @@

22979

runtime/go-caller.c \

22980

runtime/go-callers.c \

22981

runtime/go-can-convert-interface.c \

22982

+ runtime/go-cdiv.c \

22983

runtime/go-cgo.c \

22984

runtime/go-check-interface.c \

22985

runtime/go-construct-map.c \

22986

@@ -1446,7 +1447,7 @@

22987

go/go/build/build.go \

22988

go/go/build/doc.go \

22989

go/go/build/read.go \

22990

- syslist.go

22991

+ go/go/build/syslist.go

22992

22993

go_go_doc_files = \

22994

go/go/doc/comment.go \

22995

@@ -2368,6 +2369,7 @@

22996

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-caller.Plo@am__quote@

22997

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-callers.Plo@am__quote@

22998

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-can-convert-interface.Plo@am__quote@

22999

+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-cdiv.Plo@am__quote@

23000

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-cgo.Plo@am__quote@

23001

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-check-interface.Plo@am__quote@

23002

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-construct-map.Plo@am__quote@

23003

@@ -2554,6 +2556,13 @@

23004

@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@

23005

@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

23006

23007

+go-cdiv.lo: runtime/go-cdiv.c

23008

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

23009

+@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/go-cdiv.Tpo $(DEPDIR)/go-cdiv.Plo

23010

+@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='runtime/go-cdiv.c' object='go-cdiv.lo' libtool=yes @AMDEPBACKSLASH@

23011

+@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@

23012

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

23013

+

23014

go-cgo.lo: runtime/go-cgo.c

23015

@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

23016

@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/go-cgo.Tpo $(DEPDIR)/go-cgo.Plo

23017

@@ -5062,15 +5071,6 @@

23018

@$(CHECK)

23019

.PHONY: go/build/check

23020

23021

-syslist.go: s-syslist; @true

23022

-s-syslist: Makefile

23023

- echo '// Generated automatically by make.' >syslist.go.tmp

23024

- echo 'package build' >>syslist.go.tmp

23025

- echo 'const goosList = "$(GOOS)"' >>syslist.go.tmp

23026

- echo 'const goarchList = "$(GOARCH)"' >>syslist.go.tmp

23027

- $(SHELL) $(srcdir)/../move-if-change syslist.go.tmp syslist.go

23028

- $(STAMP) $@

23029

-

23030

@go_include@ go/doc.lo.dep

23031

go/doc.lo.dep: $(go_go_doc_files)

23032

$(BUILDDEPS)

23033

Index: libgo/runtime/go-defer.c

23034

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

23035

--- a/src/libgo/runtime/go-defer.c (.../tags/gcc_4_8_2_release)

23036

+++ b/src/libgo/runtime/go-defer.c (.../branches/gcc-4_8-branch)

23037

@@ -27,6 +27,7 @@

23038

n->__pfn = pfn;

23039

n->__arg = arg;

23040

n->__retaddr = NULL;

23041

+ n->__makefunc_can_recover = 0;

23042

g->defer = n;

23043

}

23044

23045

Index: libgo/runtime/go-defer.h

23046

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

23047

--- a/src/libgo/runtime/go-defer.h (.../tags/gcc_4_8_2_release)

23048

+++ b/src/libgo/runtime/go-defer.h (.../branches/gcc-4_8-branch)

23049

@@ -34,4 +34,10 @@

23050

set by __go_set_defer_retaddr which is called by the thunks

23051

created by defer statements. */

23052

const void *__retaddr;

23053

+

23054

+ /* Set to true if a function created by reflect.MakeFunc is

23055

+ permitted to recover. The return address of such a function

23056

+ function will be somewhere in libffi, so __retaddr is not

23057

+ useful. */

23058

+ _Bool __makefunc_can_recover;

23059

};

23060

Index: libgo/runtime/go-int-array-to-string.c

23061

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

23062

--- a/src/libgo/runtime/go-int-array-to-string.c (.../tags/gcc_4_8_2_release)

23063

+++ b/src/libgo/runtime/go-int-array-to-string.c (.../branches/gcc-4_8-branch)

23064

@@ -30,6 +30,8 @@

23065

23066

if (v < 0 || v > 0x10ffff)

23067

v = 0xfffd;

23068

+ else if (0xd800 <= v && v <= 0xdfff)

23069

+ v = 0xfffd;

23070

23071

if (v <= 0x7f)

23072

slen += 1;

23073

@@ -56,6 +58,8 @@

23074

character. */

23075

if (v < 0 || v > 0x10ffff)

23076

v = 0xfffd;

23077

+ else if (0xd800 <= v && v <= 0xdfff)

23078

+ v = 0xfffd;

23079

23080

if (v <= 0x7f)

23081

*s++ = v;

23082

Index: libgo/runtime/go-nosys.c

23083

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

23084

--- a/src/libgo/runtime/go-nosys.c (.../tags/gcc_4_8_2_release)

23085

+++ b/src/libgo/runtime/go-nosys.c (.../branches/gcc-4_8-branch)

23086

@@ -43,6 +43,17 @@

23087

}

23088

#endif

23089

23090

+#ifndef HAVE_DUP3

23091

+int

23092

+dup3 (int oldfd __attribute__ ((unused)),

23093

+ int newfd __attribute__ ((unused)),

23094

+ int flags __attribute__ ((unused)))

23095

+{

23096

+ errno = ENOSYS;

23097

+ return -1;

23098

+}

23099

+#endif

23100

+

23101

#ifndef HAVE_EPOLL_CREATE1

23102

int

23103

epoll_create1 (int flags __attribute__ ((unused)))

23104

@@ -112,6 +123,18 @@

23105

}

23106

#endif

23107

23108

+#ifndef HAVE_GETXATTR

23109

+ssize_t

23110

+getxattr (const char *path __attribute__ ((unused)),

23111

+ const char *name __attribute__ ((unused)),

23112

+ void *value __attribute__ ((unused)),

23113

+ size_t size __attribute__ ((unused)))

23114

+{

23115

+ errno = ENOSYS;

23116

+ return -1;

23117

+}

23118

+#endif

23119

+

23120

#ifndef HAVE_INOTIFY_ADD_WATCH

23121

int

23122

inotify_add_watch (int fd __attribute__ ((unused)),

23123

@@ -151,6 +174,17 @@

23124

}

23125

#endif

23126

23127

+#ifndef HAVE_LISTXATTR

23128

+ssize_t

23129

+listxattr (const char *path __attribute__ ((unused)),

23130

+ char *list __attribute__ ((unused)),

23131

+ size_t size __attribute__ ((unused)))

23132

+{

23133

+ errno = ENOSYS;

23134

+ return -1;

23135

+}

23136

+#endif

23137

+

23138

#ifndef HAVE_MKDIRAT

23139

int

23140

mkdirat (int dirfd __attribute__ ((unused)),

23141

@@ -196,6 +230,16 @@

23142

}

23143

#endif

23144

23145

+#ifndef HAVE_REMOVEXATTR

23146

+int

23147

+removexattr (const char *path __attribute__ ((unused)),

23148

+ const char *name __attribute__ ((unused)))

23149

+{

23150

+ errno = ENOSYS;

23151

+ return -1;

23152

+}

23153

+#endif

23154

+

23155

#ifndef HAVE_RENAMEAT

23156

int

23157

renameat (int olddirfd __attribute__ ((unused)),

23158

@@ -208,6 +252,19 @@

23159

}

23160

#endif

23161

23162

+#ifndef HAVE_SETXATTR

23163

+int

23164

+setxattr (const char *path __attribute__ ((unused)),

23165

+ const char *name __attribute__ ((unused)),

23166

+ const void *value __attribute__ ((unused)),

23167

+ size_t size __attribute__ ((unused)),

23168

+ int flags __attribute__ ((unused)))

23169

+{

23170

+ errno = ENOSYS;

23171

+ return -1;

23172

+}

23173

+#endif

23174

+

23175

#ifndef HAVE_SPLICE

23176

int

23177

splice (int fd __attribute__ ((unused)),

23178

Index: libgo/runtime/runtime.h

23179

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

23180

--- a/src/libgo/runtime/runtime.h (.../tags/gcc_4_8_2_release)

23181

+++ b/src/libgo/runtime/runtime.h (.../branches/gcc-4_8-branch)

23182

@@ -440,7 +440,7 @@

23183

};

23184

void runtime_hashinit(void);

23185

23186

-void runtime_traceback();

23187

+void runtime_traceback(void);

23188

void runtime_tracebackothers(G*);

23189

23190

/*

23191

@@ -756,6 +756,7 @@

23192

extern _Bool __go_file_line(uintptr, String*, String*, intgo *);

23193

extern byte* runtime_progname();

23194

extern void runtime_main(void*);

23195

+extern uint32 runtime_in_callers;

23196

23197

int32 getproccount(void);

23198

23199

Index: libgo/runtime/proc.c

23200

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

23201

--- a/src/libgo/runtime/proc.c (.../tags/gcc_4_8_2_release)

23202

+++ b/src/libgo/runtime/proc.c (.../branches/gcc-4_8-branch)

23203

@@ -2239,6 +2239,14 @@

23204

if(prof.fn == nil || prof.hz == 0)

23205

return;

23206

23207

+ if(runtime_atomicload(&runtime_in_callers) > 0) {

23208

+ // If SIGPROF arrived while already fetching runtime

23209

+ // callers we can have trouble on older systems

23210

+ // because the unwind library calls dl_iterate_phdr

23211

+ // which was not recursive in the past.

23212

+ return;

23213

+ }

23214

+

23215

runtime_lock(&prof);

23216

if(prof.fn == nil) {

23217

runtime_unlock(&prof);

23218

Index: libgo/runtime/mgc0.c

23219

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

23220

--- a/src/libgo/runtime/mgc0.c (.../tags/gcc_4_8_2_release)

23221

+++ b/src/libgo/runtime/mgc0.c (.../branches/gcc-4_8-branch)

23222

@@ -239,8 +239,7 @@

23223

// (Manually inlined copy of MHeap_LookupMaybe.)

23224

k = (uintptr)obj>>PageShift;

23225

x = k;

23226

- if(sizeof(void*) == 8)

23227

- x -= (uintptr)runtime_mheap->arena_start>>PageShift;

23228

+ x -= (uintptr)runtime_mheap->arena_start>>PageShift;

23229

s = runtime_mheap->map[x];

23230

if(s == nil || k < s->start || k - s->start >= s->npages || s->state != MSpanInUse)

23231

return false;

23232

@@ -418,8 +417,7 @@

23233

// (Manually inlined copy of MHeap_LookupMaybe.)

23234

k = (uintptr)obj>>PageShift;

23235

x = k;

23236

- if(sizeof(void*) == 8)

23237

- x -= (uintptr)arena_start>>PageShift;

23238

+ x -= (uintptr)arena_start>>PageShift;

23239

s = runtime_mheap->map[x];

23240

if(s == nil || k < s->start || k - s->start >= s->npages || s->state != MSpanInUse)

23241

continue;

23242

@@ -466,8 +464,7 @@

23243

// Ask span about size class.

23244

// (Manually inlined copy of MHeap_Lookup.)

23245

x = (uintptr)obj >> PageShift;

23246

- if(sizeof(void*) == 8)

23247

- x -= (uintptr)arena_start>>PageShift;

23248

+ x -= (uintptr)arena_start>>PageShift;

23249

s = runtime_mheap->map[x];

23250

23251

PREFETCH(obj);

23252

@@ -585,8 +582,7 @@

23253

if(t == nil)

23254

return;

23255

x = (uintptr)obj >> PageShift;

23256

- if(sizeof(void*) == 8)

23257

- x -= (uintptr)(runtime_mheap->arena_start)>>PageShift;

23258

+ x -= (uintptr)(runtime_mheap->arena_start)>>PageShift;

23259

s = runtime_mheap->map[x];

23260

objstart = (byte*)((uintptr)s->start<<PageShift);

23261

if(s->sizeclass != 0) {

23262

Index: libgo/runtime/go-signal.c

23263

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

23264

--- a/src/libgo/runtime/go-signal.c (.../tags/gcc_4_8_2_release)

23265

+++ b/src/libgo/runtime/go-signal.c (.../branches/gcc-4_8-branch)

23266

@@ -234,7 +234,7 @@

23267

G *g;

23268

23269

g = runtime_g ();

23270

- runtime_traceback (g);

23271

+ runtime_traceback ();

23272

runtime_tracebackothers (g);

23273

23274

/* The gc library calls runtime_dumpregs here, and provides

23275

@@ -399,6 +399,9 @@

23276

{

23277

G *gp;

23278

M *mp;

23279

+#ifdef USING_SPLIT_STACK

23280

+ void *stack_context[10];

23281

+#endif

23282

23283

/* We are now running on the stack registered via sigaltstack.

23284

(Actually there is a small span of time between runtime_siginit

23285

@@ -409,7 +412,7 @@

23286

if (gp != NULL)

23287

{

23288

#ifdef USING_SPLIT_STACK

23289

- __splitstack_getcontext (&gp->stack_context[0]);

23290

+ __splitstack_getcontext (&stack_context[0]);

23291

#endif

23292

}

23293

23294

@@ -432,7 +435,7 @@

23295

if (gp != NULL)

23296

{

23297

#ifdef USING_SPLIT_STACK

23298

- __splitstack_setcontext (&gp->stack_context[0]);

23299

+ __splitstack_setcontext (&stack_context[0]);

23300

#endif

23301

}

23302

}

23303

Index: libgo/runtime/go-callers.c

23304

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

23305

--- a/src/libgo/runtime/go-callers.c (.../tags/gcc_4_8_2_release)

23306

+++ b/src/libgo/runtime/go-callers.c (.../branches/gcc-4_8-branch)

23307

@@ -11,6 +11,13 @@

23308

#include "runtime.h"

23309

#include "array.h"

23310

23311

+/* This is set to non-zero when calling backtrace_full. This is used

23312

+ to avoid getting hanging on a recursive lock in dl_iterate_phdr on

23313

+ older versions of glibc when a SIGPROF signal arrives while

23314

+ collecting a backtrace. */

23315

+

23316

+uint32 runtime_in_callers;

23317

+

23318

/* Argument passed to callback function. */

23319

23320

struct callers_data

23321

@@ -111,8 +118,10 @@

23322

data.skip = skip + 1;

23323

data.index = 0;

23324

data.max = m;

23325

+ runtime_xadd (&runtime_in_callers, 1);

23326

backtrace_full (__go_get_backtrace_state (), 0, callback, error_callback,

23327

&data);

23328

+ runtime_xadd (&runtime_in_callers, -1);

23329

return data.index;

23330

}

23331

23332

Index: libgo/runtime/go-cdiv.c

23333

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

23334

--- a/src/libgo/runtime/go-cdiv.c (.../tags/gcc_4_8_2_release)

23335

+++ b/src/libgo/runtime/go-cdiv.c (.../branches/gcc-4_8-branch)

23336

@@ -0,0 +1,46 @@

23337

+/* go-cdiv.c -- complex division routines

23338

+

23339

23340

+ Use of this source code is governed by a BSD-style

23341

+ license that can be found in the LICENSE file. */

23342

+

23343

+/* Calls to these functions are generated by the Go frontend for

23344

+ division of complex64 or complex128. We use these because Go's

23345

+ complex division expects slightly different results from the GCC

23346

+ default. When dividing NaN+1.0i / 0+0i, Go expects NaN+NaNi but

23347

+ GCC generates NaN+Infi. NaN+Infi seems wrong seems the rules of

23348

+ C99 Annex G specify that if either side of a complex number is Inf,

23349

+ the the whole number is Inf, but an operation involving NaN ought

23350

+ to result in NaN, not Inf. */

23351

+

23352

+__complex float

23353

+__go_complex64_div (__complex float a, __complex float b)

23354

+{

23355

+ if (__builtin_expect (b == 0+0i, 0))

23356

+ {

23357

+ if (!__builtin_isinff (__real__ a)

23358

+ && !__builtin_isinff (__imag__ a)

23359

+ && (__builtin_isnanf (__real__ a) || __builtin_isnanf (__imag__ a)))

23360

+ {

23361

+ /* Pass "1" to nanf to match math/bits.go. */

23362

+ return __builtin_nanf("1") + __builtin_nanf("1")*1i;

23363

+ }

23364

+ }

23365

+ return a / b;

23366

+}

23367

+

23368

+__complex double

23369

+__go_complex128_div (__complex double a, __complex double b)

23370

+{

23371

+ if (__builtin_expect (b == 0+0i, 0))

23372

+ {

23373

+ if (!__builtin_isinf (__real__ a)

23374

+ && !__builtin_isinf (__imag__ a)

23375

+ && (__builtin_isnan (__real__ a) || __builtin_isnan (__imag__ a)))

23376

+ {

23377

+ /* Pass "1" to nan to match math/bits.go. */

23378

+ return __builtin_nan("1") + __builtin_nan("1")*1i;

23379

+ }

23380

+ }

23381

+ return a / b;

23382

+}

23383

Index: libgo/runtime/go-reflect-call.c

23384

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

23385

--- a/src/libgo/runtime/go-reflect-call.c (.../tags/gcc_4_8_2_release)

23386

+++ b/src/libgo/runtime/go-reflect-call.c (.../branches/gcc-4_8-branch)

23387

@@ -98,9 +98,12 @@

23388

const struct __go_struct_field *fields;

23389

int i;

23390

23391

+ field_count = descriptor->__fields.__count;

23392

+ if (field_count == 0) {

23393

+ return &ffi_type_void;

23394

+ }

23395

ret = (ffi_type *) __go_alloc (sizeof (ffi_type));

23396

ret->type = FFI_TYPE_STRUCT;

23397

- field_count = descriptor->__fields.__count;

23398

fields = (const struct __go_struct_field *) descriptor->__fields.__values;

23399

ret->elements = (ffi_type **) __go_alloc ((field_count + 1)

23400

* sizeof (ffi_type *));

23401

Index: libgo/runtime/go-recover.c

23402

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

23403

--- a/src/libgo/runtime/go-recover.c (.../tags/gcc_4_8_2_release)

23404

+++ b/src/libgo/runtime/go-recover.c (.../branches/gcc-4_8-branch)

23405

@@ -16,12 +16,14 @@

23406

__go_can_recover--this is, the thunk. */

23407

23408

_Bool

23409

-__go_can_recover (const void* retaddr)

23410

+__go_can_recover (const void *retaddr)

23411

{

23412

G *g;

23413

struct __go_defer_stack *d;

23414

const char* ret;

23415

const char* dret;

23416

+ Location loc;

23417

+ const byte *name;

23418

23419

g = runtime_g ();

23420

23421

@@ -52,9 +54,80 @@

23422

#endif

23423

23424

dret = (const char *) d->__retaddr;

23425

- return ret <= dret && ret + 16 >= dret;

23426

+ if (ret <= dret && ret + 16 >= dret)

23427

+ return 1;

23428

+

23429

+ /* If the function calling recover was created by reflect.MakeFunc,

23430

+ then RETADDR will be somewhere in libffi. Our caller is

23431

+ permitted to recover if it was called from libffi. */

23432

+ if (!d->__makefunc_can_recover)

23433

+ return 0;

23434

+

23435

+ if (runtime_callers (2, &loc, 1) < 1)

23436

+ return 0;

23437

+

23438

+ /* If we have no function name, then we weren't called by Go code.

23439

+ Guess that we were called by libffi. */

23440

+ if (loc.function.len == 0)

23441

+ return 1;

23442

+

23443

+ if (loc.function.len < 4)

23444

+ return 0;

23445

+ name = loc.function.str;

23446

+ if (*name == '_')

23447

+ {

23448

+ if (loc.function.len < 5)

23449

+ return 0;

23450

+ ++name;

23451

+ }

23452

+

23453

+ if (name[0] == 'f' && name[1] == 'f' && name[2] == 'i' && name[3] == '_')

23454

+ return 1;

23455

+

23456

+ /* We may also be called by reflect.makeFuncImpl.call, for a

23457

+ function created by reflect.MakeFunc. */

23458

+ if (__builtin_strstr ((const char *) name, "makeFuncImpl") != NULL)

23459

+ return 1;

23460

+

23461

+ return 0;

23462

}

23463

23464

+/* This function is called when code is about to enter a function

23465

+ created by reflect.MakeFunc. It is called by the function stub

23466

+ used by MakeFunc. If the stub is permitted to call recover, then a

23467

+ real MakeFunc function is permitted to call recover. */

23468

+

23469

+void

23470

+__go_makefunc_can_recover (const void *retaddr)

23471

+{

23472

+ struct __go_defer_stack *d;

23473

+

23474

+ d = runtime_g ()->defer;

23475

+ if (d != NULL

23476

+ && !d->__makefunc_can_recover

23477

+ && __go_can_recover (retaddr))

23478

+ d->__makefunc_can_recover = 1;

23479

+}

23480

+

23481

+/* This function is called when code is about to exit a function

23482

+ created by reflect.MakeFunc. It is called by the function stub

23483

+ used by MakeFunc. It clears the __makefunc_can_recover field.

23484

+ It's OK to always clear this field, because __go_can_recover will

23485

+ only be called by a stub created for a function that calls recover.

23486

+ That stub will not call a function created by reflect.MakeFunc, so

23487

+ by the time we get here any caller higher up on the call stack no

23488

+ longer needs the information. */

23489

+

23490

+void

23491

+__go_makefunc_returning (void)

23492

+{

23493

+ struct __go_defer_stack *d;

23494

+

23495

+ d = runtime_g ()->defer;

23496

+ if (d != NULL)

23497

+ d->__makefunc_can_recover = 0;

23498

+}

23499

+

23500

/* This is only called when it is valid for the caller to recover the

23501

value on top of the panic stack, if there is one. */

23502

23503

Index: libgo/runtime/malloc.goc

23504

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

23505

--- a/src/libgo/runtime/malloc.goc (.../tags/gcc_4_8_2_release)

23506

+++ b/src/libgo/runtime/malloc.goc (.../branches/gcc-4_8-branch)

23507

@@ -541,8 +541,7 @@

23508

23509

// (Manually inlined copy of runtime_MHeap_Lookup)

23510

p = (uintptr)v>>PageShift;

23511

- if(sizeof(void*) == 8)

23512

- p -= (uintptr)runtime_mheap->arena_start >> PageShift;

23513

+ p -= (uintptr)runtime_mheap->arena_start >> PageShift;

23514

s = runtime_mheap->map[p];

23515

23516

if(s->sizeclass == 0) {

23517

Index: libgo/runtime/go-make-slice.c

23518

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

23519

--- a/src/libgo/runtime/go-make-slice.c (.../tags/gcc_4_8_2_release)

23520

+++ b/src/libgo/runtime/go-make-slice.c (.../branches/gcc-4_8-branch)

23521

@@ -34,7 +34,10 @@

23522

std = (const struct __go_slice_type *) td;

23523

23524

ilen = (intgo) len;

23525

- if (ilen < 0 || (uintptr_t) ilen != len)

23526

+ if (ilen < 0

23527

+ || (uintptr_t) ilen != len

23528

+ || (std->__element_type->__size > 0

23529

+ && len > MaxMem / std->__element_type->__size))

23530

runtime_panicstring ("makeslice: len out of range");

23531

23532

icap = (intgo) cap;

23533

Index: libgo/runtime/mheap.c

23534

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

23535

--- a/src/libgo/runtime/mheap.c (.../tags/gcc_4_8_2_release)

23536

+++ b/src/libgo/runtime/mheap.c (.../branches/gcc-4_8-branch)

23537

@@ -150,8 +150,7 @@

23538

runtime_MSpan_Init(t, s->start + npage, s->npages - npage);

23539

s->npages = npage;

23540

p = t->start;

23541

- if(sizeof(void*) == 8)

23542

- p -= ((uintptr)h->arena_start>>PageShift);

23543

+ p -= ((uintptr)h->arena_start>>PageShift);

23544

if(p > 0)

23545

h->map[p-1] = s;

23546

h->map[p] = t;

23547

@@ -169,8 +168,7 @@

23548

s->elemsize = (sizeclass==0 ? s->npages<<PageShift : (uintptr)runtime_class_to_size[sizeclass]);

23549

s->types.compression = MTypes_Empty;

23550

p = s->start;

23551

- if(sizeof(void*) == 8)

23552

- p -= ((uintptr)h->arena_start>>PageShift);

23553

+ p -= ((uintptr)h->arena_start>>PageShift);

23554

for(n=0; n<npage; n++)

23555

h->map[p+n] = s;

23556

return s;

23557

@@ -241,8 +239,7 @@

23558

mstats.mspan_sys = h->spanalloc.sys;

23559

runtime_MSpan_Init(s, (uintptr)v>>PageShift, ask>>PageShift);

23560

p = s->start;

23561

- if(sizeof(void*) == 8)

23562

- p -= ((uintptr)h->arena_start>>PageShift);

23563

+ p -= ((uintptr)h->arena_start>>PageShift);

23564

h->map[p] = s;

23565

h->map[p + s->npages - 1] = s;

23566

s->state = MSpanInUse;

23567

@@ -259,8 +256,7 @@

23568

uintptr p;

23569

23570

p = (uintptr)v;

23571

- if(sizeof(void*) == 8)

23572

- p -= (uintptr)h->arena_start;

23573

+ p -= (uintptr)h->arena_start;

23574

return h->map[p >> PageShift];

23575

}

23576

23577

@@ -281,8 +277,7 @@

23578

return nil;

23579

p = (uintptr)v>>PageShift;

23580

q = p;

23581

- if(sizeof(void*) == 8)

23582

- q -= (uintptr)h->arena_start >> PageShift;

23583

+ q -= (uintptr)h->arena_start >> PageShift;

23584

s = h->map[q];

23585

if(s == nil || p < s->start || p - s->start >= s->npages)

23586

return nil;

23587

@@ -332,8 +327,7 @@

23588

23589

// Coalesce with earlier, later spans.

23590

p = s->start;

23591

- if(sizeof(void*) == 8)

23592

- p -= (uintptr)h->arena_start >> PageShift;

23593

+ p -= (uintptr)h->arena_start >> PageShift;

23594

if(p > 0 && (t = h->map[p-1]) != nil && t->state != MSpanInUse) {

23595

tp = (uintptr*)(t->start<<PageShift);

23596

*tp |= *sp; // propagate "needs zeroing" mark

23597

Index: libgo/mksysinfo.sh

23598

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

23599

--- a/src/libgo/mksysinfo.sh (.../tags/gcc_4_8_2_release)

23600

+++ b/src/libgo/mksysinfo.sh (.../branches/gcc-4_8-branch)

23601

@@ -1035,6 +1035,10 @@

23602

grep '^const _LOCK_' gen-sysinfo.go |

23603

sed -e 's/^$const $_$LOCK_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

23604

23605

+# The PRIO constants.

23606

+grep '^const _PRIO_' gen-sysinfo.go | \

23607

+ sed -e 's/^$const $_$PRIO_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

23608

+

23609

# The GNU/Linux LINUX_REBOOT flags.

23610

grep '^const _LINUX_REBOOT_' gen-sysinfo.go |

23611

sed -e 's/^$const $_$LINUX_REBOOT_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

23612

Index: libgo/config.h.in

23613

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

23614

--- a/src/libgo/config.h.in (.../tags/gcc_4_8_2_release)

23615

+++ b/src/libgo/config.h.in (.../branches/gcc-4_8-branch)

23616

@@ -39,6 +39,9 @@

23617

/* Define to 1 if you have the `dl_iterate_phdr' function. */

23618

#undef HAVE_DL_ITERATE_PHDR

23619

23620

+/* Define to 1 if you have the `dup3' function. */

23621

+#undef HAVE_DUP3

23622

+

23623

/* Define to 1 if you have the `epoll_create1' function. */

23624

#undef HAVE_EPOLL_CREATE1

23625

23626

@@ -66,6 +69,9 @@

23627

/* Define if _Unwind_GetIPInfo is available. */

23628

#undef HAVE_GETIPINFO

23629

23630

+/* Define to 1 if you have the `getxattr' function. */

23631

+#undef HAVE_GETXATTR

23632

+

23633

/* Define to 1 if you have the `inotify_add_watch' function. */

23634

#undef HAVE_INOTIFY_ADD_WATCH

23635

23636

@@ -111,6 +117,9 @@

23637

/* Define to 1 if you have the <linux/rtnetlink.h> header file. */

23638

#undef HAVE_LINUX_RTNETLINK_H

23639

23640

+/* Define to 1 if you have the `listxattr' function. */

23641

+#undef HAVE_LISTXATTR

23642

+

23643

/* Define to 1 if the system has the type `loff_t'. */

23644

#undef HAVE_LOFF_T

23645

23646

@@ -171,6 +180,9 @@

23647

/* Define to 1 if you have the `pipe2' function. */

23648

#undef HAVE_PIPE2

23649

23650

+/* Define to 1 if you have the `removexattr' function. */

23651

+#undef HAVE_REMOVEXATTR

23652

+

23653

/* Define to 1 if you have the `renameat' function. */

23654

#undef HAVE_RENAMEAT

23655

23656

@@ -180,6 +192,9 @@

23657

/* Define to 1 if you have the `setenv' function. */

23658

#undef HAVE_SETENV

23659

23660

+/* Define to 1 if you have the `setxattr' function. */

23661

+#undef HAVE_SETXATTR

23662

+

23663

/* Define to 1 if you have the `sinl' function. */

23664

#undef HAVE_SINL

23665

23666

Index: libgo/configure.ac

23667

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

23668

--- a/src/libgo/configure.ac (.../tags/gcc_4_8_2_release)

23669

+++ b/src/libgo/configure.ac (.../branches/gcc-4_8-branch)

23670

@@ -503,7 +503,7 @@

23671

AM_CONDITIONAL(HAVE_STRERROR_R, test "$ac_cv_func_strerror_r" = yes)

23672

AM_CONDITIONAL(HAVE_WAIT4, test "$ac_cv_func_wait4" = yes)

23673

23674

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

23675

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

23676

AC_TYPE_OFF_T

23677

AC_CHECK_TYPES([loff_t])

23678

23679

Index: libgo/go/reflect/value.go

23680

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

23681

--- a/src/libgo/go/reflect/value.go (.../tags/gcc_4_8_2_release)

23682

+++ b/src/libgo/go/reflect/value.go (.../branches/gcc-4_8-branch)

23683

@@ -98,6 +98,7 @@

23684

flagIndir

23685

flagAddr

23686

flagMethod

23687

+ flagMethodFn // gccgo: first fn parameter is always pointer

23688

flagKindShift = iota

23689

flagKindWidth = 5 // there are 27 kinds

23690

flagKindMask flag = 1<<flagKindWidth - 1

23691

@@ -433,7 +434,7 @@

23692

if v.flag&flagMethod != 0 {

23693

nin++

23694

}

23695

- firstPointer := len(in) > 0 && t.In(0).Kind() != Ptr && v.flag&flagMethod == 0 && isMethod(v.typ)

23696

+ firstPointer := len(in) > 0 && t.In(0).Kind() != Ptr && v.flag&flagMethodFn != 0

23697

params := make([]unsafe.Pointer, nin)

23698

off := 0

23699

if v.flag&flagMethod != 0 {

23700

@@ -484,33 +485,6 @@

23701

return ret

23702

}

23703

23704

-// gccgo specific test to see if typ is a method. We can tell by

23705

-// looking at the string to see if there is a receiver. We need this

23706

-// because for gccgo all methods take pointer receivers.

23707

-func isMethod(t *rtype) bool {

23708

- if Kind(t.kind) != Func {

23709

- return false

23710

- }

23711

- s := *t.string

23712

- parens := 0

23713

- params := 0

23714

- sawRet := false

23715

- for i, c := range s {

23716

- if c == '(' {

23717

- if parens == 0 {

23718

- params++

23719

- }

23720

- parens++

23721

- } else if c == ')' {

23722

- parens--

23723

- } else if parens == 0 && c == ' ' && s[i+1] != '(' && !sawRet {

23724

- params++

23725

- sawRet = true

23726

- }

23727

- }

23728

- return params > 2

23729

-}

23730

-

23731

// methodReceiver returns information about the receiver

23732

// described by v. The Value v may or may not have the

23733

// flagMethod bit set, so the kind cached in v.flag should

23734

@@ -917,6 +891,16 @@

23735

v = makeMethodValue("Interface", v)

23736

}

23737

23738

+ if v.flag&flagMethodFn != 0 {

23739

+ if v.typ.Kind() != Func {

23740

+ panic("reflect: MethodFn of non-Func")

23741

+ }

23742

+ ft := (*funcType)(unsafe.Pointer(v.typ))

23743

+ if ft.in[0].Kind() != Ptr {

23744

+ v = makeValueMethod(v)

23745

+ }

23746

+ }

23747

+

23748

k := v.kind()

23749

if k == Interface {

23750

// Special case: return the element inside the interface.

23751

@@ -1230,8 +1214,7 @@

23752

// created via reflect have the same underlying code pointer,

23753

// so their Pointers are equal. The function used here must

23754

// match the one used in makeMethodValue.

23755

- // This is not properly implemented for gccgo.

23756

- f := Zero

23757

+ f := makeFuncStub

23758

return **(**uintptr)(unsafe.Pointer(&f))

23759

}

23760

p := v.val

23761

Index: libgo/go/reflect/makefuncgo_386.go

23762

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

23763

--- a/src/libgo/go/reflect/makefuncgo_386.go (.../tags/gcc_4_8_2_release)

23764

+++ b/src/libgo/go/reflect/makefuncgo_386.go (.../branches/gcc-4_8-branch)

23765

@@ -14,8 +14,10 @@

23766

// registers that might hold result values.

23767

type i386Regs struct {

23768

esp uint32

23769

- eax uint32 // Value to return in %eax.

23770

- st0 uint64 // Value to return in %st(0).

23771

+ eax uint32 // Value to return in %eax.

23772

+ st0 float64 // Value to return in %st(0).

23773

+ sr bool // Set to true if hidden struct pointer.

23774

+ sf bool // Set to true if returning float

23775

}

23776

23777

// MakeFuncStubGo implements the 386 calling convention for MakeFunc.

23778

@@ -56,10 +58,13 @@

23779

in := make([]Value, 0, len(ftyp.in))

23780

ap := uintptr(regs.esp)

23781

23782

+ regs.sr = false

23783

+ regs.sf = false

23784

var retPtr unsafe.Pointer

23785

if retStruct {

23786

retPtr = *(*unsafe.Pointer)(unsafe.Pointer(ap))

23787

ap += ptrSize

23788

+ regs.sr = true

23789

}

23790

23791

for _, rt := range ftyp.in {

23792

@@ -77,7 +82,7 @@

23793

23794

// Call the real function.

23795

23796

- out := c.fn(in)

23797

+ out := c.call(in)

23798

23799

if len(out) != len(ftyp.out) {

23800

panic("reflect: wrong return count from function created by MakeFunc")

23801

@@ -123,13 +128,16 @@

23802

23803

v := out[0]

23804

w := v.iword()

23805

- if v.Kind() != Ptr && v.Kind() != UnsafePointer {

23806

- w = loadIword(unsafe.Pointer(w), v.typ.size)

23807

- }

23808

switch v.Kind() {

23809

- case Float32, Float64:

23810

- regs.st0 = uint64(uintptr(w))

23811

+ case Ptr, UnsafePointer:

23812

+ regs.eax = uint32(uintptr(w))

23813

+ case Float32:

23814

+ regs.st0 = float64(*(*float32)(unsafe.Pointer(w)))

23815

+ regs.sf = true

23816

+ case Float64:

23817

+ regs.st0 = *(*float64)(unsafe.Pointer(w))

23818

+ regs.sf = true

23819

default:

23820

- regs.eax = uint32(uintptr(w))

23821

+ regs.eax = uint32(uintptr(loadIword(unsafe.Pointer(w), v.typ.size)))

23822

}

23823

}

23824

Index: libgo/go/reflect/makefunc_amd64.S

23825

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

23826

--- a/src/libgo/go/reflect/makefunc_amd64.S (.../tags/gcc_4_8_2_release)

23827

+++ b/src/libgo/go/reflect/makefunc_amd64.S (.../branches/gcc-4_8-branch)

23828

@@ -61,6 +61,14 @@

23829

movdqa %xmm6, 0xa0(%rsp)

23830

movdqa %xmm7, 0xb0(%rsp)

23831

23832

+ /* For MakeFunc functions that call recover. */

23833

+ movq 8(%rbp), %rdi

23834

+#ifdef __PIC__

23835

+ call __go_makefunc_can_recover@PLT

23836

+#else

23837

+ call __go_makefunc_can_recover

23838

+#endif

23839

+

23840

# Get function type.

23841

#ifdef __PIC__

23842

call __go_get_closure@PLT

23843

@@ -77,6 +85,13 @@

23844

call reflect.MakeFuncStubGo

23845

#endif

23846

23847

+ /* MakeFunc functions can no longer call recover. */

23848

+#ifdef __PIC__

23849

+ call __go_makefunc_returning@PLT

23850

+#else

23851

+ call __go_makefunc_returning

23852

+#endif

23853

+

23854

# The structure will be updated with any return values. Load

23855

# all possible return registers before returning to the caller.

23856

23857

Index: libgo/go/reflect/type.go

23858

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

23859

--- a/src/libgo/go/reflect/type.go (.../tags/gcc_4_8_2_release)

23860

+++ b/src/libgo/go/reflect/type.go (.../branches/gcc-4_8-branch)

23861

@@ -508,7 +508,7 @@

23862

m.Type = toType(mt)

23863

x := new(unsafe.Pointer)

23864

*x = unsafe.Pointer(&p.tfn)

23865

- m.Func = Value{mt, unsafe.Pointer(x), fl | flagIndir}

23866

+ m.Func = Value{mt, unsafe.Pointer(x), fl | flagIndir | flagMethodFn}

23867

m.Index = i

23868

return

23869

}

23870

Index: libgo/go/reflect/makefunc_386.S

23871

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

23872

--- a/src/libgo/go/reflect/makefunc_386.S (.../tags/gcc_4_8_2_release)

23873

+++ b/src/libgo/go/reflect/makefunc_386.S (.../branches/gcc-4_8-branch)

23874

@@ -25,9 +25,13 @@

23875

struct {

23876

esp uint32 // 0x0

23877

eax uint32 // 0x4

23878

- st0 uint64 // 0x8

23879

+ st0 float64 // 0x8

23880

+ sr bool // 0x10

23881

+ sf bool // 0x11

23882

}

23883

- */

23884

+ The sr field is set by the function to a non-zero value if

23885

+ the function takes a struct hidden pointer that must be

23886

+ popped off the stack. */

23887

23888

pushl %ebp

23889

.LCFI0:

23890

@@ -45,7 +49,16 @@

23891

leal 8(%ebp), %eax /* Set esp field in struct. */

23892

movl %eax, -24(%ebp)

23893

23894

+ /* For MakeFunc functions that call recover. */

23895

+ movl 4(%ebp), %eax

23896

+ movl %eax, (%esp)

23897

#ifdef __PIC__

23898

+ call __go_makefunc_can_recover@PLT

23899

+#else

23900

+ call __go_makefunc_can_recover

23901

+#endif

23902

+

23903

+#ifdef __PIC__

23904

call __go_get_closure@PLT

23905

#else

23906

call __go_get_closure

23907

@@ -62,9 +75,20 @@

23908

call reflect.MakeFuncStubGo

23909

#endif

23910

23911

+ /* MakeFunc functions can no longer call recover. */

23912

+#ifdef __PIC__

23913

+ call __go_makefunc_returning@PLT

23914

+#else

23915

+ call __go_makefunc_returning

23916

+#endif

23917

+

23918

/* Set return registers. */

23919

23920

movl -20(%ebp), %eax

23921

+

23922

+ cmpb $0, -7(%ebp)

23923

+ je 2f

23924

+

23925

fldl -16(%ebp)

23926

23927

#ifdef __SSE2__

23928

@@ -73,12 +97,20 @@

23929

movsd -16(%ebp), %xmm0

23930

#endif

23931

23932

+2:

23933

+ movb -8(%ebp), %dl

23934

+

23935

addl $36, %esp

23936

popl %ebx

23937

.LCFI3:

23938

popl %ebp

23939

.LCFI4:

23940

+

23941

+ testb %dl,%dl

23942

+ jne 1f

23943

ret

23944

+1:

23945

+ ret $4

23946

.LFE1:

23947

#ifdef __ELF__

23948

.size reflect.makeFuncStub, . - reflect.makeFuncStub

23949

Index: libgo/go/reflect/all_test.go

23950

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

23951

--- a/src/libgo/go/reflect/all_test.go (.../tags/gcc_4_8_2_release)

23952

+++ b/src/libgo/go/reflect/all_test.go (.../branches/gcc-4_8-branch)

23953

@@ -1430,6 +1430,46 @@

23954

}

23955

}

23956

23957

+type emptyStruct struct{}

23958

+

23959

+type nonEmptyStruct struct {

23960

+ member int

23961

+}

23962

+

23963

+func returnEmpty() emptyStruct {

23964

+ return emptyStruct{}

23965

+}

23966

+

23967

+func takesEmpty(e emptyStruct) {

23968

+}

23969

+

23970

+func returnNonEmpty(i int) nonEmptyStruct {

23971

+ return nonEmptyStruct{member: i}

23972

+}

23973

+

23974

+func takesNonEmpty(n nonEmptyStruct) int {

23975

+ return n.member

23976

+}

23977

+

23978

+func TestCallWithStruct(t *testing.T) {

23979

+ r := ValueOf(returnEmpty).Call([]Value{})

23980

+ if len(r) != 1 || r[0].Type() != TypeOf(emptyStruct{}) {

23981

+ t.Errorf("returning empty struct returned %s instead", r)

23982

+ }

23983

+ r = ValueOf(takesEmpty).Call([]Value{ValueOf(emptyStruct{})})

23984

+ if len(r) != 0 {

23985

+ t.Errorf("takesEmpty returned values: %s", r)

23986

+ }

23987

+ r = ValueOf(returnNonEmpty).Call([]Value{ValueOf(42)})

23988

+ if len(r) != 1 || r[0].Type() != TypeOf(nonEmptyStruct{}) || r[0].Field(0).Int() != 42 {

23989

+ t.Errorf("returnNonEmpty returned %s", r)

23990

+ }

23991

+ r = ValueOf(takesNonEmpty).Call([]Value{ValueOf(nonEmptyStruct{member: 42})})

23992

+ if len(r) != 1 || r[0].Type() != TypeOf(1) || r[0].Int() != 42 {

23993

+ t.Errorf("takesNonEmpty returned %s", r)

23994

+ }

23995

+}

23996

+

23997

func TestMakeFunc(t *testing.T) {

23998

switch runtime.GOARCH {

23999

case "amd64", "386":

24000

@@ -1587,9 +1627,13 @@

24001

}

24002

}

24003

24004

-/* Not yet implemented for gccgo

24005

+func TestMethodValue(t *testing.T) {

24006

+ switch runtime.GOARCH {

24007

+ case "amd64", "386":

24008

+ default:

24009

+ t.Skip("reflect method values not implemented for " + runtime.GOARCH)

24010

+ }

24011

24012

-func TestMethodValue(t *testing.T) {

24013

p := Point{3, 4}

24014

var i int64

24015

24016

@@ -1658,8 +1702,6 @@

24017

}

24018

}

24019

24020

-*/

24021

-

24022

// Reflect version of $GOROOT/test/method5.go

24023

24024

// Concrete types implementing M method.

24025

@@ -1744,14 +1786,18 @@

24026

func (t4 Tm4) M(x int, b byte) (byte, int) { return b, x + 40 }

24027

24028

func TestMethod5(t *testing.T) {

24029

- /* Not yet used for gccgo

24030

+ switch runtime.GOARCH {

24031

+ case "amd64", "386":

24032

+ default:

24033

+ t.Skip("reflect method values not implemented for " + runtime.GOARCH)

24034

+ }

24035

+

24036

CheckF := func(name string, f func(int, byte) (byte, int), inc int) {

24037

b, x := f(1000, 99)

24038

if b != 99 || x != 1000+inc {

24039

t.Errorf("%s(1000, 99) = %v, %v, want 99, %v", name, b, x, 1000+inc)

24040

}

24041

}

24042

- */

24043

24044

CheckV := func(name string, i Value, inc int) {

24045

bx := i.Method(0).Call([]Value{ValueOf(1000), ValueOf(byte(99))})

24046

@@ -1761,9 +1807,7 @@

24047

t.Errorf("direct %s.M(1000, 99) = %v, %v, want 99, %v", name, b, x, 1000+inc)

24048

}

24049

24050

- /* Not yet implemented for gccgo

24051

CheckF(name+".M", i.Method(0).Interface().(func(int, byte) (byte, int)), inc)

24052

- */

24053

}

24054

24055

var TinterType = TypeOf(new(Tinter)).Elem()

24056

Index: libgo/go/reflect/makefunc.go

24057

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

24058

--- a/src/libgo/go/reflect/makefunc.go (.../tags/gcc_4_8_2_release)

24059

+++ b/src/libgo/go/reflect/makefunc.go (.../branches/gcc-4_8-branch)

24060

@@ -17,6 +17,11 @@

24061

code uintptr

24062

typ *funcType

24063

fn func([]Value) []Value

24064

+

24065

+ // For gccgo we use the same entry point for functions and for

24066

+ // method values.

24067

+ method int

24068

+ rcvr Value

24069

}

24070

24071

// MakeFunc returns a new function of the given Type

24072

@@ -61,7 +66,7 @@

24073

dummy := makeFuncStub

24074

code := **(**uintptr)(unsafe.Pointer(&dummy))

24075

24076

- impl := &makeFuncImpl{code: code, typ: ftyp, fn: fn}

24077

+ impl := &makeFuncImpl{code: code, typ: ftyp, fn: fn, method: -1}

24078

24079

return Value{t, unsafe.Pointer(&impl), flag(Func<<flagKindShift) | flagIndir}

24080

}

24081

@@ -85,15 +90,94 @@

24082

panic("reflect: internal error: invalid use of makePartialFunc")

24083

}

24084

24085

+ switch runtime.GOARCH {

24086

+ case "amd64", "386":

24087

+ default:

24088

+ panic("reflect.makeMethodValue not implemented for " + runtime.GOARCH)

24089

+ }

24090

+

24091

// Ignoring the flagMethod bit, v describes the receiver, not the method type.

24092

fl := v.flag & (flagRO | flagAddr | flagIndir)

24093

fl |= flag(v.typ.Kind()) << flagKindShift

24094

rcvr := Value{v.typ, v.val, fl}

24095

24096

+ // v.Type returns the actual type of the method value.

24097

+ ft := v.Type().(*rtype)

24098

+

24099

+ // Indirect Go func value (dummy) to obtain

24100

+ // actual code address. (A Go func value is a pointer

24101

+ // to a C function pointer. http://golang.org/s/go11func.)

24102

+ dummy := makeFuncStub

24103

+ code := **(**uintptr)(unsafe.Pointer(&dummy))

24104

+

24105

// Cause panic if method is not appropriate.

24106

// The panic would still happen during the call if we omit this,

24107

// but we want Interface() and other operations to fail early.

24108

- methodReceiver(op, rcvr, int(v.flag)>>flagMethodShift)

24109

+ t, _, _ := methodReceiver(op, rcvr, int(v.flag)>>flagMethodShift)

24110

24111

- panic("reflect makeMethodValue not implemented")

24112

+ fv := &makeFuncImpl{

24113

+ code: code,

24114

+ typ: (*funcType)(unsafe.Pointer(t)),

24115

+ method: int(v.flag) >> flagMethodShift,

24116

+ rcvr: rcvr,

24117

+ }

24118

+

24119

+ return Value{ft, unsafe.Pointer(&fv), v.flag&flagRO | flag(Func)<<flagKindShift | flagIndir}

24120

}

24121

+

24122

+// makeValueMethod takes a method function and returns a function that

24123

+// takes a value receiver and calls the real method with a pointer to

24124

+// it.

24125

+func makeValueMethod(v Value) Value {

24126

+ typ := v.typ

24127

+ if typ.Kind() != Func {

24128

+ panic("reflect: call of makeValueMethod with non-Func type")

24129

+ }

24130

+ if v.flag&flagMethodFn == 0 {

24131

+ panic("reflect: call of makeValueMethod with non-MethodFn")

24132

+ }

24133

+

24134

+ switch runtime.GOARCH {

24135

+ case "amd64", "386":

24136

+ default:

24137

+ panic("reflect.makeValueMethod not implemented for " + runtime.GOARCH)

24138

+ }

24139

+

24140

+ t := typ.common()

24141

+ ftyp := (*funcType)(unsafe.Pointer(t))

24142

+

24143

+ // Indirect Go func value (dummy) to obtain

24144

+ // actual code address. (A Go func value is a pointer

24145

+ // to a C function pointer. http://golang.org/s/go11func.)

24146

+ dummy := makeFuncStub

24147

+ code := **(**uintptr)(unsafe.Pointer(&dummy))

24148

+

24149

+ impl := &makeFuncImpl{

24150

+ code: code,

24151

+ typ: ftyp,

24152

+ method: -2,

24153

+ rcvr: v,

24154

+ }

24155

+

24156

+ return Value{t, unsafe.Pointer(&impl), flag(Func<<flagKindShift) | flagIndir}

24157

+}

24158

+

24159

+// Call the function represented by a makeFuncImpl.

24160

+func (c *makeFuncImpl) call(in []Value) []Value {

24161

+ if c.method == -1 {

24162

+ return c.fn(in)

24163

+ } else if c.method == -2 {

24164

+ if c.typ.IsVariadic() {

24165

+ return c.rcvr.CallSlice(in)

24166

+ } else {

24167

+ return c.rcvr.Call(in)

24168

+ }

24169

+ } else {

24170

+ m := c.rcvr.Method(c.method)

24171

+ if c.typ.IsVariadic() {

24172

+ return m.CallSlice(in)

24173

+ } else {

24174

+ return m.Call(in)

24175

+ }

24176

+ }

24177

+}

24178

Index: libgo/go/reflect/makefuncgo_amd64.go

24179

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

24180

--- a/src/libgo/go/reflect/makefuncgo_amd64.go (.../tags/gcc_4_8_2_release)

24181

+++ b/src/libgo/go/reflect/makefuncgo_amd64.go (.../branches/gcc-4_8-branch)

24182

@@ -319,7 +319,7 @@

24183

// All the real arguments have been found and turned into

24184

// Value's. Call the real function.

24185

24186

- out := c.fn(in)

24187

+ out := c.call(in)

24188

24189

if len(out) != len(ftyp.out) {

24190

panic("reflect: wrong return count from function created by MakeFunc")

24191

Index: libgo/go/net/fd_unix.go

24192

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

24193

--- a/src/libgo/go/net/fd_unix.go (.../tags/gcc_4_8_2_release)

24194

+++ b/src/libgo/go/net/fd_unix.go (.../branches/gcc-4_8-branch)

24195

@@ -9,6 +9,7 @@

24196

import (

24197

"io"

24198

"os"

24199

+ "runtime"

24200

"sync"

24201

"syscall"

24202

"time"

24203

@@ -90,6 +91,16 @@

24204

if err == nil || err == syscall.EISCONN {

24205

break

24206

}

24207

+

24208

+ // On Solaris we can see EINVAL if the socket has

24209

+ // already been accepted and closed by the server.

24210

+ // Treat this as a successful connection--writes to

24211

+ // the socket will see EOF. For details and a test

24212

+ // case in C see http://golang.org/issue/6828.

24213

+ if runtime.GOOS == "solaris" && err == syscall.EINVAL {

24214

+ break

24215

+ }

24216

+

24217

if err != syscall.EINPROGRESS && err != syscall.EALREADY && err != syscall.EINTR {

24218

return err

24219

}

24220

Index: libgo/go/go/build/syslist.go

24221

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

24222

--- a/src/libgo/go/go/build/syslist.go (.../tags/gcc_4_8_2_release)

24223

+++ b/src/libgo/go/go/build/syslist.go (.../branches/gcc-4_8-branch)

24224

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

24225

24226

+// Use of this source code is governed by a BSD-style

24227

+// license that can be found in the LICENSE file.

24228

+

24229

+package build

24230

+

24231

+const goosList = "darwin dragonfly freebsd linux netbsd openbsd plan9 windows solaris "

24232

+const goarchList = "386 amd64 arm alpha m68k mipso32 mipsn32 mipsn64 mipso64 ppc ppc64 sparc sparc64 "

24233

Index: libgo/go/syscall/libcall_linux.go

24234

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

24235

--- a/src/libgo/go/syscall/libcall_linux.go (.../tags/gcc_4_8_2_release)

24236

+++ b/src/libgo/go/syscall/libcall_linux.go (.../branches/gcc-4_8-branch)

24237

@@ -190,6 +190,9 @@

24238

//sys Adjtimex(buf *Timex) (state int, err error)

24239

//adjtimex(buf *Timex) _C_int

24240

24241

+//sysnb Dup3(oldfd int, newfd int, flags int) (err error)

24242

+//dup3(oldfd _C_int, newfd _C_int, flags _C_int) _C_int

24243

+

24244

//sys Faccessat(dirfd int, path string, mode uint32, flags int) (err error)

24245

//faccessat(dirfd _C_int, pathname *byte, mode _C_int, flags _C_int) _C_int

24246

24247

@@ -268,6 +271,9 @@

24248

return origlen - len(buf), count, names

24249

}

24250

24251

+//sys Getxattr(path string, attr string, dest []byte) (sz int, err error)

24252

+//getxattr(path *byte, attr *byte, buf *byte, count Size_t) Ssize_t

24253

+

24254

//sys InotifyAddWatch(fd int, pathname string, mask uint32) (watchdesc int, err error)

24255

//inotify_add_watch(fd _C_int, pathname *byte, mask uint32) _C_int

24256

24257

@@ -283,6 +289,9 @@

24258

//sys Klogctl(typ int, buf []byte) (n int, err error)

24259

//klogctl(typ _C_int, bufp *byte, len _C_int) _C_int

24260

24261

+//sys Listxattr(path string, dest []byte) (sz int, err error)

24262

+//listxattr(path *byte, list *byte, size Size_t) Ssize_t

24263

+

24264

//sys Mkdirat(dirfd int, path string, mode uint32) (err error)

24265

//mkdirat(dirfd _C_int, path *byte, mode Mode_t) _C_int

24266

24267

@@ -305,6 +314,9 @@

24268

//sys PivotRoot(newroot string, putold string) (err error)

24269

//pivot_root(newroot *byte, putold *byte) _C_int

24270

24271

+//sys Removexattr(path string, attr string) (err error)

24272

+//removexattr(path *byte, name *byte) _C_int

24273

+

24274

//sys Renameat(olddirfd int, oldpath string, newdirfd int, newpath string) (err error)

24275

//renameat(olddirfd _C_int, oldpath *byte, newdirfd _C_int, newpath *byte) _C_int

24276

24277

@@ -338,6 +350,9 @@

24278

//sysnb Setresuid(ruid int, eguid int, suid int) (err error)

24279

//setresuid(ruid Uid_t, euid Uid_t, suid Uid_t) _C_int

24280

24281

+//sys Setxattr(path string, attr string, data []byte, flags int) (err error)

24282

+//setxattr(path *byte, name *byte, value *byte, size Size_t, flags _C_int) _C_int

24283

+

24284

//sys splice(rfd int, roff *_loff_t, wfd int, woff *_loff_t, len int, flags int) (n int64, err error)

24285

//splice(rfd _C_int, roff *_loff_t, wfd _C_int, woff *_loff_t, len Size_t, flags _C_uint) Ssize_t

24286

func Splice(rfd int, roff *int64, wfd int, woff *int64, len int, flags int) (n int64, err error) {

24287

Index: libgo/go/syscall/socket.go

24288

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

24289

--- a/src/libgo/go/syscall/socket.go (.../tags/gcc_4_8_2_release)

24290

+++ b/src/libgo/go/syscall/socket.go (.../branches/gcc-4_8-branch)

24291

@@ -25,7 +25,7 @@

24292

Pad [96]int8

24293

}

24294

24295

-const SizeofSockaddrAny = 0x1c

24296

+const SizeofSockaddrAny = 0x6c

24297

24298

type SockaddrInet4 struct {

24299

Port int

24300

Index: libgo/go/syscall/libcall_posix.go

24301

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

24302

--- a/src/libgo/go/syscall/libcall_posix.go (.../tags/gcc_4_8_2_release)

24303

+++ b/src/libgo/go/syscall/libcall_posix.go (.../branches/gcc-4_8-branch)

24304

@@ -238,6 +238,9 @@

24305

//sysnb Getppid() (ppid int)

24306

//getppid() Pid_t

24307

24308

+//sys Getpriority(which int, who int) (prio int, err error)

24309

+//getpriority(which _C_int, who _C_int) _C_int

24310

+

24311

//sysnb Getrlimit(resource int, rlim *Rlimit) (err error)

24312

//getrlimit(resource _C_int, rlim *Rlimit) _C_int

24313

24314

@@ -307,6 +310,9 @@

24315

//sysnb Setpgid(pid int, pgid int) (err error)

24316

//setpgid(pid Pid_t, pgid Pid_t) _C_int

24317

24318

+//sys Setpriority(which int, who int, prio int) (err error)

24319

+//setpriority(which _C_int, who _C_int, prio _C_int) _C_int

24320

+

24321

//sysnb Setreuid(ruid int, euid int) (err error)

24322

//setreuid(ruid Uid_t, euid Uid_t) _C_int

24323

24324

Index: libgo/Makefile.am

24325

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

24326

--- a/src/libgo/Makefile.am (.../tags/gcc_4_8_2_release)

24327

+++ b/src/libgo/Makefile.am (.../branches/gcc-4_8-branch)

24328

@@ -424,6 +424,7 @@

24329

runtime/go-caller.c \

24330

runtime/go-callers.c \

24331

runtime/go-can-convert-interface.c \

24332

+ runtime/go-cdiv.c \

24333

runtime/go-cgo.c \

24334

runtime/go-check-interface.c \

24335

runtime/go-construct-map.c \

24336

@@ -1254,7 +1255,7 @@

24337

go/go/build/build.go \

24338

go/go/build/doc.go \

24339

go/go/build/read.go \

24340

- syslist.go

24341

+ go/go/build/syslist.go

24342

go_go_doc_files = \

24343

go/go/doc/comment.go \

24344

go/go/doc/doc.go \

24345

@@ -2712,15 +2713,6 @@

24346

@$(CHECK)

24347

.PHONY: go/build/check

24348

24349

-syslist.go: s-syslist; @true

24350

-s-syslist: Makefile

24351

- echo '// Generated automatically by make.' >syslist.go.tmp

24352

- echo 'package build' >>syslist.go.tmp

24353

- echo 'const goosList = "$(GOOS)"' >>syslist.go.tmp

24354

- echo 'const goarchList = "$(GOARCH)"' >>syslist.go.tmp

24355

- $(SHELL) $(srcdir)/../move-if-change syslist.go.tmp syslist.go

24356

- $(STAMP) $@

24357

-

24358

@go_include@ go/doc.lo.dep

24359

go/doc.lo.dep: $(go_go_doc_files)

24360

$(BUILDDEPS)

24361

Index: libcpp/po/pt_BR.po

24362

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

24363

--- a/src/libcpp/po/pt_BR.po (.../tags/gcc_4_8_2_release)

24364

+++ b/src/libcpp/po/pt_BR.po (.../branches/gcc-4_8-branch)

24365

@@ -0,0 +1,908 @@

24366

+# Brazilian Portuguese translation for cpplib

24367

24368

+# This file is distributed under the same license as the gcc package.

24369

+# Rafael Ferreira <rafael.f.f1@gmail.com>, 2013.

24370

+#

24371

+msgid ""

24372

+msgstr ""

24373

+"Project-Id-Version: cpplib 4.8.0\n"

24374

+"Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"

24375

+"POT-Creation-Date: 2013-03-15 17:42+0000\n"

24376

+"PO-Revision-Date: 2013-12-18 03:12-0300\n"

24377

+"Last-Translator: Rafael Ferreira <rafael.f.f1@gmail.com>\n"

24378

+"Language-Team: Brazilian Portuguese <ldpbr-translation@lists.sourceforge.net>\n"

24379

+"Language: pt_BR\n"

24380

+"MIME-Version: 1.0\n"

24381

+"Content-Type: text/plain; charset=UTF-8\n"

24382

+"Content-Transfer-Encoding: 8bit\n"

24383

+"X-Generator: Poedit 1.5.7\n"

24384

+"Plural-Forms: nplurals=2; plural=(n > 1);\n"

24385

+

24386

+#: charset.c:673

24387

+#, c-format

24388

+msgid "conversion from %s to %s not supported by iconv"

24389

+msgstr "sem suporte a conversão de %s para %s por iconv"

24390

+

24391

+#: charset.c:676

24392

+msgid "iconv_open"

24393

+msgstr "iconv_open"

24394

+

24395

+#: charset.c:684

24396

+#, c-format

24397

+msgid "no iconv implementation, cannot convert from %s to %s"

24398

+msgstr "nenhuma implementação iconv, não foi possível converter de %s para %s"

24399

+

24400

+#: charset.c:780

24401

+#, c-format

24402

+msgid "character 0x%lx is not in the basic source character set\n"

24403

+msgstr "caractere 0x%lx não está no conjunto de caracteres fonte básico\n"

24404

+

24405

+#: charset.c:797 charset.c:1443

24406

+msgid "converting to execution character set"

24407

+msgstr "convertendo para conjunto de caracteres da execução"

24408

+

24409

+#: charset.c:803

24410

+#, c-format

24411

+msgid "character 0x%lx is not unibyte in execution character set"

24412

+msgstr "caractere 0x%lx não é unibyte no conjunto de caracteres de execução"

24413

+

24414

+#: charset.c:927

24415

+#, c-format

24416

+msgid "Character %x might not be NFKC"

24417

+msgstr "Caractere %x pode não ser NFKC"

24418

+

24419

+#: charset.c:993

24420

+msgid "universal character names are only valid in C++ and C99"

24421

+msgstr "nomes de caractere universais são válidos apenas em C++ e C99"

24422

+

24423

+#: charset.c:996

24424

+#, c-format

24425

+msgid "the meaning of '\\%c' is different in traditional C"

24426

+msgstr "o significado de \"\\%c\" é diferente em C tradicional"

24427

+

24428

+#: charset.c:1005

24429

+msgid "In _cpp_valid_ucn but not a UCN"

24430

+msgstr "Em _cpp_valid_ucn, mas não é um UCN"

24431

+

24432

+#: charset.c:1030

24433

+#, c-format

24434

+msgid "incomplete universal character name %.*s"

24435

+msgstr "nome de caractere universal incompleto %.*s"

24436

+

24437

+#: charset.c:1045

24438

+#, c-format

24439

+msgid "%.*s is not a valid universal character"

24440

+msgstr "%.*s não é um caractere universal válido"

24441

+

24442

+#: charset.c:1055 lex.c:1117

24443

+msgid "'$' in identifier or number"

24444

+msgstr "\"$\" em identificador ou número"

24445

+

24446

+#: charset.c:1065

24447

+#, c-format

24448

+msgid "universal character %.*s is not valid in an identifier"

24449

+msgstr "caractere universal %.*s não é válido em um identificador"

24450

+

24451

+#: charset.c:1069

24452

+#, c-format

24453

+msgid "universal character %.*s is not valid at the start of an identifier"

24454

+msgstr "caractere universal %.*s não é válido no começo de um identificador"

24455

+

24456

+#: charset.c:1101 charset.c:1673

24457

+msgid "converting UCN to source character set"

24458

+msgstr "convertendo UCN para conjunto de caracteres fonte"

24459

+

24460

+#: charset.c:1105

24461

+msgid "converting UCN to execution character set"

24462

+msgstr "convertendo UCN para conjunto de caracteres de execução"

24463

+

24464

+#: charset.c:1177

24465

+msgid "the meaning of '\\x' is different in traditional C"

24466

+msgstr "o significado de \"\\x\" é diferente em C tradicional"

24467

+

24468

+#: charset.c:1194

24469

+msgid "\\x used with no following hex digits"

24470

+msgstr "\\x usado com nenhum dígito hexa"

24471

+

24472

+#: charset.c:1201

24473

+msgid "hex escape sequence out of range"

24474

+msgstr "sequência de escape hexa fora de alcance"

24475

+

24476

+#: charset.c:1239

24477

+msgid "octal escape sequence out of range"

24478

+msgstr "sequência de escape octal fora de alcance"

24479

+

24480

+#: charset.c:1305

24481

+msgid "the meaning of '\\a' is different in traditional C"

24482

+msgstr "o significado de \"\\a\" é diferente em C tradicional"

24483

+

24484

+#: charset.c:1312

24485

+#, c-format

24486

+msgid "non-ISO-standard escape sequence, '\\%c'"

24487

+msgstr "sequência de escape não padrão ISO, \"\\%c\""

24488

+

24489

+#: charset.c:1320

24490

+#, c-format

24491

+msgid "unknown escape sequence: '\\%c'"

24492

+msgstr "sequência de escape desconhecida: \"\\%c\""

24493

+

24494

+#: charset.c:1328

24495

+#, c-format

24496

+msgid "unknown escape sequence: '\\%s'"

24497

+msgstr "sequência de escape desconhecida: \"\\%s\""

24498

+

24499

+#: charset.c:1335

24500

+msgid "converting escape sequence to execution character set"

24501

+msgstr "convertendo sequência de escape para conjunto de caracteres de execução"

24502

+

24503

+#: charset.c:1508 charset.c:1572

24504

+msgid "character constant too long for its type"

24505

+msgstr "constante caractere muito longa para seu tipo"

24506

+

24507

+#: charset.c:1511

24508

+msgid "multi-character character constant"

24509

+msgstr "constante de caractere multi-caractere"

24510

+

24511

+#: charset.c:1611

24512

+msgid "empty character constant"

24513

+msgstr "constante caractere vazia"

24514

+

24515

+#: charset.c:1720

24516

+#, c-format

24517

+msgid "failure to convert %s to %s"

24518

+msgstr "falha ao converter %s para %s"

24519

+

24520

+#: directives.c:224 directives.c:250

24521

+#, c-format

24522

+msgid "extra tokens at end of #%s directive"

24523

+msgstr "tokens extras ao final da diretiva %#s"

24524

+

24525

+#: directives.c:357

24526

+#, c-format

24527

+msgid "#%s is a GCC extension"

24528

+msgstr "#%s é uma extensão GCC"

24529

+

24530

+#: directives.c:362

24531

+#, c-format

24532

+msgid "#%s is a deprecated GCC extension"

24533

+msgstr "#%s é uma extensão GCC obsoleta"

24534

+

24535

+#: directives.c:375

24536

+msgid "suggest not using #elif in traditional C"

24537

+msgstr "sugere-se não usar #elif em C tradicional"

24538

+

24539

+#: directives.c:378

24540

+#, c-format

24541

+msgid "traditional C ignores #%s with the # indented"

24542

+msgstr "C tradicional ignora #%s com o # com recuo"

24543

+

24544

+#: directives.c:382

24545

+#, c-format

24546

+msgid "suggest hiding #%s from traditional C with an indented #"

24547

+msgstr "sugere-se ocultar #%s do C tradicional com um # com recuo"

24548

+

24549

+#: directives.c:408

24550

+msgid "embedding a directive within macro arguments is not portable"

24551

+msgstr "embutir uma diretiva dentro de argumentos macro não é portátil"

24552

+

24553

+#: directives.c:428

24554

+msgid "style of line directive is a GCC extension"

24555

+msgstr "estilo de diretiva de linha é uma extensão GCC"

24556

+

24557

+#: directives.c:483

24558

+#, c-format

24559

+msgid "invalid preprocessing directive #%s"

24560

+msgstr "diretiva de preprocessamento inválida #%s"

24561

+

24562

+#: directives.c:551

24563

+msgid "\"defined\" cannot be used as a macro name"

24564

+msgstr "\"defined\" não pode ser usado como um nome de macro"

24565

+

24566

+#: directives.c:557

24567

+#, c-format

24568

+msgid "\"%s\" cannot be used as a macro name as it is an operator in C++"

24569

+msgstr "\"%s\" não pode ser usado como um nome de macro, pois é um operador em C++"

24570

+

24571

+#: directives.c:560

24572

+#, c-format

24573

+msgid "no macro name given in #%s directive"

24574

+msgstr "nenhum nome de macro fornecido na diretiva #%s"

24575

+

24576

+#: directives.c:563

24577

+msgid "macro names must be identifiers"

24578

+msgstr "nomes de macro devem ser identificadores"

24579

+

24580

+#: directives.c:612

24581

+#, c-format

24582

+msgid "undefining \"%s\""

24583

+msgstr "removendo definição de \"%s\""

24584

+

24585

+#: directives.c:667

24586

+msgid "missing terminating > character"

24587

+msgstr "faltando caractere terminador >"

24588

+

24589

+#: directives.c:726

24590

+#, c-format

24591

+msgid "#%s expects \"FILENAME\" or <FILENAME>"

24592

+msgstr "#%s espera \"NOME DE ARQUIVO\" OU <NOME DE ARQUIVO>"

24593

+

24594

+#: directives.c:772

24595

+#, c-format

24596

+msgid "empty filename in #%s"

24597

+msgstr "nome de arquivo vazio em #%s"

24598

+

24599

+#: directives.c:782

24600

+msgid "#include nested too deeply"

24601

+msgstr "#include aninhado profundo demais"

24602

+

24603

+#: directives.c:823

24604

+msgid "#include_next in primary source file"

24605

+msgstr "#include_next no arquivo fonte primário"

24606

+

24607

+#: directives.c:849

24608

+#, c-format

24609

+msgid "invalid flag \"%s\" in line directive"

24610

+msgstr "opção inválida \"%s\" na diretiva line"

24611

+

24612

+#: directives.c:909

24613

+msgid "unexpected end of file after #line"

24614

+msgstr "fim de arquivo inesperado após #line"

24615

+

24616

+#: directives.c:912

24617

+#, c-format

24618

+msgid "\"%s\" after #line is not a positive integer"

24619

+msgstr "\"%s\" após #line não é um inteiro positivo"

24620

+

24621

+#: directives.c:918 directives.c:920

24622

+msgid "line number out of range"

24623

+msgstr "número da linha fora de alcance"

24624

+

24625

+#: directives.c:933 directives.c:1013

24626

+#, c-format

24627

+msgid "\"%s\" is not a valid filename"

24628

+msgstr "\"%s\" não é um nome de arquivo válido"

24629

+

24630

+#: directives.c:973

24631

+#, c-format

24632

+msgid "\"%s\" after # is not a positive integer"

24633

+msgstr "\"%s\" após # não é um inteiro positivo"

24634

+

24635

+#: directives.c:1068 directives.c:1070 directives.c:1072 directives.c:1658

24636

+#, c-format

24637

+msgid "%s"

24638

+msgstr "%s"

24639

+

24640

+#: directives.c:1096

24641

+#, c-format

24642

+msgid "invalid #%s directive"

24643

+msgstr "diretiva inválida #%s"

24644

+

24645

+#: directives.c:1159

24646

+#, c-format

24647

+msgid "registering pragmas in namespace \"%s\" with mismatched name expansion"

24648

+msgstr "registrando pragmas em espaço de nomes \"%s\" com expansão de nome incompatível"

24649

+

24650

+#: directives.c:1168

24651

+#, c-format

24652

+msgid "registering pragma \"%s\" with name expansion and no namespace"

24653

+msgstr "registrando pragma \"%s\" com expansão de nome e nenhum espaço de nomes"

24654

+

24655

+#: directives.c:1186

24656

+#, c-format

24657

+msgid "registering \"%s\" as both a pragma and a pragma namespace"

24658

+msgstr "registrando \"%s\" como tanto um pragma e um espaço de nomes de pragma"

24659

+

24660

+#: directives.c:1189

24661

+#, c-format

24662

+msgid "#pragma %s %s is already registered"

24663

+msgstr "#pragma %s %s já está registrado"

24664

+

24665

+#: directives.c:1192

24666

+#, c-format

24667

+msgid "#pragma %s is already registered"

24668

+msgstr "#pragma %s já está registrado"

24669

+

24670

+#: directives.c:1222

24671

+msgid "registering pragma with NULL handler"

24672

+msgstr "registrando pragma com manipulador NULO"

24673

+

24674

+#: directives.c:1439

24675

+msgid "#pragma once in main file"

24676

+msgstr "#pragma ocorre uma vez no arquivo principal"

24677

+

24678

+#: directives.c:1462

24679

+msgid "invalid #pragma push_macro directive"

24680

+msgstr "diretiva inválida #pragma push_macro"

24681

+

24682

+#: directives.c:1517

24683

+msgid "invalid #pragma pop_macro directive"

24684

+msgstr "diretiva inválida #pragma pop_macro"

24685

+

24686

+#: directives.c:1572

24687

+msgid "invalid #pragma GCC poison directive"

24688

+msgstr "diretiva inválida #pragma GCC poison"

24689

+

24690

+#: directives.c:1581

24691

+#, c-format

24692

+msgid "poisoning existing macro \"%s\""

24693

+msgstr "envenenando macro existente \"%s\""

24694

+

24695

+#: directives.c:1600

24696

+msgid "#pragma system_header ignored outside include file"

24697

+msgstr "#pragma system_header ignorado fora do arquivo include"

24698

+

24699

+#: directives.c:1625

24700

+#, c-format

24701

+msgid "cannot find source file %s"

24702

+msgstr "não foi possível localizar o arquivo fonte %s"

24703

+

24704

+#: directives.c:1629

24705

+#, c-format

24706

+msgid "current file is older than %s"

24707

+msgstr "arquivo atual é mais velho do que %s"

24708

+

24709

+#: directives.c:1653

24710

+#, c-format

24711

+msgid "invalid \"#pragma GCC %s\" directive"

24712

+msgstr "diretiva inválida \"#pragma GCC %s\""

24713

+

24714

+#: directives.c:1847

24715

+msgid "_Pragma takes a parenthesized string literal"

24716

+msgstr "_Pragma leva uma literal de string entre parenteses"

24717

+

24718

+#: directives.c:1968

24719

+msgid "#else without #if"

24720

+msgstr "#else sem #if"

24721

+

24722

+#: directives.c:1973

24723

+msgid "#else after #else"

24724

+msgstr "#else após #else"

24725

+

24726

+#: directives.c:1975 directives.c:2008

24727

+msgid "the conditional began here"

24728

+msgstr "a condicional começou aqui"

24729

+

24730

+#: directives.c:2001

24731

+msgid "#elif without #if"

24732

+msgstr "#elif sem #if"

24733

+

24734

+#: directives.c:2006

24735

+msgid "#elif after #else"

24736

+msgstr "#elif após #else"

24737

+

24738

+#: directives.c:2044

24739

+msgid "#endif without #if"

24740

+msgstr "#endif sem #if"

24741

+

24742

+#: directives.c:2124

24743

+msgid "missing '(' after predicate"

24744

+msgstr "faltando \"(\" após predicado"

24745

+

24746

+#: directives.c:2139

24747

+msgid "missing ')' to complete answer"

24748

+msgstr "faltando \")\" para uma resposta completa"

24749

+

24750

+#: directives.c:2159

24751

+msgid "predicate's answer is empty"

24752

+msgstr "resposta do predicado está vazia"

24753

+

24754

+#: directives.c:2186

24755

+msgid "assertion without predicate"

24756

+msgstr "asserção sem predicado"

24757

+

24758

+#: directives.c:2189

24759

+msgid "predicate must be an identifier"

24760

+msgstr "predicado deve ser um identificador"

24761

+

24762

+#: directives.c:2275

24763

+#, c-format

24764

+msgid "\"%s\" re-asserted"

24765

+msgstr "\"%s\" re-assertado"

24766

+

24767

+#: directives.c:2567

24768

+#, c-format

24769

+msgid "unterminated #%s"

24770

+msgstr "#%s não terminado"

24771

+

24772

+#: directives-only.c:221 lex.c:2234 traditional.c:162

24773

+msgid "unterminated comment"

24774

+msgstr "comentário não terminado"

24775

+

24776

+#: errors.c:234

24777

+msgid "stdout"

24778

+msgstr "saída padrão"

24779

+

24780

+#: errors.c:236

24781

+#, c-format

24782

+msgid "%s: %s"

24783

+msgstr "%s: %s"

24784

+

24785

+#: expr.c:479 expr.c:577

24786

+msgid "fixed-point constants are a GCC extension"

24787

+msgstr "constantes de ponto fixo (fixed-point constants) é uma extensão GCC"

24788

+

24789

+#: expr.c:504

24790

+msgid "invalid prefix \"0b\" for floating constant"

24791

+msgstr "prefixo inválido \"0b\" para constante flutuante"

24792

+

24793

+#: expr.c:514

24794

+msgid "use of C99 hexadecimal floating constant"

24795

+msgstr "uso de constante flutuante hexadecimal de C99"

24796

+

24797

+#: expr.c:545

24798

+#, c-format

24799

+msgid "invalid suffix \"%.*s\" on floating constant"

24800

+msgstr "sufixo inválido \"%.*s\" na constante flutuante"

24801

+

24802

+#: expr.c:556 expr.c:616

24803

+#, c-format

24804

+msgid "traditional C rejects the \"%.*s\" suffix"

24805

+msgstr "C tradicional rejeita o sufixo \"%.*s\""

24806

+

24807

+#: expr.c:564

24808

+msgid "suffix for double constant is a GCC extension"

24809

+msgstr "sufixo para constante dupla (suffix for double constant) é uma extensão GCC"

24810

+

24811

+#: expr.c:570

24812

+#, c-format

24813

+msgid "invalid suffix \"%.*s\" with hexadecimal floating constant"

24814

+msgstr "sufixo inválido \"%.*s\" com constante flutuante hexadecimal"

24815

+

24816

+#: expr.c:581

24817

+msgid "decimal float constants are a GCC extension"

24818

+msgstr "constantes flutuante decimais (decimal float constants) é uma extensão GCC"

24819

+

24820

+#: expr.c:599

24821

+#, c-format

24822

+msgid "invalid suffix \"%.*s\" on integer constant"

24823

+msgstr "sufixo inválido \"%.*s\" em constante inteiro"

24824

+

24825

+#: expr.c:624

24826

+msgid "use of C++0x long long integer constant"

24827

+msgstr "uso de constante longo longo inteiro de C++0x"

24828

+

24829

+#: expr.c:625

24830

+msgid "use of C99 long long integer constant"

24831

+msgstr "uso de constante longo longo inteiro de C99"

24832

+

24833

+#: expr.c:641

24834

+msgid "imaginary constants are a GCC extension"

24835

+msgstr "constantes imaginárias (imaginary constants) é uma extensão GCC"

24836

+

24837

+#: expr.c:644

24838

+msgid "binary constants are a GCC extension"

24839

+msgstr "constantes binárias (binary constants) é uma extensão GCC"

24840

+

24841

+#: expr.c:737

24842

+msgid "integer constant is too large for its type"

24843

+msgstr "constante inteira é muito grande para seu tipo"

24844

+

24845

+#: expr.c:768

24846

+msgid "integer constant is so large that it is unsigned"

24847

+msgstr "constante inteira é tão grande que não está assinada"

24848

+

24849

+#: expr.c:863

24850

+msgid "missing ')' after \"defined\""

24851

+msgstr "faltando \")\" após \"defined\""

24852

+

24853

+#: expr.c:870

24854

+msgid "operator \"defined\" requires an identifier"

24855

+msgstr "operador \"defined\" requer um identificador"

24856

+

24857

+#: expr.c:878

24858

+#, c-format

24859

+msgid "(\"%s\" is an alternative token for \"%s\" in C++)"

24860

+msgstr "(\"%s\" é um token alternativo para \"%s\" em C++)"

24861

+

24862

+#: expr.c:888

24863

+msgid "this use of \"defined\" may not be portable"

24864

+msgstr "esse uso de \"defined\" pode não ser portátil"

24865

+

24866

+#: expr.c:948

24867

+msgid "user-defined literal in preprocessor expression"

24868

+msgstr "literal definida pelo usuário em expressão do preprocessador"

24869

+

24870

+#: expr.c:953

24871

+msgid "floating constant in preprocessor expression"

24872

+msgstr "constante flutuante em expressão do preprocessador"

24873

+

24874

+#: expr.c:959

24875

+msgid "imaginary number in preprocessor expression"

24876

+msgstr "número imaginário em expressão do preprocessador"

24877

+

24878

+#: expr.c:1007

24879

+#, c-format

24880

+msgid "\"%s\" is not defined"

24881

+msgstr "\"%s\" não está definido"

24882

+

24883

+#: expr.c:1020

24884

+msgid "assertions are a GCC extension"

24885

+msgstr "asserções (assertions) é uma extensão GCC"

24886

+

24887

+#: expr.c:1023

24888

+msgid "assertions are a deprecated extension"

24889

+msgstr "asserções (assertions) é uma extensão obsoleta"

24890

+

24891

+#: expr.c:1268

24892

+#, c-format

24893

+msgid "unbalanced stack in %s"

24894

+msgstr "pilha não balanceada em %s"

24895

+

24896

+#: expr.c:1288

24897

+#, c-format

24898

+msgid "impossible operator '%u'"

24899

+msgstr "operador impossível \"%u\""

24900

+

24901

+#: expr.c:1389

24902

+msgid "missing ')' in expression"

24903

+msgstr "faltando \")\" na expressão"

24904

+

24905

+#: expr.c:1418

24906

+msgid "'?' without following ':'"

24907

+msgstr "\"?\" sem estar seguido por \":\""

24908

+

24909

+#: expr.c:1428

24910

+msgid "integer overflow in preprocessor expression"

24911

+msgstr "estouro de inteiro em expressão do preprocessador"

24912

+

24913

+#: expr.c:1433

24914

+msgid "missing '(' in expression"

24915

+msgstr "faltando \"(\" na expressão"

24916

+

24917

+#: expr.c:1465

24918

+#, c-format

24919

+msgid "the left operand of \"%s\" changes sign when promoted"

24920

+msgstr "o operador à esquerda de \"%s\" altera o sinal quando promovido"

24921

+

24922

+#: expr.c:1470

24923

+#, c-format

24924

+msgid "the right operand of \"%s\" changes sign when promoted"

24925

+msgstr "o operador à direita de \"%s\" altera o sinal quando promovido"

24926

+

24927

+#: expr.c:1729

24928

+msgid "traditional C rejects the unary plus operator"

24929

+msgstr "C tradicional rejeita o operador unário mais"

24930

+

24931

+#: expr.c:1812

24932

+msgid "comma operator in operand of #if"

24933

+msgstr "operador vírgula em operando de #if"

24934

+

24935

+#: expr.c:1948

24936

+msgid "division by zero in #if"

24937

+msgstr "divisão por zero em #if"

24938

+

24939

+#: files.c:505

24940

+msgid "NULL directory in find_file"

24941

+msgstr "diretório NULO em find_file"

24942

+

24943

+#: files.c:553

24944

+msgid "one or more PCH files were found, but they were invalid"

24945

+msgstr "um ou mais arquivos PCH foram encontrados, mas são inválidos"

24946

+

24947

+#: files.c:556

24948

+msgid "use -Winvalid-pch for more information"

24949

+msgstr "use -Winvalid-pch para mais informações"

24950

+

24951

+#: files.c:660

24952

+#, c-format

24953

+msgid "%s is a block device"

24954

+msgstr "%s é um dispositivo de bloco"

24955

+

24956

+#: files.c:677

24957

+#, c-format

24958

+msgid "%s is too large"

24959

+msgstr "%s é muito grande"

24960

+

24961

+#: files.c:717

24962

+#, c-format

24963

+msgid "%s is shorter than expected"

24964

+msgstr "%s é muito menor do que esperado"

24965

+

24966

+#: files.c:953

24967

+#, c-format

24968

+msgid "no include path in which to search for %s"

24969

+msgstr "não foi incluído nenhum caminho no qual se possa procurar por %s"

24970

+

24971

+#: files.c:1381

24972

+msgid "Multiple include guards may be useful for:\n"

24973

+msgstr "Múltiplos include guards podem ser úteis para:\n"

24974

+

24975

+#: init.c:524

24976

+msgid "cppchar_t must be an unsigned type"

24977

+msgstr "cppchar_t deve ser um tipo não assinado"

24978

+

24979

+#: init.c:528

24980

+#, c-format

24981

+msgid "preprocessor arithmetic has maximum precision of %lu bits; target requires %lu bits"

24982

+msgstr "aritmética do preprocessador possui uma precisão máxima de %lu bits; o alvo requer %lu bits"

24983

+

24984

+#: init.c:535

24985

+msgid "CPP arithmetic must be at least as precise as a target int"

24986

+msgstr "aritmética do CPP deve ser pelo menos tão precisa quanto um int alvo"

24987

+

24988

+#: init.c:538

24989

+msgid "target char is less than 8 bits wide"

24990

+msgstr "char alvo é menor do que 8 bits"

24991

+

24992

+#: init.c:542

24993

+msgid "target wchar_t is narrower than target char"

24994

+msgstr "wchar_t alvo é mais estreito do que o char alvo"

24995

+

24996

+#: init.c:546

24997

+msgid "target int is narrower than target char"

24998

+msgstr "int alvo é mais estreito do que o char alvo"

24999

+

25000

+#: init.c:551

25001

+msgid "CPP half-integer narrower than CPP character"

25002

+msgstr "meio-inteiro do CPP é mais estreito do que o caractere do CPP"

25003

+

25004

+#: init.c:555

25005

+#, c-format

25006

+msgid "CPP on this host cannot handle wide character constants over %lu bits, but the target requires %lu bits"

25007

+msgstr "CPP nesta máquina não consegue manipular constantes de wide character acima de %lu bits, mas o alvo requer %lu bits"

25008

+

25009

+#: lex.c:910

25010

+msgid "backslash and newline separated by space"

25011

+msgstr "barra invertida e nova linha separadas por espaço"

25012

+

25013

+#: lex.c:915

25014

+msgid "backslash-newline at end of file"

25015

+msgstr "barra invertida e nova linha no final do arquivo"

25016

+

25017

+#: lex.c:931

25018

+#, c-format

25019

+msgid "trigraph ??%c converted to %c"

25020

+msgstr "trígrafo ??%c convertido para %c"

25021

+

25022

+#: lex.c:939

25023

+#, c-format

25024

+msgid "trigraph ??%c ignored, use -trigraphs to enable"

25025

+msgstr "trígrafo ??%c ignorado, use -trigraphs para habilitá-lo"

25026

+

25027

+#: lex.c:988

25028

+msgid "\"/*\" within comment"

25029

+msgstr "\"/*\" dentro de comentário"

25030

+

25031

+#: lex.c:1046

25032

+#, c-format

25033

+msgid "%s in preprocessing directive"

25034

+msgstr "%s em diretiva de preprocessamento"

25035

+

25036

+#: lex.c:1055

25037

+msgid "null character(s) ignored"

25038

+msgstr "um ou mais caracteres nulos ignorados"

25039

+

25040

+#: lex.c:1092

25041

+#, c-format

25042

+msgid "`%.*s' is not in NFKC"

25043

+msgstr "\"%.*s\" não está em NFKC"

25044

+

25045

+#: lex.c:1095

25046

+#, c-format

25047

+msgid "`%.*s' is not in NFC"

25048

+msgstr "\"%.*s\" não está em NFC"

25049

+

25050

+#: lex.c:1164 lex.c:1241

25051

+#, c-format

25052

+msgid "attempt to use poisoned \"%s\""

25053

+msgstr "tentativa de usar \"%s\" envenenado"

25054

+

25055

+#: lex.c:1172 lex.c:1249

25056

+msgid "__VA_ARGS__ can only appear in the expansion of a C99 variadic macro"

25057

+msgstr "__VA_ARGS__ pode aparecer apenas na expansão de uma macro variádica C99"

25058

+

25059

+#: lex.c:1178 lex.c:1255

25060

+#, c-format

25061

+msgid "identifier \"%s\" is a special operator name in C++"

25062

+msgstr "identificador \"%s\" é o nome de um operador especial em C++"

25063

+

25064

+#: lex.c:1399

25065

+msgid "raw string delimiter longer than 16 characters"

25066

+msgstr "delimitador de string não tratada (raw) maior do que 16 caracteres"

25067

+

25068

+#: lex.c:1402

25069

+#, c-format

25070

+msgid "invalid character '%c' in raw string delimiter"

25071

+msgstr "caractere inválido \"%c\" em delimitador de string não tratada (raw)"

25072

+

25073

+#: lex.c:1525 lex.c:1547

25074

+msgid "unterminated raw string"

25075

+msgstr "string não tratada (raw) não terminada"

25076

+

25077

+#: lex.c:1573 lex.c:1706

25078

+msgid "invalid suffix on literal; C++11 requires a space between literal and identifier"

25079

+msgstr "sufixo inválido em literal; C++11 requer um espaço entre literal e identificador"

25080

+

25081

+#: lex.c:1684

25082

+msgid "null character(s) preserved in literal"

25083

+msgstr "um ou mais caracteres nulos preservados em literal"

25084

+

25085

+#: lex.c:1687

25086

+#, c-format

25087

+msgid "missing terminating %c character"

25088

+msgstr "faltando o caractere de terminação %c"

25089

+

25090

+#: lex.c:2245

25091

+msgid "C++ style comments are not allowed in ISO C90"

25092

+msgstr "comentários no estilo C++ não são permitidos em ISO C90"

25093

+

25094

+#: lex.c:2247

25095

+msgid "(this will be reported only once per input file)"

25096

+msgstr "(isso será relatado apenas uma vez por arquivo de entrada)"

25097

+

25098

+#: lex.c:2252

25099

+msgid "multi-line comment"

25100

+msgstr "comentário multilinha"

25101

+

25102

+#: lex.c:2583

25103

+#, c-format

25104

+msgid "unspellable token %s"

25105

+msgstr "token %s impronunciável"

25106

+

25107

+#: macro.c:191

25108

+#, c-format

25109

+msgid "macro \"%s\" is not used"

25110

+msgstr "macro \"%s\" não é usada"

25111

+

25112

+#: macro.c:229 macro.c:426

25113

+#, c-format

25114

+msgid "invalid built-in macro \"%s\""

25115

+msgstr "macro interna inválida \"%s\""

25116

+

25117

+#: macro.c:263

25118

+msgid "could not determine file timestamp"

25119

+msgstr "não foi possível determinar o arquivo de marca de tempo"

25120

+

25121

+#: macro.c:361

25122

+msgid "could not determine date and time"

25123

+msgstr "não foi possível determinar a data e a hora"

25124

+

25125

+#: macro.c:377

25126

+msgid "__COUNTER__ expanded inside directive with -fdirectives-only"

25127

+msgstr "__COUNTER__ expandido dentro diretiva com -fdirectives-only"

25128

+

25129

+#: macro.c:535

25130

+msgid "invalid string literal, ignoring final '\\'"

25131

+msgstr "literal de string inválida, ignorando final \"\\\""

25132

+

25133

+#: macro.c:597

25134

+#, c-format

25135

+msgid "pasting \"%s\" and \"%s\" does not give a valid preprocessing token"

25136

+msgstr "colar \"%s\" em \"%s\" não resulta em nenhum token de preprocessamento válido"

25137

+

25138

+#: macro.c:719

25139

+msgid "ISO C99 requires rest arguments to be used"

25140

+msgstr "ISO C99 requer que argumentos restantes sejam usados"

25141

+

25142

+#: macro.c:724

25143

+#, c-format

25144

+msgid "macro \"%s\" requires %u arguments, but only %u given"

25145

+msgstr "macro \"%s\" requer %u argumentos, mas apenas %u foram fornecidos"

25146

+

25147

+#: macro.c:729

25148

+#, c-format

25149

+msgid "macro \"%s\" passed %u arguments, but takes just %u"

25150

+msgstr "macro \"%s\" passou %u argumentos, mas usa apenas %u"

25151

+

25152

+#: macro.c:923 traditional.c:680

25153

+#, c-format

25154

+msgid "unterminated argument list invoking macro \"%s\""

25155

+msgstr "lista de argumentos interminável chamando macro \"%s\""

25156

+

25157

+#: macro.c:1074

25158

+#, c-format

25159

+msgid "function-like macro \"%s\" must be used with arguments in traditional C"

25160

+msgstr "macro \"%s\" do tipo função deve ser usada com argumento em C tradicional"

25161

+

25162

+# http://gcc.gnu.org/bugzilla/show_bug.cgi?id=33305

25163

+#: macro.c:1746

25164

+#, c-format

25165

+msgid "invoking macro %s argument %d: empty macro arguments are undefined in ISO C90 and ISO C++98"

25166

+msgstr "chamando macro %s argumento %d: argumentos de macro vazios estão indefinidos em ISO C90 e ISO C++98"

25167

+

25168

+#: macro.c:2708

25169

+#, c-format

25170

+msgid "duplicate macro parameter \"%s\""

25171

+msgstr "parâmetro de macro \"%s\" duplicado"

25172

+

25173

+#: macro.c:2754

25174

+#, c-format

25175

+msgid "\"%s\" may not appear in macro parameter list"

25176

+msgstr "\"%s\" não pode aparecer na lista de parâmetros de macro"

25177

+

25178

+#: macro.c:2762

25179

+msgid "macro parameters must be comma-separated"

25180

+msgstr "parâmetros de macro devem ser separados por vírgula"

25181

+

25182

+#: macro.c:2779

25183

+msgid "parameter name missing"

25184

+msgstr "faltando nome de parâmetro"

25185

+

25186

+#: macro.c:2797

25187

+msgid "anonymous variadic macros were introduced in C99"

25188

+msgstr "macros variádicas anônimas foram introduzidas em C99"

25189

+

25190

+#: macro.c:2802

25191

+msgid "ISO C does not permit named variadic macros"

25192

+msgstr "ISO C não permite macros variádicas nomeadas"

25193

+

25194

+#: macro.c:2811

25195

+msgid "missing ')' in macro parameter list"

25196

+msgstr "faltando \")\" na lista de parâmetros de macro"

25197

+

25198

+#: macro.c:2860

25199

+msgid "'##' cannot appear at either end of a macro expansion"

25200

+msgstr "\"##\" não pode aparecer no final da expansão de macro"

25201

+

25202

+#: macro.c:2895

25203

+msgid "ISO C99 requires whitespace after the macro name"

25204

+msgstr "ISO C99 requer espaço em branco após o nome de macro"

25205

+

25206

+#: macro.c:2919

25207

+msgid "missing whitespace after the macro name"

25208

+msgstr "faltando espaço em branco após o nome de macro"

25209

+

25210

+#: macro.c:2953

25211

+msgid "'#' is not followed by a macro parameter"

25212

+msgstr "\"#\" não está seguido por um parâmetro de macro"

25213

+

25214

+#: macro.c:3111

25215

+#, c-format

25216

+msgid "\"%s\" redefined"

25217

+msgstr "\"%s\" re-definido"

25218

+

25219

+#: macro.c:3117

25220

+msgid "this is the location of the previous definition"

25221

+msgstr "essa é a localização da definição anterior"

25222

+

25223

+#: macro.c:3178

25224

+#, c-format

25225

+msgid "macro argument \"%s\" would be stringified in traditional C"

25226

+msgstr "argumento de macro \"%s\" estaria em uma string no C tradicional"

25227

+

25228

+#: macro.c:3205

25229

+#, c-format

25230

+msgid "invalid hash type %d in cpp_macro_definition"

25231

+msgstr "tipo de hash inválido %d em cpp_macro_definition"

25232

+

25233

+#: pch.c:87 pch.c:345 pch.c:359 pch.c:377 pch.c:383 pch.c:392 pch.c:399

25234

+msgid "while writing precompiled header"

25235

+msgstr "enquanto realizava escrita de header pré-compilado"

25236

+

25237

+#: pch.c:619

25238

+#, c-format

25239

+msgid "%s: not used because `%.*s' is poisoned"

25240

+msgstr "%s: não usado porque \"%.*s\" está envenenado"

25241

+

25242

+#: pch.c:641

25243

+#, c-format

25244

+msgid "%s: not used because `%.*s' not defined"

25245

+msgstr "%s: não usado porque \"%.*s\" não está definido"

25246

+

25247

+#: pch.c:653

25248

+#, c-format

25249

+msgid "%s: not used because `%.*s' defined as `%s' not `%.*s'"

25250

+msgstr "%s: não usado porque \"%.*s\" está definido como \"%s\", e não \"%.*s\""

25251

+

25252

+#: pch.c:694

25253

+#, c-format

25254

+msgid "%s: not used because `%s' is defined"

25255

+msgstr "%s: não usado porque \"%s\" está definido"

25256

+

25257

+#: pch.c:714

25258

+#, c-format

25259

+msgid "%s: not used because `__COUNTER__' is invalid"

25260

+msgstr "%s: não usado porque \"__COUNTER__\" é inválido"

25261

+

25262

+#: pch.c:723 pch.c:898

25263

+msgid "while reading precompiled header"

25264

+msgstr "enquanto realizava leitura de header pré-compilado"

25265

+

25266

+#: traditional.c:750

25267

+#, c-format

25268

+msgid "detected recursion whilst expanding macro \"%s\""

25269

+msgstr "detectada recursão enquanto expandia macro \"%s\""

25270

+

25271

+#: traditional.c:968

25272

+msgid "syntax error in macro parameter list"

25273

+msgstr "erro de sintaxe na lista de parâmetros de macro"

25274

Index: libcpp/po/ChangeLog

25275

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

25276

--- a/src/libcpp/po/ChangeLog (.../tags/gcc_4_8_2_release)

25277

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

25278

@@ -1,3 +1,11 @@

25279

+2013-12-18 Joseph Myers <joseph@codesourcery.com>

25280

+

25281

+ * pt_BR.po: New.

25282

+

25283

+2013-11-01 Joseph Myers <joseph@codesourcery.com>

25284

+

25285

+ * tr.po: Update.

25286

+

25287

2013-10-16 Release Manager

25288

25289

* GCC 4.8.2 released.

25290

Index: libcpp/po/tr.po

25291

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

25292

--- a/src/libcpp/po/tr.po (.../tags/gcc_4_8_2_release)

25293

+++ b/src/libcpp/po/tr.po (.../branches/gcc-4_8-branch)

25294

@@ -1,20 +1,22 @@

25295

# Turkish translations for cpplib messages.

25296

25297

+# This file is distributed under the same license as the gcc package.

25298

#

25299

# Nilgün Belma Bugüner <nilgun@buguner.name.tr>, 2001, ..., 2007.

25300

+# Volkan Gezer <vlkngzr@gmail.com>, 2013.

25301

msgid ""

25302

msgstr ""

25303

-"Project-Id-Version: cpplib 4.2.0\n"

25304

+"Project-Id-Version: cpplib 4.8.0\n"

25305

"Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"

25306

-"POT-Creation-Date: 2013-02-24 01:05+0000\n"

25307

-"PO-Revision-Date: 2007-05-23 01:17+0300\n"

25308

-"Last-Translator: Nilgün Belma Bugüner <nilgun@buguner.name.tr>\n"

25309

+"POT-Creation-Date: 2013-03-15 17:42+0000\n"

25310

+"PO-Revision-Date: 2013-11-01 22:29+0100\n"

25311

+"Last-Translator: Volkan Gezer <vlkngzr@gmail.com>\n"

25312

"Language-Team: Turkish <gnu-tr-u12a@lists.sourceforge.net>\n"

25313

"Language: tr\n"

25314

"MIME-Version: 1.0\n"

25315

"Content-Type: text/plain; charset=UTF-8\n"

25316

"Content-Transfer-Encoding: 8bit\n"

25317

-"X-Generator: KBabel 1.11.4\n"

25318

+"X-Generator: Lokalize 1.5\n"

25319

"Plural-Forms: nplurals=2; plural=(n != 1);\n"

25320

25321

#: charset.c:673

25322

@@ -121,10 +123,9 @@

25323

msgstr "ISO standardı olmayan önceleme dizgesi, '\\%c'"

25324

25325

#: charset.c:1320

25326

-#, fuzzy, c-format

25327

-#| msgid "unknown escape sequence '\\%c'"

25328

+#, c-format

25329

msgid "unknown escape sequence: '\\%c'"

25330

-msgstr "bilinmeyen önceleme dizgesi '\\%c'"

25331

+msgstr "bilinmeyen kaçış dizgesi: '\\%c'"

25332

25333

#: charset.c:1328

25334

#, c-format

25335

@@ -163,10 +164,9 @@

25336

msgstr "#%s bir GCC uzantısıdır"

25337

25338

#: directives.c:362

25339

-#, fuzzy, c-format

25340

-#| msgid "#%s is a GCC extension"

25341

+#, c-format

25342

msgid "#%s is a deprecated GCC extension"

25343

-msgstr "#%s bir GCC uzantısıdır"

25344

+msgstr "#%s eskimiş bir GCC uzantısıdır"

25345

25346

#: directives.c:375

25347

msgid "suggest not using #elif in traditional C"

25348

@@ -247,7 +247,7 @@

25349

25350

#: directives.c:909

25351

msgid "unexpected end of file after #line"

25352

-msgstr ""

25353

+msgstr "#line satırından sonra beklenmeyen dosya sonu"

25354

25355

#: directives.c:912

25356

#, c-format

25357

@@ -271,7 +271,7 @@

25358

#: directives.c:1068 directives.c:1070 directives.c:1072 directives.c:1658

25359

#, c-format

25360

msgid "%s"

25361

-msgstr ""

25362

+msgstr "%s"

25363

25364

#: directives.c:1096

25365

#, c-format

25366

@@ -312,16 +312,12 @@

25367

msgstr "main dosyasında '#pragma once'"

25368

25369

#: directives.c:1462

25370

-#, fuzzy

25371

-#| msgid "invalid #pragma GCC poison directive"

25372

msgid "invalid #pragma push_macro directive"

25373

-msgstr "geçersiz #pragma GCC poison yönergesi"

25374

+msgstr "geçersiz #pragma güdümlü_makro yönergesi"

25375

25376

#: directives.c:1517

25377

-#, fuzzy

25378

-#| msgid "invalid #pragma GCC poison directive"

25379

msgid "invalid #pragma pop_macro directive"

25380

-msgstr "geçersiz #pragma GCC poison yönergesi"

25381

+msgstr "geçersiz #pragma güdümlü_makro yönergesi"

25382

25383

#: directives.c:1572

25384

msgid "invalid #pragma GCC poison directive"

25385

@@ -347,10 +343,9 @@

25386

msgstr "mevcut dosya %s den daha eski"

25387

25388

#: directives.c:1653

25389

-#, fuzzy, c-format

25390

-#| msgid "invalid #pragma GCC poison directive"

25391

+#, c-format

25392

msgid "invalid \"#pragma GCC %s\" directive"

25393

-msgstr "geçersiz #pragma GCC poison yönergesi"

25394

+msgstr "geçersiz \"#pragma GCC %s\" yönergesi"

25395

25396

#: directives.c:1847

25397

msgid "_Pragma takes a parenthesized string literal"

25398

@@ -405,7 +400,7 @@

25399

msgid "\"%s\" re-asserted"

25400

msgstr "\"%s\" tekrar olumlanmış"

25401

25402

-#: directives.c:2566

25403

+#: directives.c:2567

25404

#, c-format

25405

msgid "unterminated #%s"

25406

msgstr "sonlandırılmamış #%s"

25407

@@ -424,16 +419,12 @@

25408

msgstr "%s: %s"

25409

25410

#: expr.c:479 expr.c:577

25411

-#, fuzzy

25412

-#| msgid "imaginary constants are a GCC extension"

25413

msgid "fixed-point constants are a GCC extension"

25414

-msgstr "sanal sabitler bir GCC genişletmesidir"

25415

+msgstr "sabit noktalı sabitler bir GCC uzantısıdır"

25416

25417

#: expr.c:504

25418

-#, fuzzy

25419

-#| msgid "invalid suffix \"%.*s\" on floating constant"

25420

msgid "invalid prefix \"0b\" for floating constant"

25421

-msgstr "gerçel sabitin \"%.*s\" soneki geçersiz"

25422

+msgstr "kayan nokta için geçerisz \"0b\" öntakısı"

25423

25424

#: expr.c:514

25425

msgid "use of C99 hexadecimal floating constant"

25426

@@ -450,10 +441,8 @@

25427

msgstr "geleneksel C \"%.*s\" sonekini kullanmaz"

25428

25429

#: expr.c:564

25430

-#, fuzzy

25431

-#| msgid "imaginary constants are a GCC extension"

25432

msgid "suffix for double constant is a GCC extension"

25433

-msgstr "sanal sabitler bir GCC genişletmesidir"

25434

+msgstr "çift sabit için öntakı bir GCC uzantısıdır"

25435

25436

#: expr.c:570

25437

#, c-format

25438

@@ -461,10 +450,8 @@

25439

msgstr "onaltılık kayan sabitli \"%.*s\" soneki geçersiz"

25440

25441

#: expr.c:581

25442

-#, fuzzy

25443

-#| msgid "imaginary constants are a GCC extension"

25444

msgid "decimal float constants are a GCC extension"

25445

-msgstr "sanal sabitler bir GCC genişletmesidir"

25446

+msgstr "onluk kayan sabitler bir GCC uzantısıdır"

25447

25448

#: expr.c:599

25449

#, c-format

25450

@@ -472,10 +459,8 @@

25451

msgstr "tamsayı sabitte sonek \"%.*s\" soneki geçersiz"

25452

25453

#: expr.c:624

25454

-#, fuzzy

25455

-#| msgid "use of C99 long long integer constant"

25456

msgid "use of C++0x long long integer constant"

25457

-msgstr "ISO C99 long long tamsayı sabitleri yasaklar"

25458

+msgstr "ISO C++0x long long tamsayı sabitlerinin kullanımı"

25459

25460

#: expr.c:625

25461

msgid "use of C99 long long integer constant"

25462

@@ -486,10 +471,8 @@

25463

msgstr "sanal sabitler bir GCC genişletmesidir"

25464

25465

#: expr.c:644

25466

-#, fuzzy

25467

-#| msgid "imaginary constants are a GCC extension"

25468

msgid "binary constants are a GCC extension"

25469

-msgstr "sanal sabitler bir GCC genişletmesidir"

25470

+msgstr "ikili sabitler bir GCC uzantısıdır"

25471

25472

#: expr.c:737

25473

msgid "integer constant is too large for its type"

25474

@@ -517,10 +500,8 @@

25475

msgstr "\"defined\" bu kullanımıyla uyarlanabilir olmayabilir"

25476

25477

#: expr.c:948

25478

-#, fuzzy

25479

-#| msgid "integer overflow in preprocessor expression"

25480

msgid "user-defined literal in preprocessor expression"

25481

-msgstr "önişlemci ifadesinde tamsayı taşması"

25482

+msgstr "önişleyici ifadesinde kullanıcı tanımlı bağımlı"

25483

25484

#: expr.c:953

25485

msgid "floating constant in preprocessor expression"

25486

@@ -536,20 +517,17 @@

25487

msgstr "\"%s\" tanımlı değil"

25488

25489

#: expr.c:1020

25490

-#, fuzzy

25491

-#| msgid "#%s is a GCC extension"

25492

msgid "assertions are a GCC extension"

25493

-msgstr "#%s bir GCC uzantısıdır"

25494

+msgstr "belirteçler bir GCC uzantısıdır"

25495

25496

#: expr.c:1023

25497

msgid "assertions are a deprecated extension"

25498

-msgstr ""

25499

+msgstr "belirteçler artık kullanılmayan bir ifadedir"

25500

25501

#: expr.c:1268

25502

-#, fuzzy, c-format

25503

-#| msgid "unbalanced stack in #if"

25504

+#, c-format

25505

msgid "unbalanced stack in %s"

25506

-msgstr "#if ifadesinde karşılıksız yığın"

25507

+msgstr "%s içinde dengelenmemiş yığın"

25508

25509

#: expr.c:1288

25510

#, c-format

25511

@@ -594,39 +572,39 @@

25512

msgid "division by zero in #if"

25513

msgstr "#if içinde sıfırla bölme"

25514

25515

-#: files.c:504

25516

+#: files.c:505

25517

msgid "NULL directory in find_file"

25518

msgstr "find_file içinde boş dizin"

25519

25520

-#: files.c:542

25521

+#: files.c:553

25522

msgid "one or more PCH files were found, but they were invalid"

25523

msgstr "bir veya daha fazla PCH dosyası bulundu ama bunlar geçersiz"

25524

25525

-#: files.c:545

25526

+#: files.c:556

25527

msgid "use -Winvalid-pch for more information"

25528

msgstr "daha fazla bilgi almak için -Winvalid-pch kullanın"

25529

25530

-#: files.c:643

25531

+#: files.c:660

25532

#, c-format

25533

msgid "%s is a block device"

25534

msgstr "%s bir blok aygıtıdır"

25535

25536

-#: files.c:660

25537

+#: files.c:677

25538

#, c-format

25539

msgid "%s is too large"

25540

msgstr "%s çok büyük"

25541

25542

-#: files.c:700

25543

+#: files.c:717

25544

#, c-format

25545

msgid "%s is shorter than expected"

25546

msgstr "%s beklenenden daha kısa"

25547

25548

-#: files.c:935

25549

+#: files.c:953

25550

#, c-format

25551

msgid "no include path in which to search for %s"

25552

msgstr "%s için aranacaklar içinde başlık dosyaları yolu yok"

25553

25554

-#: files.c:1363

25555

+#: files.c:1381

25556

msgid "Multiple include guards may be useful for:\n"

25557

msgstr "Çoklu include önlemleri aşağıdakiler için kullanışlı olabilir:\n"

25558

25559

@@ -717,27 +695,24 @@

25560

#: lex.c:1178 lex.c:1255

25561

#, c-format

25562

msgid "identifier \"%s\" is a special operator name in C++"

25563

-msgstr ""

25564

+msgstr "\"%s\" belirteci, C++'da özel bir işleç adıdır"

25565

25566

#: lex.c:1399

25567

msgid "raw string delimiter longer than 16 characters"

25568

-msgstr ""

25569

+msgstr "ham dizge ayracı 16 karakterden uzun"

25570

25571

#: lex.c:1402

25572

-#, fuzzy, c-format

25573

-#| msgid "universal character %.*s is not valid in an identifier"

25574

+#, c-format

25575

msgid "invalid character '%c' in raw string delimiter"

25576

-msgstr "evrensel karakter %.*s bir belirteç içinde geçerli değil"

25577

+msgstr "ham dizge ayracında geçersiz karakter '%c'"

25578

25579

#: lex.c:1525 lex.c:1547

25580

-#, fuzzy

25581

-#| msgid "unterminated #%s"

25582

msgid "unterminated raw string"

25583

-msgstr "sonlandırılmamış #%s"

25584

+msgstr "bitirilmemiş ham dizge"

25585

25586

#: lex.c:1573 lex.c:1706

25587

msgid "invalid suffix on literal; C++11 requires a space between literal and identifier"

25588

-msgstr ""

25589

+msgstr "geçersiz ifade soneki; C++11 ifade ve tanımlayıcı arasında bir boşluk gerektirir"

25590

25591

#: lex.c:1684

25592

msgid "null character(s) preserved in literal"

25593

@@ -785,7 +760,7 @@

25594

25595

#: macro.c:377

25596

msgid "__COUNTER__ expanded inside directive with -fdirectives-only"

25597

-msgstr ""

25598

+msgstr "__COUNTER__ -fdirectives-only ile talimat içerisinde genişletildi"

25599

25600

#: macro.c:535

25601

msgid "invalid string literal, ignoring final '\\'"

25602

@@ -823,7 +798,7 @@

25603

#: macro.c:1746

25604

#, c-format

25605

msgid "invoking macro %s argument %d: empty macro arguments are undefined in ISO C90 and ISO C++98"

25606

-msgstr ""

25607

+msgstr "%s makrosu %d argümanı uygulanıyor: ISO C90 ve ISO C++98 içerisinde boş makro argümanları tanımsızdır"

25608

25609

#: macro.c:2708

25610

#, c-format

25611

@@ -890,38 +865,36 @@

25612

msgid "invalid hash type %d in cpp_macro_definition"

25613

msgstr "cpp_macro_definition içindeki isimli yapı türü %d geçersiz"

25614

25615

-#: pch.c:87 pch.c:335 pch.c:347 pch.c:365 pch.c:371 pch.c:380 pch.c:387

25616

+#: pch.c:87 pch.c:345 pch.c:359 pch.c:377 pch.c:383 pch.c:392 pch.c:399

25617

msgid "while writing precompiled header"

25618

msgstr "önderlemeli başlık yazılırken"

25619

25620

-#: pch.c:607

25621

-#, fuzzy, c-format

25622

-#| msgid "%s: not used because `%s' is defined"

25623

+#: pch.c:619

25624

+#, c-format

25625

msgid "%s: not used because `%.*s' is poisoned"

25626

-msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

25627

+msgstr "%s: `%.*s' zehirli olduğu için kullanılmadı"

25628

25629

-#: pch.c:629

25630

+#: pch.c:641

25631

#, c-format

25632

msgid "%s: not used because `%.*s' not defined"

25633

msgstr "%s: `%.*s' tanımlı olmadığından kullanılmadı"

25634

25635

-#: pch.c:641

25636

+#: pch.c:653

25637

#, c-format

25638

msgid "%s: not used because `%.*s' defined as `%s' not `%.*s'"

25639

msgstr "%s: `%.*s' kullanılmadı çünkü `%s' olarak tanımlı, `%.*s' değil"

25640

25641

-#: pch.c:682

25642

+#: pch.c:694

25643

#, c-format

25644

msgid "%s: not used because `%s' is defined"

25645

msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

25646

25647

-#: pch.c:702

25648

-#, fuzzy, c-format

25649

-#| msgid "%s: not used because `%s' is defined"

25650

+#: pch.c:714

25651

+#, c-format

25652

msgid "%s: not used because `__COUNTER__' is invalid"

25653

-msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

25654

+msgstr "%s: `__COUNTER__' geçersiz olduğundan kullanılmadı"

25655

25656

-#: pch.c:711 pch.c:886

25657

+#: pch.c:723 pch.c:898

25658

msgid "while reading precompiled header"

25659

msgstr "önderlemeli başlık okunurken"

25660

25661

Index: .

25662

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

25663

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

25664

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

25665

25666

Property changes on: .

25667

___________________________________________________________________

25668

Modified: svn:mergeinfo

25669

Merged /trunk:r202766,204547